Skip to main content
SpringerLink
Log in

Some Decidability Results for Nested Petri Nets

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1999)

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

Abstract

Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure makes some important verification problems undecidable (reachability, boundedness, . . . ) while some other problems remain decidable (termination, inevitability, . . . ).

This work was mainly prepared during the stay of the first author at Lab. Specification & Verification in June–July 1998, and was partly supported by INTAS-RFBR (Grant 95-0378) and the Russian Fund for Basic Research (Project No. 96-01-01717)

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. P. A. Abdulla, K. Čerāns, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Symp. Logic in Computer Science (LICS’96), New Brunswick, NJ, USA, July 1996, pages 313–321, 1996.

    Google Scholar 

  2. T. Araki and T. Kasami. Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science, 3(1):85–104, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Christensen and L. Petrucci. Towards a modular analysis of coloured petri nets. In Proc. 13th Int. Conf. Application and Theory of Petri Nets, Sheffield, UK, June 1992, volume 616 of Lecture Notes in Computer Science, pages 113–133. Springer, 1992.

    Google Scholar 

  4. G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Application and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179–198. Springer, 1994.

    Google Scholar 

  5. C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP’98), Aalborg, Denmark, July 1998, volume 1443 of Lecture Notes in Computer Science, pages 103–115. Springer, 1998.

    Google Scholar 

  6. C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T nets. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP’99), Prague, Czech Republic, July 1999, volume 1644 of Lecture Notes in Computer Science, pages 301–310. Springer, 1999.

    Google Scholar 

  7. A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144–179, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere ! Accepted for publication in Theor. Comp. Sci., October 1997.

    Google Scholar 

  9. A. Finkel and Ph. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN’98), Campinas, Brazil, Apr. 1998, volume 1380 of Lecture Notes in Computer Science, pages 102–118. Springer, 1998.

    Google Scholar 

  10. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. 1, Basic Concepts. EATCS Monographs on Theoretical Computer Science. Springer, 1992.

    Google Scholar 

  11. C. Lakos. From coloured Petri nets to object Petri nets. In Proc. 16th Int. Conf. Application and Theory of Petri Nets, Turin, Italy, June 1995, volume 935 of Lecture Notes in Computer Science, pages 278–297. Springer, 1995.

    Google Scholar 

  12. I. A. Lomazova. Multi-agent systems and In Proc. Int. Workshop on Distributed Artificial Intelligence and Multi-Agent Systems (DAIMAS’97), St. Petersburg, Russia, June 1997, pages 147–152, 1997.

    Google Scholar 

  13. I. A. Lomazova On Proving Large Distributed Systems: Petri Net Modules Verification. In Proc. 4th Int. Conf. Parallel Computing Technologies (PaCT’97), Yaroslavl, Russia, Sep. 1997, volume 1277 of Lecture Notes in Computer Science, pages 70–75. Springer, 1997.

    Google Scholar 

  14. I. A. Lomazova. Modelling of multi-agent dynamic systems by nested Petri nets (in Russian), August 1998. In Programmnye Sistemy: Teoreticheskie Osnovy i Prilozheniya, pages 143–156, Moscow: Nauka, 1999.

    Google Scholar 

  15. D. Moldt and F. Wienberg. Multi-agent-systems based on coloured Petri nets. In Proc. 18th Int. Conf. Application and Theory of Petri Nets, Toulouse, France, June 1997, volume 1248 of Lecture Notes in Computer Science, pages 82–101. Springer, 1997.

    Google Scholar 

  16. W. Reisig. Petri Nets. An Introduction, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer, 1985.

    Google Scholar 

  17. C. Sibertin-Blanc. Cooperative nets. In Proc. 15th Int. Conf. Application and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 471–490. Springer, 1994.

    Google Scholar 

  18. E. Smith. A survey on high-level Petri-net theory. EATCS Bull., 59:267–293, June 1996.

    MATH  Google Scholar 

  19. R. Valk. Petri nets as token objects: An introduction to elementary object nets. In Proc. 19th Int. Conf. Application and Theory of Petri Nets, Lisbon, Portugal, June 1998, volume 1420 of Lecture Notes in Computer Science, pages 1–25. Springer, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Program Systems Institute of the Russian Academy of Science, Pereslavl-Zalessky, 152140, Russia

    Irina A. Lomazova

  2. Lab. Specification & Verification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235, Cachan Cedex, France

    Philippe Schnoebelen

Authors
  1. Irina A. Lomazova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Technology, Technical University of Denmark, Bldg. 244, 2800, Lyngby, Denmark

    Dines Bjøner

  2. Computer Science Department, Technical University of Munich, Arcisstr. 21, 80290, Munich, Germany

    Manfred Broy

  3. A.P. Ershov Institute of Informatics Systems, av. Ac. Lavrentyev 6, Novosibirsk, 630090, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lomazova, I.A., Schnoebelen, P. (2000). Some Decidability Results for Nested Petri Nets. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-46562-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67102-2

  • Online ISBN: 978-3-540-46562-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation