Compositional non-blockingness verification of finite automata with prioritised events
From MaRDI portal
Publication:6544792
Recommendations
- Compositional verification in supervisory control
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Compositional verification of the generalized nonblocking property using abstraction and canonical automata
- A framework for compositional nonblocking verification of extended finite-state machines
- Compositional coordinator synthesis of extended finite automata
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A framework for compositional nonblocking verification of extended finite-state machines
- Automated Technology for Verification and Analysis
- Compositional verification in supervisory control
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Introduction to Discrete Event Systems
- Multitasking supervisory control of discrete-event systems
- Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
- On the computation of counterexamples in compositional nonblocking verification
- Priority and abstraction in process algebra
- Supervisory Control of a Class of Discrete Event Processes
This page was built for publication: Compositional non-blockingness verification of finite automata with prioritised events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544792)
