
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
Abstractions of FiniteState Machines Optimal with Respect to Single Undetectable Output Faults
February 1987 (vol. 36 no. 2)
pp. 185200
ASCII Text  x  
K.N. Oikonomou, "Abstractions of FiniteState Machines Optimal with Respect to Single Undetectable Output Faults," IEEE Transactions on Computers, vol. 36, no. 2, pp. 185200, February, 1987.  
BibTex  x  
@article{ 10.1109/TC.1987.1676881, author = {K.N. Oikonomou}, title = {Abstractions of FiniteState Machines Optimal with Respect to Single Undetectable Output Faults}, journal ={IEEE Transactions on Computers}, volume = {36}, number = {2}, issn = {00189340}, year = {1987}, pages = {185200}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676881}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Abstractions of FiniteState Machines Optimal with Respect to Single Undetectable Output Faults IS  2 SN  00189340 SP185 EP200 EPD  185200 A1  K.N. Oikonomou, PY  1987 KW  undetectable output faults KW  Abstraction KW  branchandbound algorithm KW  finitestate machine KW  observer KW  optimal abstraction VL  36 JA  IEEE Transactions on Computers ER   
An observer, whose task is to monitor a large and complex system M^ subject to malfunctions, may be interested in dealing with a simplified, abstracted model (M^A of it, at the expense of some loss in faultdetection ability. Let M^ be a finite state machine whose inputs are modeled by stationary random variables. The abstraction A is effected by lumping M^'s states, inputs, and outputs into classes, to obtain a smaller probabilistic machine M^A. These ideas have been introduced in a previous paper, and the question of finding an optimal abstraction A* which minimizes the number of faults undetectable by the observer was posed. An algorithm for constructing the output component of the optimal abstraction A* is given in this paper. If there are no faults in the nextstate map of M^, this construction is sufficient to minimize the number of single faults in the output map that are undetectable by the observer because of the abstraction. Some experiments carried out using the algorithm provide general insight into the tradeoff between simplifying M^ and making some faults in it undetectable. As a specific example, optimal output abstractions are found for a finitestate machine specification of the link level of the X.25 communication protocol.
Index Terms:
undetectable output faults, Abstraction, branchandbound algorithm, finitestate machine, observer, optimal abstraction
Citation:
K.N. Oikonomou, "Abstractions of FiniteState Machines Optimal with Respect to Single Undetectable Output Faults," IEEE Transactions on Computers, vol. 36, no. 2, pp. 185200, Feb. 1987, doi:10.1109/TC.1987.1676881
Usage of this product signifies your acceptance of the Terms of Use.