ABSTRACT
Data-centric dynamic systems are systems where both the process controlling the dynamics and the manipulation of data are equally central. We study verification of (first-order) mu-calculus variants over relational data-centric dynamic systems, where data are maintained in a relational database, and the process is described in terms of atomic actions that evolve the database. Action execution may involve calls to external services, thus inserting fresh data into the system. As a result such systems are infinite-state. We show that verification is undecidable in general, and we isolate notable cases where decidability is achieved. Specifically we start by considering service calls that return values deterministically (depending only on passed parameters). We show that in a mu-calculus variant that preserves knowledge of objects appeared along a run we get decidability under the assumption that the fresh data introduced along a run are bounded, though they might not be bounded in the overall system. In fact we tie such a result to a notion related to weak acyclicity studied in data exchange. Then, we move to nondeterministic services and we investigate decidability under the assumption that knowledge of objects is preserved only if they are continuously present. We show that if infinitely many values occur in a run but do not accumulate in the same state, then we get again decidability. We give syntactic conditions to avoid this accumulation through the novel notion of "generate-recall acyclicity", which ensures that every service call activation generates new values that cannot be accumulated indefinitely.
- S. Abiteboul, P. Bourhis, A. Galland, and B. Marinoiu. The AXML artifact model. In TIME, 2009. Google Scholar
Digital Library
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995. Google Scholar
Digital Library
- B. Bagheri Hariri, D. Calvanese, G. De Giacomo, R. De Masellis, and P. Felli. Foundations of relational artifacts verification. In BPM, 2011. Google Scholar
Digital Library
- B. Bagheri Hariri, D. Calvanese, G. De Giacomo, A. Deutsch, and M. Montali. Verification of relational data-centric dynamic systems with external services. Corr technical report, arXiv.org e-Print archive, 2012. Available at http://arxiv.org/abs/1203.0024.Google Scholar
- C. Baier and J.-P. Katoen. Principles of Model Checking. MIT Press, 2008. Google Scholar
Digital Library
- F. Belardinelli, A. Lomuscio, and F. Patrizi. An abstraction technique for the verification of artifact-centric systems. In KR, 2012.Google Scholar
- D. Berardi, D. Calvanese, G. De Giacomo, R. Hull, and M. Mecella. Automatic composition of transition-based semantic web services with messaging. In VLDB, 2005. Google Scholar
Digital Library
- K. Bhattacharya, N. S. Caswell, S. Kumaran, A. Nigam, and F. Y. Wu. Artifact-centered operational modeling: Lessons from customer engagements. IBM Systems Journal, 46(4):703--721, 2007. Google Scholar
Digital Library
- K. Bhattacharya, C. E. Gerede, R. Hull, R. Liu, and J. Su. Towards formal analysis of artifact-centric business process models. In BPM, 2007. Google Scholar
Digital Library
- M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In LICS, 2006. Google Scholar
Digital Library
- A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu. Rewriting systems with data. In FCT, 2007. Google Scholar
Digital Library
- A. Bouajjani, P. Habermehl, and R. Mayr. Automatic verification of recursive procedures with one integer parameter. TCS, 295, 2003. Google Scholar
Digital Library
- P. Bouyer, A. Petit, and D. Thérien. An algebraic approach to data languages and timed languages. Information and Computation, 182(2), 2003. Google Scholar
Digital Library
- J. Bradfield and C. Stirling. Modal mu-calculi. In Handbook of Modal Logic, volume 3. Elsevier, 2007.Google Scholar
Cross Ref
- O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification of infinite structures. In Handbook of Process Algebra. Elsevier Science, 2001.Google Scholar
Cross Ref
- D. Calvanese, G. De Giacomo, R. Hull, and J. Su. Artifact-centric workflow dominance. In ICSOC, 2009. Google Scholar
Digital Library
- P. Cangialosi, G. De Giacomo, R. De Masellis, and R. Rosati. Conjunctive artifact-centric services. In ICSOC, 2010.Google Scholar
Cross Ref
- E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. The MIT Press, 1999. Google Scholar
Digital Library
- D. Cohn and R. Hull. Business artifacts: A data-centric approach to modeling business operations and processes. IEEE Data Engineering Bullettin, 32(3), 2009.Google Scholar
- E. Damaggio, A. Deutsch, and V. Vianu. Artifact systems with data dependencies and arithmetic. In ICDT, 2011. Google Scholar
Digital Library
- E. Damaggio, R. Hull, and R. Vaculín. On the equivalence of incremental and fixpoint semantics for business artifacts with guard-stage-milestone lifecycles. In BPM, 2011. Google Scholar
Digital Library
- S. Demri and R. Lazić, LTL with the freeze quantifier and register automata. ACM TOCL, 10(3), 2009. Google Scholar
Digital Library
- A. Deutsch, R. Hull, F. Patrizi, and V. Vianu. Automatic verification of data-centric business processes. In ICDT, 2009. Google Scholar
Digital Library
- A. Deutsch, M. Marcus, L. Sui, V. Vianu, and D. Zhou. A verifier for interactive, data-driven web applications. In SIGMOD, 2005. Google Scholar
Digital Library
- A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web applications. JCSS, 73(3):442--474, 2007. Google Scholar
Digital Library
- E. A. Emerson. Model checking and the mu-calculus. In Descriptive Complexity and Finite Models, 1996.Google Scholar
- R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. TCS, 336(1), 2005. Google Scholar
Digital Library
- C. E. Gerede, K. Bhattacharya, and J. Su. Static analysis of business artifact-centric operational models. In IEEE Int. Conf. on Service-Oriented Computing and Applications, 2007. Google Scholar
Digital Library
- C. E. Gerede and J. Su. Specification and verification of artifact behaviors in business process models. In ICSOC, 2007. Google Scholar
Digital Library
- R. Hull. Artifact-centric business process models: Brief survey of research results and challenges. In OTM Confederated Int. Conf., 2008. Google Scholar
Digital Library
- M. Jurdzinski and R. Lazić. Alternation-free modal mu-calculus for data trees. In LICS, 2007. Google Scholar
Digital Library
- J. Küster, K. Ryndina, and H. Gall. Generation of BPM for object life cycle compliance. In BPM, 2007.Google Scholar
- R. Lazić, T. Newcomb, J. Ouaknine, A. Roscoe, and J. Worrell. Nets with tokens which carry data. In ICATPN, 2007. Google Scholar
Digital Library
- D. C. Luckham, D. M. R. Park, and M. Paterson. On formalised computer programs. JCSS, 4(3), 1970. Google Scholar
Digital Library
- M. Meier, M. Schmidt, F. Wei, and G. Lausen. Semantic query optimization in the presence of types. In PODS, 2010. Google Scholar
Digital Library
- F. Neven, T. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM TOCL, 5(3), 2004. Google Scholar
Digital Library
- A. Nigam and N. S. Caswell. Business artifacts: An approach to operational specification. IBM Systems Journal, 42(3), 2003. Google Scholar
Digital Library
- D. M. R. Park. Finiteness is mu-ineffable. TCS, 3(2), 1976.Google Scholar
- C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001. Google Scholar
Digital Library
- W. M. P. van der Aalst, P. Barthelmess, C. A. Ellis, and J. Wainer. Proclets: A framework for lightweight interacting workflow processes. Int. J. of Cooperative Information Systems, 10(4), 2001.Google Scholar
- X. Zhao, J. Su, H. Yang, and Z. Qiu. Enforcing constraints on life cycles of business artifacts. In TASE, 2009. Google Scholar
Digital Library
Index Terms
Verification of relational data-centric dynamic systems with external services
Recommendations
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer ScienceModal μ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on the proof-...
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
We revisit Janin and Walukiewicz’s classic result on the expressive completeness of the modal mu-calculus with respect to Monadic Second Order Logic (MSO), which is where the mu-calculus corresponds precisely to the fragment of MSO that is invariant ...
Tree automata, Mu-Calculus and determinacy
SFCS '91: Proceedings of the 32nd annual symposium on Foundations of computer scienceIt is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees. Since complementation is trivial in the mu-calculus, the equivalence provides a radically simplified, alternative proof of M.O. Rabin'...






Comments