On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary petri net | Discrete Event Dynamic Systems Skip to main content
Log in

On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary petri net

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

A set of non-negative integral vectors is said to be right-closed if the presence of a vector in the set implies all term-wise larger vectors also belong to the set. A set of markings is control invariant with respect to a Petri Net (PN) structure if the firing of any uncontrollable transition at any marking in this set results in a new marking that is also in the set. Every right-closed set of markings has a unique supremal control invariant subset, which is the largest subset that is control invariant with respect to the PN structure. This subset is not necessarily right-closed. In this paper, we present an algorithm that computes the supremal right-closed control invariant subset of a right-closed of markings with respect to an arbitrary PN structure. This set plays a critical role in the synthesis of Liveness Enforcing Supervisory Policies (LESPs) for a class of PN structures, and consequently, the proposed algorithm plays a key role in the synthesis of LESPs for this class of PN structures.

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

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Alpern B, Schneider FB (1985) Defining Liveness. Inf Process Lett 21(4):181–185

  • Basile F, Recalde L, Chiacchio P, Silva M (2009) Closed-Loop Live Marked Graphs Under Generalized Mutual Exclusion Constraint Enforcement. Discret Event Dyn Syst 19(1):1–30

  • Chandrasekaran S, Somnath N, Sreenivas RS (2015) A Software Tool for the Automatic Synthesis of Minimally Restrictive Liveness Enforcing Supervisory Policies for a Class of General Petri Net models of Manufacturing- and Service-Systems. J Intell Manuf 26(5):945–958

  • Chen Y, Li ZW, Khalgui M, Mosbahi O (2011) Design of a Maximally Permissive Liveness-Enforcing Petri Net Supervisor for Flexible Manufacturing Systems. IEEE Trans Autom Sci Eng 8(2):374–393

  • Chen C, Raman A, Hu H, Sreenivas RS (2020) On Liveness Enforcing Supervisory Policies for Arbitrary Petri Nets. IEEE Transactions on Automatic Control, to appear 2020

  • Dideban A, Alla H (2008) Reduction of Constraints for Controller Synthesis Based on Safe Petri Nets. Automatica 44(7):1697–1706

  • Dideban A, Zeraatkar H (2018) Petri Net Controller Synthesis Based on Decomposed Manufacturing Models. ISA Trans 77:90–99

  • Iordache M, Ansaklis PJ (2006) Supervisory Control of Concurrent Systems: A Petri Net Structural Approach. Birkhaüser, Boston

  • Khaleghi R, Raman A, Sreenivas RS (2019) Designing Supervisory Policies that Avoid Livelocks in Manufacturing- and Service-Systems Modeled using General Petri Nets: A Tutorial using an Illustrative Example. In: Proceedings of the 9th International Conference on Industrial Engineering and Operations Management (IEOM), pp 895–902

  • Kumar R, Garg VK (2005) On Computation of State Avoidance Control for Infinite State Systems in Assignment Program Framework. IEEE Trans Autom Sci Eng 2(1):87–91

  • Luo J, Nonami K (2011) Approach for Transforming Linear Constraints on Petri Nets. IEEE Trans Autom Control 56(12):2751–2765

  • Moody JO, Antsaklis PJ (1998) Supervisory Control of Discrete Event Systems Using Petri Nets. Kluwer, Norwell

  • Murata T (1989) Petri Nets: Properties, Analysis and Applications. Proc IEEE 77(4):541–580

  • Peterson JL (1981) Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ

  • Ramadge PJ, Wonham WM (1987) Modular Feedback Logic for Discrete Event Systems. SIAM J Control Optim 25(5):1202–1218

  • Salimi E, Somnath N, Sreenivas RS (2015) A Software Tool for Live-Lock Avoidance in Systems Modeled Using a Class of Petri Nets. Int J Comput Sci Appl 5(2):1–13

  • Sreenivas RS (1997) On the Existence of Supervisory Policies that Enforce Liveness in Discrete-Event Dynamic Systems Modeled by Controlled Petri Nets. IEEE Trans Autom Control 42(7):928–945

  • Sreenivas RS (2012) On the Existence of Supervisory Policies that Enforce Liveness in Partially Controlled Free-Choice Petri Nets. IEEE Trans Autom Control 57(2):435–449

  • Valk R, Jantzen M (1985) The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Inform 21(6):643–674

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roshanak Khaleghi.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

figure c
figure d
figure e

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khaleghi, R., Sreenivas, R.S. On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary petri net. Discrete Event Dyn Syst 31, 373–405 (2021). https://doi.org/10.1007/s10626-021-00340-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-021-00340-6

Keywords

Navigation