Compositional Verification in Supervisory Control
From MaRDI portal
Publication:3566992
DOI10.1137/070695526zbMath1282.93176OpenAlexW2016140364MaRDI QIDQ3566992
Publication date: 10 June 2010
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070695526
Controllability (93B05) Hierarchical systems (93A13) Discrete event control/observation systems (93C65) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (14)
Conflict-preserving abstraction of discrete event systems using annotated automata ⋮ Time-optimal control of large-scale systems of systems using compositional optimization ⋮ Supervisory control of discrete event systems with distinguishers ⋮ On conditional decomposability ⋮ A survey on compositional algorithms for verification and synthesis in supervisory control ⋮ On the computation of counterexamples in compositional nonblocking verification ⋮ On a structural property in the state complexity of projected regular languages ⋮ COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA ⋮ Conceptual design of discrete-event systems using templates ⋮ State Complexity of Projected Languages ⋮ Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution ⋮ Progressive events in supervisory control and compositional verification ⋮ Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder ⋮ A framework for compositional nonblocking verification of extended finite-state machines
This page was built for publication: Compositional Verification in Supervisory Control
