Verification of Nonconflict of Supervisors Using Abstractions

DOI10.1109/TAC.2009.2031730zbMath1368.68237OpenAlexW2130122181MaRDI QIDQ4974830

Stéphane Lafortune, José E. R. Cury, Patrícia N. Pena

Publication date: 8 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2009.2031730

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)

Related Items

Conflict-preserving abstraction of discrete event systems using annotated automata ⋮ Supervisory control of discrete event systems with distinguishers ⋮ On conditional decomposability ⋮ Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication ⋮ A survey on compositional algorithms for verification and synthesis in supervisory control ⋮ On the computation of counterexamples in compositional nonblocking verification ⋮ Optimal non‐blocking decentralized supervisory control with unobservable controllable events ⋮ Distributed computation of supremal conditionally controllable sublanguages ⋮ Progressive events in supervisory control and compositional verification ⋮ Coordination control of discrete-event systems revisited ⋮ A framework for compositional nonblocking verification of extended finite-state machines