Skip to main content

Supervisory Control of Petri Nets with Language Specifications

  • Chapter
Control of Discrete-Event Systems

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

Abstract

In this chapter we discuss how Petri nets can be used in the framework of supervisory control theory. A discrete event system is defined in such a theory as a language generator: this motivates the need to start the chapter with a short but self-contained introduction to Petri net languages. We consider the monolithic supervisory design that requires to construct the concurrent composition of the plant with the specification, to check this structure for controllability and nonblockingness, and eventually to refine it. We show how Petri nets can be used within this approach and show that while the procedure can always be applied to bounded nets, in the case of unbounded Petri nets it may not be possible to obtain a Petri net supervisor.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.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. Gaubert, S., Giua, A.: Petri net languages and infinite subsets of ℕm. Journal of Computer and System Sciences 59, 373–391 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Giua, A., DiCesare, F., Silva, M.: Generalized Mutual Exclusion Constraints for Nets with Uncontrollable Transitions. In: Proc. IEEE Int. Conf. on Systems, Man and Cybernetics, Chicago, USA, pp. 974–799 (1992)

    Google Scholar 

  3. Giua, A., DiCesare, F.: Blocking and controllability of Petri nets in supervisory control. IEEE Transactions on Automatic Control 39(4), 818–823 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Giua, A., DiCesare, F.: Decidability and closure properties of weak Petri net languages in supervisory control. IEEE Transactions on Automatic Control 40(5), 906–910 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Holloway, L.E., Krogh, B.H., Giua, A.: A Survey of Petri Net Methods for Controlled Discrete Event Systems. Discrete Event Dynamic Systems 7, 151–190 (1997)

    Article  MATH  Google Scholar 

  6. Iordache, M.V., Antsaklis, P.J.: Supervision Based on Place Invariants: A Survey. Discrete Event Dynamic Systems 16, 451–492 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jantzen, M.: Language Theory of Petri Nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 397–412. Springer, Heidelberg (1987)

    Google Scholar 

  8. Johnen, C., Frutos Escrig, D.: Decidability of home space property. In: LRI 503. Univ. d’Orsay (1989)

    Google Scholar 

  9. Moody, J.O., Antsaklis, P.J.: Supervisory Control of Discrete Event Systems Using Petri Nets. Kluwer (1998)

    Google Scholar 

  10. Parigot, M., Pelz, E.: A Logical Formalism for the Study of Finite Behaviour of Petri Nets. In: Rozenberg, G. (ed.) APN 1985. LNCS, vol. 222, pp. 346–361. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  11. Pelz, E.: Closure Properties of Deterministic Petri Net Languages. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 373–382. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  12. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs (1981)

    Google Scholar 

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

    Article  Google Scholar 

  14. Reutenauer, C.: The Mathematics of Petri Nets. Masson and Prentice-Hall (1990)

    Google Scholar 

  15. Sreenivas, R.S.: On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets. IEEE Transactions on Automatic Control 42(7), 928–945 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sreenivas, R.S.: On minimal representations of Petri net languages. IEEE Transactions on Automatic Control 51(5), 799–804 (2006)

    Article  MathSciNet  Google Scholar 

  17. Sreenivas, R.S.: On the Existence of Supervisory Policies That Enforce Liveness in Partially Controlled Free-Choice Petri Nets. IEEE Transactions on Automatic Control 57(2), 435–449 (2012)

    Article  MathSciNet  Google Scholar 

  18. Vidal-Naquet, G.: Deterministic Petri net languages. In: Girault, C., Reisig, W. (eds.) Application and Theory of Petri Net. Informatick-Fachberichte, vol. 52. Springer, New York (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alessandro Giua .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Giua, A. (2013). Supervisory Control of Petri Nets with Language Specifications. In: Seatzu, C., Silva, M., van Schuppen, J. (eds) Control of Discrete-Event Systems. Lecture Notes in Control and Information Sciences, vol 433. Springer, London. https://doi.org/10.1007/978-1-4471-4276-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4276-8_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4275-1

  • Online ISBN: 978-1-4471-4276-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics