Skip to main content
SpringerLink
Log in

Theoretical Aspects of Recursive Petri Nets

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1999 (ICATPN 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1639))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.

    Article  MathSciNet  Google Scholar 

  3. 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. 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. M. Jantzen. On the hierarchy of Petri net languages. RAIRO, 13(1):19–30, 1979.

    MATH  MathSciNet  Google Scholar 

  6. 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. 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. 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. K. Reinhardt. Reachability in Petri nets with inhibitor arcs. Unpublished manuscript. See http://www-fs.informatik.uni-tuebingen.de/ reinhard, 1995.

  10. 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. 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. R. Valk. On the computational power of extended Petri nets. (MFCS’78) L.N.C.S, 64:526–535, September 1978.

    Google Scholar 

  13. 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. H-C. Yen. A unified approach for deciding the existence of certain Petri net paths. Information and Computation, 96:119–137, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE - UPRESA 7024, Université Paris IX, Dauphine Place du Maréchal Delattre de Tassigny, 75775, Paris, cedex 16

    Serge Haddad

  2. LIP6 - UMR 7606, Université Paris VI, Jussieu 4, Place Jussieu, 75252, Paris, cedex 05

    Denis Poitrenaud

Authors
  1. Serge Haddad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Poitrenaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, C.so Svizzera 185, I-10149, Torino, Italy

    Susanna Donatelli

  2. LIACS, Leiden University , 2300 RA, Leiden, The Netherlands

    Jetty Kleijn

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haddad, S., Poitrenaud, D. (1999). Theoretical Aspects of Recursive Petri Nets. In: Donatelli, S., Kleijn, J. (eds) Application and Theory of Petri Nets 1999. ICATPN 1999. Lecture Notes in Computer Science, vol 1639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48745-X_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48745-X_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66132-0

  • Online ISBN: 978-3-540-48745-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation