Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
From MaRDI portal
Publication:1686857
DOI10.1007/s10626-017-0260-yzbMath1386.93194OpenAlexW2742187848MaRDI QIDQ1686857
Leonardo Bermeo Clavijo, João Carlos Basilio
Publication date: 18 December 2017
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-017-0260-y
Related Items (3)
Disjunctive fault prediction of decentralized discrete event systems: verification, predictor design and K-copredictability ⋮ Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications ⋮ Diagnosability verification using LTL model checking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a structural property in the state complexity of projected regular languages
- Enumeration and random generation of accessible automata
- Enumeration and generation with a string automata representation
- “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” Versus “Decentralized Failure Diagnosis of Discrete Event Systems”: A Critical Appraisal
- Probability and Random Processes for Electrical and Computer Engineers
- A polynomial algorithm for testing diagnosability of discrete-event systems
- Diagnosability of discrete-event systems
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
This page was built for publication: Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
