Skip to main content
SpringerLink
Log in

A Systems Theory View of Petri Nets

  • Chapter
Advances in Control Theory and Applications

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 353))

Abstract

Petri nets are a family of powerful discrete event models whose interest has grown, within the automatic control community, in parallel with the development of the theory of discrete event systems. In this tutorial paper our goal is that of giving a flavor, by means of simple examples, of the features that make Petri nets a good model for systems theory and of pointing out at a few open areas for research. We focus on Place/Transitions nets, the simplest Petri net model. In particular we compare Petri nets with automata, and show that the former model has several advantages over the latter, not only because it is more general but also because it offers a better structure that has been used for developing computationally efficient algorithms for analysis and synthesis.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Benasser A (2000) Reachability in Petri nets: an approach based on constraint programming, Ph.D. Thesis, Université de Lille, France (in French)

    Google Scholar 

  2. Bourdeaud’huy T, Yim P (2004) Synthse de rseaux de Petri partir d’exigences, Actes de la 5me conf. francophone de Modlisation et Simulation, (Nantes, France), 413–420, (in French)

    Google Scholar 

  3. Cabasino M P, Giua A, Seatzu C (2006) Identification of deterministic Petri nets, Proceedings of 8th International Workshop on Discrete Event Systems, Ann Arbor, Michigan, USA

    Google Scholar 

  4. Cabasino M P, Giua A, Seatzu C (2006) Identification of unbounded Petri nets from their coverability graph, Proceedings of 45th IEEE Conference on Decision and Control

    Google Scholar 

  5. Cassandras C G, Lafortune S (1999) Introduction to Discrete Event Systems. Kluwer Academic Publishers

    Google Scholar 

  6. Chu F, Xie X (1997) Deadlock analysis of Petri nets using siphons and mathematical programming, IEEE Transactions on Robotics and Automation, 13: 793–804

    Article  Google Scholar 

  7. Corona D, Giua A, Seatzu C (2004) Marking estimation of Petri nets with silent transitions, Proceedings of 43rd IEEE Conference on Decision and Control

    Google Scholar 

  8. Badouel E, Darondeau P (1998) Theory of regions. Lecture Notes in Computer Science: Lectures on Petri Nets I: Basic Models, Springer-Verlag, (eds. Reisig, W. and Rozenberg, G.), 1491: 529–586

    Google Scholar 

  9. David R, Alla H (2005) Discrete, continous and hybrid Petri nets. Springer Verlag, Heidelberg

    Google Scholar 

  10. DiCesare F, Harhalakis G, Proth J M, Silva M, Vernadat F B (1993) Practice of Petri Nets in Manufacturing. Chapman and Hall

    Google Scholar 

  11. Ezpeleta J, Colom J M, Martinez J (1995) A PN based deadlock prevention policy for flexible manufacturing systems, IEEE Transactions on Robotics and Automation, 11: 173–184

    Article  Google Scholar 

  12. Gaubert S, Giua A (1999) Petri net languages and infinite subsets of ℕm, Journal of Computer and System Sciences, 59: 373–391

    Article  MATH  MathSciNet  Google Scholar 

  13. Giua A, DiCesare F, Silva M (1992) Generalized mutual exclusion constraints on nets with uncontrollable transitions, Prooceedings of IEEE International Conference on Systems, Man and Cybernetics

    Google Scholar 

  14. Giua A, Seatzu C (2002) Observability of Place/Transition nets, IEEE Transactions on Automatic Control, 47: 1424–1437

    Article  MathSciNet  Google Scholar 

  15. Giua A, Seatzu C, Basile F (2004) Observer based state-feedback control of timed Petri nets with deadlock recovery, IEEE Transactions on Automatic Control, 49: 17–29

    Article  MathSciNet  Google Scholar 

  16. Giua A, Seatzu C (2005) Fault detection for discrete event systems using labeled Petri nets,” Proocedings of the 44th IEEE Conference on Decision and Control and European Control Conference

    Google Scholar 

  17. Giua A, Seatzu C (2005) Identification of free-labeled Petri nets via integer programming, Proocedings of the 44th IEEE Conference on Decision and Control and European Control Conference

    Google Scholar 

  18. Giua A, Corona D, Seatzu C (2005) State estimation of λ-free labeled Petri nets with contact-free nondeterministic transitions, Journal of Discrete Event Dynamic Systems, 15:85–108

    Article  MATH  MathSciNet  Google Scholar 

  19. Hiraishi K (1992) Construction of a class of safe Petri nets by presenting firing sequences. Lecture Notes in Computer Science; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, Springer-Verlag, (ed. K. Jensen), 616: 244–262

    Google Scholar 

  20. Holloway L E, Krogh B H, Giua A (1997) A survey of Petri nets methods for controlled discrete event systems, Discrete Event Dynamic Systems, 7:151–190

    Article  MATH  Google Scholar 

  21. Iordache M V, Moody J O, Antsaklis P J (2002) Synthesis of deadlock prevention supervisors using Petri nets, IEEE Transactions on Robotics and Automation, 18: 59–68

    Article  Google Scholar 

  22. Iordache MV, Antsaklis P J (2006) Supervisory Control of Concurrent Systems. A Petri Net Structural Approach. Series: Systems and Control: Foundations and Applications. Birkhuser

    Google Scholar 

  23. Lewis H R, Papadimitriou C H (1981) Elements of the Theory of Computation. Prentice-Hall

    Google Scholar 

  24. Li Z, Zhou M (2004) Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems, IEEE Transactions on Systems, Man, Cybernetics, Part A, 34: 38–51

    Article  Google Scholar 

  25. Meda M E, Ramírez A, Malo A (1998) Identification in discrete event systems, Proceedings of 1998 IEEE International Conference on Systems, Man and Cybernetics, 740–745

    Google Scholar 

  26. Murata T (1977) State equation, controllability, and maximal matching of Petri nets, IEEE Transactions on Automatic Control, 22:412–416

    Article  MATH  MathSciNet  Google Scholar 

  27. Murata T (1989) Petri nets: properties, analysis and applications, Proceedings IEEE 77: 541–580

    Article  Google Scholar 

  28. Park J, Reveliotis S A (2000) Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems, IEEE Transactions on Automatic Control, 16: 190–195

    Google Scholar 

  29. Park J, Reveliotis S A (2002) Policy mixtures: a novel approach for enhancing the operational flexibility of resource allocation systems with alternate routings, IEEE Transactions on Robotics and Automation, 18:616–620

    Article  Google Scholar 

  30. Park J, Reveliotis S A (2002) Liveness-enforcing supervision for resource allocation systems with uncontrollable behavior and forbidden states, IEEE Transactions on Robotics and Automation, 18: 234–238

    Article  Google Scholar 

  31. Parigot M, Peltz E (1985) A logical formalism for the study of the finite behavior of Petri nets, in Advances in Petri Nets 1985, Lecture Notes in Computer Science 222, G. Rozenberg (ed.), Springer Verlag, 346–361

    Google Scholar 

  32. Peterson J L (1981) Petri Net Theory and the Modeling of Systems. Prentice-Hall

    Google Scholar 

  33. Ramadge P J, Wonham W M (1989) The control of discrete event systems, Proceedings IEEE, 77: 81–98

    Article  Google Scholar 

  34. Recalde L (1998) Structural methods for the design and analysis of concurrent systems modeled with Place/Transition nets, PhD Thesis, DIIS. Univ. Zaragoza

    Google Scholar 

  35. Reveliotis S A (2005) Siphon-based characterization of liveness and liveness-enforcing supervision for sequential resource allocation systems, In Deadlock Resolution in Computer-Integrated Systems, M. Zhou and M. P. Fanti, (Eds), Marcel Dekker, Inc., 283–307

    Google Scholar 

  36. Silva M, Colom J M, Campos J (1992) Linear algebraic techniques for the analysis of Petri nets, Proceedings of International Symposium on Mathematical Theory of Networks and Systems

    Google Scholar 

  37. Sreenivas R S, Krogh B H (1992) On Petri net models of infinite state supervisors, IEEE Transactions on Automatic Control, 37: 274–277

    Article  MathSciNet  Google Scholar 

  38. Sreenivas R S (2002) On minimal representations of Petri net languages, 6th Workshop on Discrete Event Dynamic Systems, Zaragoza, Spain, 237–242

    Google Scholar 

  39. Viswanadham N, Narahari Y, Johnson T L (1990) Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models, IEEE Transactions on Robotics and Automation, 6: 713–723

    Article  Google Scholar 

  40. Zhang L, Holloway L E (1995) Forbidden state avoidance, Proceedings of 33rd Allerton Conference, Monticello, Illinois, 146–155

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Ingegneria Elettrica ed Elettronica, Università di Cagliari, Italy

    Alessandro Giua & Carla Seatzu

Authors
  1. Alessandro Giua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carla Seatzu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DEIS-CASY, University of Bologna, Viale Risorgimento, 2, 40136, Bologna, Italy

    Claudio Bonivento , Lorenzo Marconi  & Carlo Rossi ,  & 

  2. Dipartimento di Informatica e Sistemistica, Sapienza - Università di Roma, Via Eudossiana 18, 00184, Rome, Italy

    Alberto Isidori

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Giua, A., Seatzu, C. (2007). A Systems Theory View of Petri Nets. In: Bonivento, C., Marconi, L., Rossi, C., Isidori, A. (eds) Advances in Control Theory and Applications. Lecture Notes in Control and Information Sciences, vol 353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70701-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70701-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70700-4

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation