Diagnosability of Petri nets with observation graphs
From MaRDI portal
Publication:312654
DOI10.1007/S10626-014-0207-5zbMath1346.93254OpenAlexW2061679571MaRDI QIDQ312654
Publication date: 16 September 2016
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-014-0207-5
Applications of graph theory (05C90) Discrete event control/observation systems (93C65) Observability (93B07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault detection for discrete event systems using Petri nets with unobservable transitions
- Fault diagnosis in discrete event systems modeled by partially observed Petri nets
- On-line fault detection in discrete event systems by Petri nets and integer linear programming
- On reachability graphs of Petri nets
- On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
- On-Line Fault Diagnosis With Partially Observed Petri Nets
- An Efficient Approach for Online Diagnosis of Discrete Event Systems
- Algebraic approaches for fault identification in discrete-event systems
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Diagnosability of Petri nets with observation graphs