Model checking Petri nets with names using data-centric dynamic systems

Formal Aspects of Computing

Volumn 28, Issue 4, 2016, Pages 615-641

  Montali, Marco ^a   Rivkin, Andrey ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

Dataaware business processes; First order temporal logics; Formal verification; Infinite state systems; Petri nets with names; Resource aware business processes

Indexed keywords

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; DISTRIBUTED DATABASE SYSTEMS; FORMAL VERIFICATION; PETRI NETS; TEMPORAL LOGIC;

BUSINESS PROCESS; CROSS FERTILIZATION; FIRST-ORDER TEMPORAL LOGIC; FORMAL SPECIFICATION AND VERIFICATION; FUNDAMENTAL PROPERTIES; INFINITE STATE SYSTEMS; MODEL CHECKING PROBLEM; RELATIONAL DATABASE;

MODEL CHECKING;

EID: 84964389220     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-016-0370-6     Document Type: Article

References (34)

1. Abadi M, Gordon AD (1997) A calculus for cryptographic protocols: the spi calculus. In: Proceedings of the 4th ACM conference on computer and communications security, CCS ’97, pp 36-47, New York, NY, USA. ACM
2. Anisimov NA, Koutny M (1995) On compositionality and petri nets in protocol engineering. In: Piotr Dembinski and Marek Sredniawa, editors, PSTV, vol. 38 of IFIP Conference Proceedings, pp 71-86. Chapman and Hall
3. Bojanczyk M, Braud L, Klin B, Lasota S (2012) Towards nominal computation. In Proceedings of POPL. ACM Press
4. Bagheri Hariri B, Calvanese D, De Giacomo G, Deutsch A, Montali M (2013) Verification of relational data-centric dynamic systems with external services. In: Proceedings of PODS, pp 163-174. ACM
5. Bagheri Hariri B, Calvanese D, Deutsch A, Montali M (2014) State boundedness in data-aware dynamic systems. In: Proceedings of KR
6. Bagheri Hariri B, Calvanese B, Montali M, De Giacomo G, De Masellis R, Felli P (2013) Description logic knowledge and action bases. J Artif Intell Res
7. Belardinelli F, Lomuscio A, Patrizi F (2012) An abstraction technique for the verification of artifact-centric systems. In: Proceedings KR
8. Bojanczyk M, Segoufin L, Torunczyk S (2013) Verification of database-driven systems via amalgamation. In: Proceedings of PODS
9. Calvanese D, De Giacomo G, Montali M (2013) Foundations of data aware process analysis: a database theory perspective. In: Proceedings of PODS
10. Calvanese D, De Giacomo G, Montali M, Patrizi F (2013) Verification and synthesis in description logic based dynamic systems. In: Proceedings of RR, vol 7994 of LNCS. Springer, New York
11. Chandra A, Harel D (1980) Computable queries for relational database systems. J Comput Syst Sci 21
12. Decker G, Weske M (2008) Instance isolation analysis for service-oriented architectures. In: Proceedings of SCC, pp 249-256. IEEE Computer Society
13. Allen Emerson E (1996) Model checking and the Mu-calculus. In: Proceedings of the DIMACS symposium on descriptive complexity and finite models, pp 185-214. American Mathematical Society Press
14. Esparza J (1994) On the decidability of model checking for several μ-calculi and petri nets. In: Proceedings of CAAP, vol 787 of LNCS, pp 115-129. Springer, New York
15. Gabbay M, Pitts AM (2002) A new approach to abstract syntax with variable binding. Formal Asp Comput 13(3-5)
16. Hüchting R, Majumdar R, Meyer R (2013) A theory of name boundedness. In: Proceedings of CONCUR, vol 8052 of LNCS, pp 182-196. Springer, New York
17. Jensen K, Michael Kristensen L (2009) Coloured petri nets—modelling and validation of concurrent systems. Springer, New York
18. Köhler M, Rölke H (2004) Properties of object petri nets. In: Proceedings of ICATPN, vol 3099 of LNCS, pp 278-297. Springer, New York
19. Libkin L (2004) Elements of finite model theory, vol 7360 of LNCS, chapter fixed point logics and complexity classes. Springer, New York
20. Lazic R, Newcomb T, Ouaknine J, Roscoe AW, Worrell J (2008) Nets with tokens which carry data. Fundam Inf 88(3):251-274
21. Martos-Salgado M, Rosa-Velardo F (2011) Dynamic soundness in resource-constrained workflow nets. In: Proceedings of FMOODS/FORTE, vol 6722 of LNCS, pp 259-273. Springer, New York
22. Needham RM (1989) Names. In: Mullender S (ed) Distributed systems, pp 89-101. ACM Press, Wokingham
23. Peterson JL (1980) A note on colored petri nets. Inf Process Lett 11(1):40-43
24. Reisig W (2013) Understanding petri nets: modeling techniques, analysis methods, case studies. Springer, New York
25. Rosa-Velardo F, de Frutos-Escrig D (2008) Name creation vs. replication in petri net systems. Fundam Inf 88(3):329-356
26. Rosa-Velardo F, de Frutos-Escrig D (2011) Decidability and complexity of petri nets with unordered data. Theor Comput Sci 412(34):4439-4451
27. Vardi MY (2005) Model checking for database theoreticians. In: Proceedings of ICDT, vol 3363 of LNCS, pp 1-16. Springer, New York
28. van der Aalst WMP (1997)Verification ofworkflownets. In: Proceedings of ICATPN, vol 1248 of LNCS, pp 407-426. Springer, New York
29. van der Aalst WMP (2005) Pi calculus versus petri nets: let us eat humble pie rather than further inflate the pi hype. BPTrends 3(5)
30. van der Aalst WMP, Stahl C (2011) Modeling business processes—a petri net-oriented approach. Cooperative Information Systems series. MIT Press
31. van Hee KM, Serebrenik A, Sidorova N, Voorhoeve M (2005) Soundness of resource-constrained workflow nets. In: Proceedings of ICATPN, vol 3536 of LNCS, pp 250-267. Springer, New York
32. van Hee KM, Sidorova N, Voorhoeve M (2006) Resource-constrained workflow nets. Fundam Inf 71(2-3):243-257
33. Vianu V (2009) Automatic verification of database-driven systems: a new frontier. In: Proceedings of ICDT, pp 1-13
34. Westergaard M, Maria Maggi F (2011) Modeling and verification of a protocol for operational support using coloured petri nets. In: Proceedings of Applications and theory of petri nets—32nd international conference, PETRINETS 2011, Newcastle, UK, June 20-24, 2011, pp 169-188