Theoretical Aspects of Recursive Petri Nets

  • Serge Haddad
  • Denis Poitrenaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1639)


The model of recursive Petri nets (RPNs) has been introduced in the field of multi-agent systems in order to model flexible plans for agents. In this paper we focus on some theoretical aspects of RPNs. More precisely, we show that this model is a strict extension of the model of Petri nets in the following sense: the family of languages of RPNs strictly includes the union of Petri net and Context Free languages. Then we prove the main result of this work, the decidability of the reachability problem for RPNs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. DFS98.
    C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. (ICALP’98) L.N.C.S, 1443:103–115, July 1998.Google Scholar
  2. Esp97.
    J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.CrossRefMathSciNetGoogle Scholar
  3. HP99a.
    S. Haddad and D. Poitrenaud. On the expressive power of recursive Petri net. Submitted to the 12th International Symposium on Fundamentals of Computation Theory, FCT’99, August 1999.Google Scholar
  4. HP99b.
    S. Haddad and D. Poitrenaud. Recursive Petri net languages are recursive. Submitted to the 10th International Conference on Concurrency Theory, CONCUR’99, August 1999.Google Scholar
  5. Jan79.
    M. Jantzen. On the hierarchy of Petri net languages. RAIRO, 13(1):19–30, 1979.zbMATHMathSciNetGoogle Scholar
  6. Kos82.
    S.R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th Annual Symposium on Theory of Computing, pages 267–281, 1982.Google Scholar
  7. Lam88.
    J. L. Lambert. Some consequences of the decidability of the reachability problem for Petri nets. In Advances in Petri Nets 1988, volume 340 of LNCS, pages 266–282, Berlin, Germany, June 1988. Springer-Verlag.Google Scholar
  8. May81.
    E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238–246, 1981.Google Scholar
  9. Rei95.
    K. Reinhardt. Reachability in Petri nets with inhibitor arcs. Unpublished manuscript. See reinhard, 1995.
  10. SH95.
    A. El Fallah Seghrouchni and S. Haddad. A formal model for coordinating plans in multiagents systems. In Proceedings of Intelligent Agents Workshop, Oxford United Kingdom, November 1995. Augusta Technology Ltd, Brooks University.Google Scholar
  11. SH96.
    A. El Fallah Seghrouchni and S. Haddad. A recursive model for distributed planning. In Second International Conference on Multi-Agent Systems, Kyoto, Japon, December 1996.Google Scholar
  12. Val78a.
    R. Valk. On the computational power of extended Petri nets. (MFCS’78) L.N.C.S, 64:526–535, September 1978.Google Scholar
  13. Val78b.
    R. Valk. Self-modifying nets, a natural extension of Petri nets. (ICALP’78) L.N.C.S, 62:464–476, July 1978.Google Scholar
  14. Yen92.
    H-C. Yen. A unified approach for deciding the existence of certain Petri net paths. Information and Computation, 96:119–137, 1992.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Serge Haddad
    • 1
  • Denis Poitrenaud
    • 2
  1. 1.LAMSADE - UPRESA 7024Université Paris IXParis
  2. 2.LIP6 - UMR 7606Université Paris VI, Jussieu 4Paris

Personalised recommendations