A framework for compositional nonblocking verification of extended finite-state machines

DOI10.1007/S10626-015-0217-YzbMath1333.93169OpenAlexW1930392193MaRDI QIDQ262429

Robi Malik, Sahar Mohajerani, Martin Fabian

Publication date: 29 March 2016

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10289/10146

zbMATH Keywords

model checkingcompositional verificationextended finite-state machinesnonblockingsupervisory control theory

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)

Related Items (4)

Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction ⋮ Supervisor synthesis and throughput optimization of partially-controllable manufacturing systems ⋮ Compositional coordinator synthesis of extended finite automata ⋮ Optimal modular control of discrete event systems with distinguishers and approximations

Uses Software

• FORCE
• Supremica

Cites Work

• Modeling and control of discrete event systems using finite state machines with variables and their applications in power grids
• Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
• Compositional Verification in Supervisory Control
• Logic in Computer Science
• Verification of Nonconflict of Supervisors Using Abstractions
• Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions
• CONFLICTS AND FAIR TESTING
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A framework for compositional nonblocking verification of extended finite-state machines