Skip to main content

On Partially Controlled Free Choice Petri Nets

  • Chapter
Discrete Event Systems

Abstract

A Petri Net (PN) is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. Under appropriate conditions, a non-live PN can be made live via supervision. Under this paradigm an external-agent, the supervisor, prevents the firing of certain transitions at each reachable marking so as to enforce liveness. A PN is partially controlled if the supervisor can prevent the firing of only a subset of transitions. A Free-Choice Petri net (FCPN) is a PN where every arc from a place to a transition is either the unique output arc from that place, or, it is the unique input arc to the transition. In this paper we show the existence of a supervisory policy that enforces liveness in a partially controlled FCPN is monotone with respect to the initial marking. That is, if there is a supervisory policy that enforces liveness in a partially controlled FCPN for a particular initial marking, then there is a supervisory policy that enforces liveness for the same FCPN with a larger initial marking. Since this property is not true of the general class of partially controlled PNs, this result has several implications regarding the relationship between the class of partially controlled PNs and partially controlled FCPNs. Some implications of this result along with future research directions are also presented in this paper.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Campos, J., Chiola, G., Silva, M. “Properties and performance bounds for closed Free choice synchronized monoclass queueing networks,” IEEE Trans. on Automatic Control, 36(12): 1368–1381, December 1991.

    Article  MathSciNet  MATH  Google Scholar 

  2. Reisig, W. “Petri Nets,” Springer-Verlag, Berlin, 1985.

    MATH  Google Scholar 

  3. Peterson, J.L. “Petri net theory and the modeling of systems,” Prentice-Hall, Englewood Cliffs, NJ, 1981.

    Google Scholar 

  4. Sreenivas, R.S. “On a free-choice equivalent of a petri net,” In Proceedings of the 36th IEEE Conference on Decision and Control, December 1997, San Diego, CA.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Sreenivas, R.S. “On Supervisory Policies that Enforce Liveness in a Class of Completely Controlled Petri Nets obtained via Refinement,” IEEE Transactions on Automatic Control, 44(1), January 1999.

    Google Scholar 

  7. sreenivas-26 Sreenivas, R.S. “On Commoner’s Liveness Theorem and Supervisory Policies that Enforce Liveness in Free-choice Petri Nets,” Systems & Control Letters, 31:41–48, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  8. Sreenivas, R.S. “An Application of Independent, Increasing, Free-Choice Petri Nets to the Synthesis of Policies that Enforce Liveness in Arbitrary Petri Nets,” Automatica, 34(12):1613–1615, December 1998.

    Article  MATH  Google Scholar 

  9. Sreenivas, R.S. “On Supervisory Policies that Enforce Liveness in Completely Controlled Petri Nets with Directed Cut-Places and Cut-Transitions,” IEEE Transactions on Automatic Control, 44(6):173–177, June 1999.

    Article  MATH  Google Scholar 

  10. Sreenivas, R.S. “On readily available supervisory control policies that enforce liveness in a class of completely controlled Petri nets,” In Proceedings of the 7th IEEE Mediterranean Conference on Control & Automation, June 1999, Haifa, Israel.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Sreenivas, R.S. (2000). On Partially Controlled Free Choice Petri Nets. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4493-7_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7025-3

  • Online ISBN: 978-1-4615-4493-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics