Observability of Finite Labeled Transition Systems

Abstract

Finite labeled transition systems are nondeterministic and nontotal systems with finitely many inputs, states, and outputs. This paper provides algorithms for verifying the observability of finite labeled transition systems in the so-called multiple-experiment case, the simple-experiment case, and the arbitrary-experiment case, respectively, where these algorithms run in exponential time, exponential time, and quartic polynomial time, respectively, and are more effective than the existing algorithms in the literature.