Skip to main content
Springer Nature Link
Log in

Infinity of Intermediate States Is Decidable for Petri Nets

  • Conference paper
Applications and Theory of Petri Nets 2004 (ICATPN 2004)

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

Included in the following conference series:

Abstract

Based on the algorithms to decide reachability for Petri nets, we show how to decide whether the number of markings reachable on paths between two given markings is finite or infinite.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Karp, R.M., Miller, R.E.: Parallel Program Schemata. Journal of Computer and System Sciences 3(2), 147–195 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proceedings of the 14th Annual ACM STOC, pp. 267–281 (1982)

    Google Scholar 

  3. Lambert, J.L.: A structure to decide reachability in Petri nets. Theoretical Computer Science 99(1), 79–104 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lambert, J.L.: Finding a Partial Solution to a Linear System of Equations in Positive Integers. Comput. Math. Applic. 15(3), 209–212 (1988)

    Article  MATH  Google Scholar 

  5. Lipton, R.J.: The Reachability Problem Requires Exponential Space, Research Report 62, Yale University (1976)

    Google Scholar 

  6. Mayr, E.W.: Ein Algorithmus für das allgemeine Erreichbarkeitsproblem bei Petrinetzen und damit zusammenhängende Probleme, Technischer Bericht der Technischen Universität München TUM-I8010 (Dissertation), Institut für Informatik (1980)

    Google Scholar 

  7. Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13(3), 441–460 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Netcharts: Bridging the gap between HMSCs and executable specifications. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 296–310. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Priese, L., Wimmel, H.: Petri-Netze, p. 376. Springer, Heidelberg (2003) ISBN 3-540-44289-8

    MATH  Google Scholar 

  10. Reutenauer, C.: The Mathematics of Petri nets. Prentice-Hall, Englewood Cliffs (1990)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, Germany

    Harro Wimmel

Authors
  1. Harro Wimmel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Spain

    Jordi Cortadella

  2. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Wolfgang Reisig

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wimmel, H. (2004). Infinity of Intermediate States Is Decidable for Petri Nets. In: Cortadella, J., Reisig, W. (eds) Applications and Theory of Petri Nets 2004. ICATPN 2004. Lecture Notes in Computer Science, vol 3099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27793-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27793-4_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22236-1

  • Online ISBN: 978-3-540-27793-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics