Skip to main content

Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions

  • Conference paper
Petri Nets and Other Models of Concurrency - ICATPN 2006 (ICATPN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4024))

Included in the following conference series:

Abstract

This paper proposes an analytical method for the synthesis of reversibility-enforcing supervisors for bounded Petri nets. The proposed me-thod builds upon recent developments from (i) the theory of regions, that enables the design of Petri nets with pre-specified behavioral requirements, and (ii) the theory concerning the imposition of generalized mutual exclusion constraints on the net behavior through monitor places. The derived methodology takes the form of a Mixed Integer Programming formulation, which is readily solvable through canned optimization software. The last part of the paper discusses extensions of the presented method so that it accommodates uncontrollable behavior and any potential complications arising from the large-scale nature of the underlying plant nets and their behavioral spaces. Finally, the relevance and the efficacy of the proposed approach is demonstrated through its application in the synthesis of liveness-enforcing supervisors for process-resource nets.

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 39.99
Price excludes VAT (USA)
  • Available as 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

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. Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)

    Google Scholar 

  2. Ghaffari, A., Rezg, N., Xie, X.: Design of a live and maximally permissive petri net controller using the theory of regions. IEEE Trans. on Robotics & Automation 19, 137–141 (2003)

    Article  Google Scholar 

  3. Giua, A., DiCesare, F., Silva, M.: Generalized mutual exclusion constraints on nets with uncontrollable transitions. In: Proceedings of the 1992 IEEE Intl. Conference on Systems, Man and Cybernetics, pp. 974–979. IEEE, Los Alamitos (1992)

    Chapter  Google Scholar 

  4. Moody, J.O., Antsaklis, P.J.: Supervisory Control of Discrete Event Systems using Petri nets. Kluwer Academic Pub., Boston (1998)

    MATH  Google Scholar 

  5. Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77, 541–580 (1989)

    Article  Google Scholar 

  6. Park, J., Reveliotis, S.: Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems. IEEE Trans. on R&A 16, 190–195 (2000)

    Google Scholar 

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

    Article  Google Scholar 

  8. Reveliotis, S.A.: Real-time Management of Resource Allocation Systems: A Discrete Event Systems Approach. Springer, NY (2005)

    MATH  Google Scholar 

  9. Uzam, M.: An optimal deadlock prevention policy for flexible manufacturing systems using petri net models with resources and the theory of regions. Intl. Jrnl of Advanced Manufacturing Technology 19, 192–208 (2002)

    Google Scholar 

  10. Winston, W.L.: Introduction To Mathematical Programming: Applications and Algorithms, 2nd edn. Duxbury Press, Belmont (1995)

    MATH  Google Scholar 

  11. Zhou, M., Fanti, M.P. (eds.): Deadlock Resolution in Computer-Integrated Systems. Marcel Dekker, Inc., Singapore (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reveliotis, S.A., Choi, J.Y. (2006). Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions. In: Donatelli, S., Thiagarajan, P.S. (eds) Petri Nets and Other Models of Concurrency - ICATPN 2006. ICATPN 2006. Lecture Notes in Computer Science, vol 4024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767589_18

Download citation

  • DOI: https://doi.org/10.1007/11767589_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34699-9

  • Online ISBN: 978-3-540-34700-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics