Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions

DOI10.1109/TAC.2013.2248255zbMath1369.93379OpenAlexW2159206957MaRDI QIDQ5353290

Robi Malik, Ryan J. Leduc

Publication date: 8 September 2017

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

A survey on compositional algorithms for verification and synthesis in supervisory control, On the computation of counterexamples in compositional nonblocking verification, COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA, 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