Polynomial-time verification of diagnosability of partially observed discrete-event systems
Top Cited Papers
- 7 November 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 47 (9), 1491-1495
- https://doi.org/10.1109/tac.2002.802763
Abstract
The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier.Keywords
This publication has 6 references indexed in Scilit:
- A General Architecture for Decentralized Supervisory Control of Discrete-Event SystemsDiscrete Event Dynamic Systems, 2002
- A polynomial algorithm for testing diagnosability of discrete-event systemsIEEE Transactions on Automatic Control, 2001
- Introduction to Discrete Event SystemsThe Kluwer International Series on Discrete Event Dynamic Systems, 1999
- Diagnosability of discrete-event systemsIEEE Transactions on Automatic Control, 1995
- The computational complexity of decentralized discrete-event control problemsIEEE Transactions on Automatic Control, 1995
- On the control of discrete-event dynamical systemsMathematics of Control, Signals, and Systems, 1989