Polynomial-time verification of diagnosability of partially observed discrete-event systems

2002406 citationsJournal Article

Authors

Tae-Sic Yoo · University of Michigan–Ann Arbor

Stéphane Lafortune · University of Michigan–Ann Arbor

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.

Topics & Keywords

Petri Nets in System Modeling Mathematical Control Systems and Analysis Flexible and Reconfigurable Manufacturing Systems

Publication Details

Published in: IEEE Transactions on Automatic Control

Volume 47, Issue 9, pp. 1491-1495

DOI: 10.1109/tac.2002.802763

Field-Weighted Citation Impact: 6.68

Command Palette

Polynomial-time verification of diagnosability of partially observed discrete-event systems

Authors

Abstract

Topics & Keywords

Publication Details