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

DOI10.1109/TC.1987.1676881zbMath0637.68058OpenAlexW2050233102MaRDI QIDQ3777458

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

observerbranch-and-bound algorithmfault-detectionfinite-state machineprobabilistic machineoptimal abstractionundetectable output faults

Mathematics Subject Classification ID

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

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