On the transformation of maximally permissive marking-based liveness enforcing supervisors into monitor supervisors

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2000, Pages 2657-2662

  He, K X ^a   Lemmon, M D ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IDENTIFICATION (CONTROL SYSTEMS); MONITORING; PETRI NETS; SCADA SYSTEMS;

MAXIMALLY PERMISSIVE MARKING; MONITOR SUPERVISORS;

CONTROL SYSTEM ANALYSIS;

EID: 0034438459     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Free choice Petri nets
2. An improvement of McMillan's unfolding algorithm
3. Generalized mutual exclusion constraints on nets with uncontrollable transitions
4. Blocking and controllability of Petri nets in supervisory control
5. Partial order methods for the verification of concurrent systems
6. Liveness verification of discrete-event systems modeled by n-safe Petri nets
7. On the existence of liveness-enforcing supervisory policies of discrete-event systems modeled by n-safe Petri nets
8. A method for deadlock prevention in discrete event systems using Petri nets
9. Structural approach for the analysis of Petri nets by reduced unfoldings
10. Control of vector discrete-event systems I-the base model
11. Control of vector discrete-event systems II-controller synthesis
12. Feedback control of Petri nets based on place invariants
13. Supervisory control using computationally efficient linear techniques: A tutorial introduction
14. Petri nets: Properties, analysis, and applications
15. On the existence of supervisory control in discrete event dynamic systems modeled by controlled Petri nets