Skip to main content
SpringerLink
Log in

Inductive Counting and the Reachability Problem for Petri Nets

  • Chapter
  • First Online:
Carl Adam Petri: Ideas, Personality, Impact

  • 424 Accesses

Abstract

Verification involves checking the correctness of computer programs, conducted on a model of the overall system, and often this model is a Petri net. In the context of safety, verification may mean showing that a system cannot reach an unsafe state. Richard J. Lipton established a lower bound on the reachability for Petri nets, we discuss how this came about.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 49.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    After writing this chapter, a new lower bound for the reachability problem was found [1]. This is the first improvement of Lipton’s result after more than 40 years.

References

  1. W. Czerwinski, S. Lasota, R. Lazic, J. Leroux, F. Mazowiecki, The reachability problem for Petri nets is not elementary (extended abstract). CoRR, abs/1809.07115. arXiv:1809.07115 (2018)

    Google Scholar 

  2. J. Esparza, K. Heljanko. Unfoldings - A Partial-Order Approach to Model Checking (Springer, Berlin, 2008)

    MATH  Google Scholar 

  3. N. Immerman, Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935–938 (1988)

    Article  MathSciNet  Google Scholar 

  4. R.J. Lipton, The reachability problem requires exponential space. Technical Report 62, Yale University, 1976

    Google Scholar 

  5. R.J. Lipton, K.W. Regan, We all guessed wrong. Gödel’s lost letter and P = NP (2009). https://rjlipton.wordpress.com/2009/02/19/we-all-guessed-wrong/

  6. R.J. Lipton, K.W. Regan, An EXPSPACE lower bound Gödel’s lost letter and P = NP (2009). https://rjlipton.wordpress.com/2009/04/08/an-expspace-lower-bound/

  7. E.W. Mayr, An algorithm for the general Petri net reachability problem. in STOC (ACM, New York, 1981), pp. 238–246

    Google Scholar 

  8. R. Meyer, T. Strazny, Petruchio: from dynamic networks to nets, in CAV, ed. by T. Touili, B. Cook, P. Jackson. Lecture Notes in Computer Science, vol. 6174 (Springer, Berlin, 2010), pp. 175–179

    Chapter  Google Scholar 

  9. W. Reisig, Petri Nets: An Introduction (Springer, Berlin, 1985)

    Book  Google Scholar 

  10. P.H. Starke, Analyse von Petri-Netz-Modellen (Teubner, Leipzig, 1990)

    Book  Google Scholar 

  11. R. Szelepcsényi, The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3), 279–284 (1988)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Theoretical Computer Science, Technische Universität Braunschweig, Braunschweig, Germany

    Peter Chini & Roland Meyer

Authors
  1. Peter Chini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Chini .

Editor information

Editors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany

    Wolfgang Reisig

  2. Leiden Institute of Advanced Computer Science, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chini, P., Meyer, R. (2019). Inductive Counting and the Reachability Problem for Petri Nets. In: Reisig, W., Rozenberg, G. (eds) Carl Adam Petri: Ideas, Personality, Impact. Springer, Cham. https://doi.org/10.1007/978-3-319-96154-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96154-5_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96153-8

  • Online ISBN: 978-3-319-96154-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation