Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
From MaRDI portal
(Redirected from Publication:976261)
Recommendations
- Nonblocking check in fuzzy discrete event systems based on observation equivalence
- Compositional verification in supervisory control
- On nonconflicting languages that arise in supervisory control of discrete event systems
- Conflict-preserving abstraction of discrete event systems using annotated automata
- scientific article; zbMATH DE number 744043
Cites work
- scientific article; zbMATH DE number 1142329 (Why is no real title available?)
- An implementation of an efficient algorithm for bisimulation equivalence
- Compositional synthesis of maximally permissive supervisors using supervision equivalence
- Decentralized supervisory control of discrete-event systems
- Global and local consistencies in distributed fault diagnosis for discrete-event systems
- Hierarchical interface-based supervisory control-part II: parallel case
- Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis
- Modular supervisory control of discrete-event systems
- On the computation of observers in discrete-event systems
- Supervisory Control of a Class of Discrete Event Processes
Cited in
(12)- A framework for compositional nonblocking verification of extended finite-state machines
- Local pursuit strategy-inspired cooperative trajectory planning algorithm for a class of nonlinear constrained dynamical systems
- Consistent reduction in discrete-event systems
- Progressive events in supervisory control and compositional verification
- Maximally permissive coordinated distributed supervisory control of nondeterministic discrete-event systems
- Compositional coordinator synthesis of extended finite automata
- A survey on compositional algorithms for verification and synthesis 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
- On the computation of counterexamples in compositional nonblocking verification
- Compositional non-blockingness verification of finite automata with prioritised events
- Nonblocking check in fuzzy discrete event systems based on observation equivalence
This page was built for publication: Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976261)