Pages that link to "Item:Q1797011"
From MaRDI portal
The following pages link to Complexity of deciding detectability in discrete event systems (Q1797011):
Displaying 12 items.
- Trajectory detectability of discrete-event systems (Q1729041) (← links)
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems (Q1737732) (← links)
- Deciding detectability for labeled Petri nets (Q1737932) (← links)
- Verification of C-detectability using Petri nets (Q2023240) (← links)
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets (Q2060875) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- Matrix approach to detectability of discrete event systems (Q2316509) (← links)
- An improved approach for verifying delayed detectability of discrete-event systems (Q2663854) (← links)
- (Q4989409) (← links)
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems (Q5158671) (← links)
