Abstractions of Finite-State Machines Optimal with Respect to Single Undetectable Output Faults

DOI10.1109/TC.1987.1676881zbMATH Open0637.68058OpenAlexW2050233102MaRDI QIDQ3777458FDOQ3777458

Kostas N. Oikonomou

Publication date: 1987

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1987.1676881

zbMATH Keywords

branch-and-bound algorithmobserverfault-detectionfinite-state machineprobabilistic machineoptimal abstractionundetectable output faults

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of software (68N99)

Cited In (3)

• Fault Tolerance in Finite State Machines Using Fusion
• Abstractions of random finite-state machines
• On termination and invariance for faulty channel machines

   Recommendations

• Abstractions of random finite-state machines 👍 👎
• Canonical finite state machines for distributed systems 👍 👎
• Testing finite state machines: Fault detection 👍 👎
• Efficient minimization of homogeneous FSMs for fault diagnosis 👍 👎
• On Communicating Finite-State Machines 👍 👎

This page was built for publication: Abstractions of Finite-State Machines Optimal with Respect to Single Undetectable Output Faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777458)