Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication

  • Fernando Rosa-Velardo
  • David de Frutos-Escrig
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5606)


In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverability remains decidable for them. We also extended P/T nets with the capability of nets to replicate themselves, creating a new component, initially marked in some fixed way, obtaining g-RN systems. We proved that these two extensions of P/T nets are equivalent, so that g-RN systems have undecidable reachability and decidable coverability. Finally, for the class of the so called ν-RN systems, P/T nets with both name creation and replication, we proved that they are Turing complete, so that also coverability turns out to be undecidable. In this paper we study how can we restrict the models of ν-APNs (and, therefore, g-RN systems) and ν-RN systems in order to keep decidability of reachability and coverability, respectively. We prove that if we forbid synchronizations between the different components in a g-RN system, then reachability is still decidable. The proof is done by reducing it to reachability in a class of multiset rewriting systems, similar to Recursive Petri Nets. Analogously, if we forbid name communication between the different components in a ν-RN system, or restrict communication to happen only for a given finite set of names, we obtain decidability of coverability.


Decidability Result Restricted Model Reachability Problem Decidable Coverability Compatible Transition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. In: Fourth ACM Conference on Computer and Communications Security, pp. 36–47. ACM Press, New York (1997)Google Scholar
  2. 2.
    Abdulla, P.A., Jonsson, B.: Verifying Programs with Unreliable Channels. Information and Computation 127(2), 91–101 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160, 109–127 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the Expressive Power of Well-Structured Transition Systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 99–114. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Decker, G., Puhlmann, F.: Extending BPMN for Modelling Complex Choreographies. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol. 4803, pp. 24–40. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Decker, G., Weske, M.: Instance Isolation Analysis for Service-Oriented Architectures. In: Proceedings of the 2008 IEEE International Conference on Services (SCC 2008), pp. 249–256. IEEE Computer Society, Los Alamitos (2008)CrossRefGoogle Scholar
  8. 8.
    Delzanno, G.: An overview of MSR(C): A CLP-based Framework for the Symbolic Verification of Parameterized Concurrent Systems. In: 11th Int. Workshop on Functional and Logic Programming, WFLP 2002. Electronic Notes in Theoretical Computer Science, vol. 76. Elsevier, Amsterdam (2002)Google Scholar
  9. 9.
    Esparza, J., Nielsen, M.: Decidability issues for Petri Nets - a survey. Bulletin of the EATCS 52, 244–262 (1994)zbMATHGoogle Scholar
  10. 10.
    Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63–92 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Gordon, A.: Notes on Nominal Calculi for Security and Mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 262–330. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Haddad, S., Poitrenaud, D.: Recursive Petri Nets. Acta Informatica 44(7-8), 463–508 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Kummer, O.: Undecidability in object-oriented Petri nets. Petri Net Newsletter 59, 18–23 (2000)Google Scholar
  14. 14.
    Lazic, R., Newcomb, T.C., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with Tokens Which Carry Data. Fundamenta Informaticae 88(3), 251–274 (2008)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Lomazova, I.: Nested Petri nets - a formalism for specification and verification of multi-agent distributed systems. Fundamenta Informaticae 43(1-4), 195–214 (2000)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Information and Computation 100(1), 1–40 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Needham, R.M.: Names. Distributed Systems, pp. 89–101. Addison-Wesley, Reading (1989)Google Scholar
  18. 18.
    Rosa-Velardo, F., de Frutos-Escrig, D., Marroquín-Alonso, O.: On the expressiveness of Mobile Synchronizing Petri Nets. In: 3rd Int. Workshop on Security Issues in Concurrency, SecCo 2005. ENTCS, vol. 180(1), pp. 77–94. Elsevier, Amsterdam (2007)Google Scholar
  19. 19.
    Rosa-Velardo, F., de Frutos-Escrig, D.: Name Creation vs. Replication in Petri Net Systems. Fundamenta Informaticae 88(3), 329–356 (2008); special issue on Selected Papers from ATPN 2007. IOS Press (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Fernando Rosa-Velardo
    • 1
  • David de Frutos-Escrig
    • 1
  1. 1.Dpto. de Sistemas Informáticos y ComputaciónUniversidad Complutense de MadridSpain

Personalised recommendations