An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions
DOI10.1016/J.SYSCONLE.2007.03.006zbMATH Open1155.93387OpenAlexW2170197341MaRDI QIDQ998679FDOQ998679
Feng Lin, Weilin Wang, Stéphane Lafortune
Publication date: 9 February 2009
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2007.03.006
Recommendations
- Indistinguishability of finite-state automata with respect to some environments
- Comments on "Observability of discrete event dynamic systems" by C. M. Ozveren and A.S. Willsky
- Minimization of finite state automata through partition aggregation
- Classical and Logic-Based Dynamic Observers for Finite Automata
- Indistinguishability of finite automata by multiple experiments in a stationary observation medium
Hierarchical systems (93A13) Observability (93B07) Discrete event control/observation systems (93C65) Automated systems (robots, etc.) in control theory (93C85)
Cites Work
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the control of discrete-event dynamical systems
- Minimal communication in a distributed discrete-event system
- On observability of discrete-event systems
- Detectability of Discrete Event Systems
- The infimal closed controllable superlanguage and its application in supervisory control
Cited In (15)
- Trajectory detectability of discrete-event systems
- A general approach for optimizing dynamic sensor activation for discrete event systems
- On detectability of labeled Petri nets and finite automata
- Discrete-event systems subject to unknown sensor attacks
- Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution
- Online minimization of sensor activation for supervisory control
- Observability and diagnosability of finite state systems: a unifying framework
- Deterministic supervisory control with flexible upper-bounds on observation delay and control delay
- Detectability verification of probabilistic Boolean networks
- Design of decentralized critical observers for networks of finite state machines: a formal method approach
- Supervisory control under delayed observations of events and states
- Minimal sensor activation and minimal communication in discrete-event systems
- Generalized detectability for discrete event systems
- On the minimization of communication in networked systems with a central station
- Codiagnosability and coobservability under dynamic observations: transformation and verification
Uses Software
This page was built for publication: An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998679)
