Advertisement

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

  • Spyros A. Reveliotis
  • Jin Young Choi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4024)

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.

Keywords

Polynomial Complexity Discrete Event System Reachability Graph Resource Allocation System Reachability Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 4.
    Moody, J.O., Antsaklis, P.J.: Supervisory Control of Discrete Event Systems using Petri nets. Kluwer Academic Pub., Boston (1998)MATHGoogle Scholar
  5. 5.
    Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77, 541–580 (1989)CrossRefGoogle Scholar
  6. 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. 7.
    Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Proceedings of the IEEE 77, 81–98 (1989)CrossRefGoogle Scholar
  8. 8.
    Reveliotis, S.A.: Real-time Management of Resource Allocation Systems: A Discrete Event Systems Approach. Springer, NY (2005)MATHGoogle Scholar
  9. 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. 10.
    Winston, W.L.: Introduction To Mathematical Programming: Applications and Algorithms, 2nd edn. Duxbury Press, Belmont (1995)MATHGoogle Scholar
  11. 11.
    Zhou, M., Fanti, M.P. (eds.): Deadlock Resolution in Computer-Integrated Systems. Marcel Dekker, Inc., Singapore (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Spyros A. Reveliotis
    • 1
  • Jin Young Choi
    • 2
  1. 1.School of Industrial & Systems EngineeringGeorgia Institute of Technology 
  2. 2.Digital Communications Infra DivisionSamsung Networks Inc. 

Personalised recommendations