Compositional verification in supervisory control
From MaRDI portal
Publication:3566992
DOI10.1137/070695526zbMATH Open1282.93176OpenAlexW2016140364MaRDI QIDQ3566992FDOQ3566992
Authors: Hugo Flordal, Robi Malik 
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
Recommendations
- 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
- Progressive events in supervisory control and compositional verification
- scientific article; zbMATH DE number 1836359
Controllability (93B05) Specification and verification (program logics, model checking, etc.) (68Q60) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)
Cited In (19)
- On-the-fly informed search of non-blocking directed controllers
- A framework for compositional nonblocking verification of extended finite-state machines
- Conceptual design of discrete-event systems using templates
- Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
- Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder
- Progressive events in supervisory control and compositional 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
- Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution
- Supervisory control of discrete event systems with distinguishers
- A survey on compositional algorithms for verification and synthesis in supervisory control
- Incremental verification for on-the-fly controller synthesis
- State complexity of projected languages
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Time-optimal control of large-scale systems of systems using compositional optimization
- On conditional decomposability
- On the computation of counterexamples in compositional nonblocking verification
- Compositional non-blockingness verification of finite automata with prioritised events
- Verification of Supervisory Control Software Using State Proximity and Merging
This page was built for publication: Compositional verification in supervisory control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566992)
