Advertisement

Formal Verification of Petri Nets with Names

  • Marco MontaliEmail author
  • Andrey Rivkin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9421)

Abstract

Petri nets with name creation and management have been recently introduced so as to make Petri nets able to model the dynamics of (distributed) systems equipped with channels, cyphering keys, or computing boundaries. While traditional formal properties such as boundedness, coverability, and reachability, have been thoroughly studied for this class of Petri nets, formal verification against rich temporal properties has not been investigated so far. In this paper, we attack this verification problem. We introduce sophisticated variants of first-order \(\mu \)-calculus to specify rich properties that simultaneously account for the system dynamics and the names present in its states. We then analyse the (un)decidability boundaries for the verification of such logics, by considering different notions of boundedness. Notably, our decidability results are obtained via a translation to data-centric dynamic systems, a recently devised framework for the formal specification and verification of business processes working over relational database with constraints. In this light, our results contribute to the cross-fertilization between areas that have not been extensively related so far.

Supplementary material

References

  1. 1.
    Bagheri Hariri, B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M.: Verification of relational data-centric dynamic systems with external services. CoRR Technical report, arXiv.org e-Print archive (2012). http://arxiv.org/abs/1203.0024
  2. 2.
    Bagheri Hariri, B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M.: Verification of relational data-centric dynamic systems with external services. In: Proceedings of PODS, pp. 163–174. ACM (2013)Google Scholar
  3. 3.
    Bagheri Hariri, B., Calvanese, D., Deutsch, A., Montali, M.: State boundedness in data-aware dynamic systems. In: Proceedings of KR (2014)Google Scholar
  4. 4.
    Calvanese, D., De Giacomo, G., Montali, M.: Foundations of data aware process analysis: a database theory perspective. In: Proceedings of PODS (2013)Google Scholar
  5. 5.
    Decker, G., Weske, M.: Instance isolation analysis for service-oriented architectures. In: Proceedings of SCC, pp. 249–256. IEEE Computer Society (2008)Google Scholar
  6. 6.
    Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log 10(3), 16 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Esparza, J.: On the decidability of model checking for several \(\mu \)-calculi and petri nets. In: Tison, S. (ed.) CAPP 1994. LNCS, vol. 787, pp. 115–129. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  8. 8.
    Reisig, W., Rozenberg, G. (eds.): Lectures on Petri Nets I: Basic Models. Advances in Petri Nets. LNCS, vol. 1491. Springer, Heidelberg (1998)zbMATHGoogle Scholar
  9. 9.
    Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in petri net systems. Fundam. Inform. 88(3), 329–356 (2008)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439–4451 (2011)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Free University of Bozen-BolzanoBolzanoItaly

Personalised recommendations