Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
From MaRDI portal
Publication:976261
DOI10.1016/J.AUTOMATICA.2010.02.025zbMATH Open1192.93078OpenAlexW2081177528MaRDI QIDQ976261FDOQ976261
Jan H. van Schuppen, Albert T. Hofkamp, Jacobus E. Rooda, Rong Su
Publication date: 17 June 2010
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2010.02.025
Cellular automata (computational aspects) (68Q80) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)
Cites Work
- Supervisory Control of a Class of Discrete Event Processes
- Title not available (Why is that?)
- Global and local consistencies in distributed fault diagnosis for discrete-event systems
- Modular supervisory control of discrete-event systems
- Decentralized supervisory control of discrete-event systems
- Compositional synthesis of maximally permissive supervisors using supervision equivalence
- Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis
- Hierarchical interface-based supervisory control-part II: parallel case
- An implementation of an efficient algorithm for bisimulation equivalence
- On the computation of observers in discrete-event systems
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 VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA
- 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
- 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
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 👍 👎
- Title not available (Why is that?) 👍 👎
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)
