Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions
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.
KeywordsPolynomial Complexity Discrete Event System Reachability Graph Resource Allocation System Reachability Space
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 11.Zhou, M., Fanti, M.P. (eds.): Deadlock Resolution in Computer-Integrated Systems. Marcel Dekker, Inc., Singapore (2004)Google Scholar