Pages that link to "Item:Q998679"
From MaRDI portal
The following pages link to An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions (Q998679):
Displaying 15 items.
- Minimal sensor activation and minimal communication in discrete-event systems (Q503031) (← links)
- Generalized detectability for discrete event systems (Q539906) (← links)
- On the minimization of communication in networked systems with a central station (Q732255) (← links)
- Codiagnosability and coobservability under dynamic observations: transformation and verification (Q900685) (← links)
- Design of decentralized critical observers for networks of finite state machines: a formal method approach (Q1678627) (← links)
- Trajectory detectability of discrete-event systems (Q1729041) (← links)
- Detectability verification of probabilistic Boolean networks (Q2056383) (← links)
- Discrete-event systems subject to unknown sensor attacks (Q2128094) (← links)
- Deterministic supervisory control with flexible upper-bounds on observation delay and control delay (Q2165979) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- A general approach for optimizing dynamic sensor activation for discrete event systems (Q2280709) (← links)
- Observability and diagnosability of finite state systems: a unifying framework (Q2409221) (← links)
- Online minimization of sensor activation for supervisory control (Q2409274) (← links)
- Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution (Q5962026) (← links)
- Supervisory control under delayed observations of events and states (Q6652242) (← links)