Subscribe

Issue No.03 - March (1992 vol.41)

pp: 325-338

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.127444

ABSTRACT

<p>A general way to make a smaller model of a large system, or to represent the fact that the observations possible on it are limited, is to apply an abstraction A to it. If the system is modeled by a finite-state machine M, the abstraction consists of three partitions, one for each of the state, input, and output sets. States, inputs, or outputs lumped together in one block by the partition are indistinguishable from each other, resulting in a nondeterministic machine M/sub A/. An observer of M/sub A/, whose task is to detect erroneous behavior in M, is prevented by the abstraction from seeing some of the faults. The authors investigate the choice of an abstraction that is optimal with respect to immediately detectable faults in the output map. It is shown that this requires solving an NP-complete 'set-partitioning' problem. A polynomial-time algorithm for finding an approximately optimal partition of either the states or the inputs of M, together with a way to check the goodness of the approximation is given. This algorithm also solves the undetectable fault minimization problem exactly, and in polynomial time.</p>

INDEX TERMS

set partitioning; finite-state machines; immediately-detectable output faults; abstraction; nondeterministic machine; NP-complete; polynomial-time algorithm; approximately optimal partition; computational complexity; data structures; fault tolerant computing; finite automata.

CITATION

K.N. Oikonomou, "Abstractions of Finite-State Machines and Immediately-Detectable Output Faults",

*IEEE Transactions on Computers*, vol.41, no. 3, pp. 325-338, March 1992, doi:10.1109/12.127444