Compositional Verification in Supervisory Control

DOI10.1137/070695526zbMath1282.93176MaRDI QIDQ3566992

Robi Malik, Hugo Flordal

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

zbMATH Keywords

supervisory control; discrete-event systems; model checking; nonblocking

Mathematics Subject Classification ID

93B05: Controllability

93A13: Hierarchical systems

93C65: Discrete event control/observation systems

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA, State Complexity of Projected Languages, Progressive events in supervisory control and compositional verification, Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution, A survey on compositional algorithms for verification and synthesis in supervisory control, A framework for compositional nonblocking verification of extended finite-state machines, Conflict-preserving abstraction of discrete event systems using annotated automata, On a structural property in the state complexity of projected regular languages, Conceptual design of discrete-event systems using templates, Supervisory control of discrete event systems with distinguishers, On conditional decomposability, Time-optimal control of large-scale systems of systems using compositional optimization, On the computation of counterexamples in compositional nonblocking verification, Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder