Skip to main content
SpringerLink
Log in

Petri Nets

  • Chapter
  • First Online:
Augmented Marked Graphs

  • 567 Accesses

Abstract

This chapter provides the fundamentals of Petri nets to be used in this book, especially for readers who have no prior knowledge of Petri nets. It starts with the basic definition and terminology of Petri nets. These are followed by a comprehensive description of the properties of Petri nets, such as liveness, boundedness, reversibility and conservativeness. Algebraic characterizations of the properties are also provided. We then discuss two well-known subclasses of Petri nets, namely, state machines and marked graphs. They will be referenced in the subsequence chapters of this book.

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
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.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

References

  1. C.A. Petri, Kommunikation mit Automaten, PhD dissertation, University of Bonn, Germany, 1962

    Google Scholar 

  2. C.A. Petri, Communication with Automata, DTIC Research Report AD0630125, Defense Technical Information Centre, 1966

    Google Scholar 

  3. L. Peterson, Petri Net Theory and the Modeling of System (Prentice Hall, Englewood Cliffs, 1981)

    Google Scholar 

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

    Book  MATH  Google Scholar 

  5. T. Murata, Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  6. J. Desel, W. Reisig, Place transition Petri nets, in Lectures on Petri Nets I: Basic Models, ed. by W. Reisig, G. Rozenberg. Lecture Notes in Computer Science, vol. 1491 (Springer, Berlin, 1998), pp. 122–173

    Chapter  Google Scholar 

  7. F. Commoner, Deadlocks in Petri Nets, Applied Data Research, Massachusetts, Report CA-7206-2311, 1972

    Google Scholar 

  8. M.H.T. Hack, Analysis of Production Schemata by Petri Nets, MS Thesis, Massachusetts Institute of Technology, 1972

    Google Scholar 

  9. M.H.T. Hack, Corrections to “Analysis of Production Schemata by Petri Nets”, Computation Structures Note 17, Massachuesetts Institute of Technology, 1974

    Google Scholar 

  10. F. Commoner et al., Marked directed graphs. J. Comput. Syst. Sci. 5, 511–523 (1971)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Open University of Hong Kong, Hong Kong, Hong Kong SAR

    King Sing Cheung (Director of Information Technology)

Authors
  1. King Sing Cheung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Cheung, K.S. (2014). Petri Nets. In: Augmented Marked Graphs. Springer, Cham. https://doi.org/10.1007/978-3-319-06428-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06428-4_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06427-7

  • Online ISBN: 978-3-319-06428-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation