Maximum likelihood failure diagnosis in finite state machines under unreliable observations

IEEE Transactions on Automatic Control

Volumn 55, Issue 3, 2010, Pages 579-593

  Athanasopoulou, Eleftheria ^a   Li, Lingxi ^b   Hadjicostis, Christoforos N ^a,c  

^a University of Illinois at Urbana Champaign   (United States)

^b Indiana University Purdue University Indianapolis   (United States)

^c UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Deletions; Discrete event systems (DESs); Failure diagnosis; Finite state machines (FSMs); Insertions; Maximum likelihood model classification; Probabilistic automata; Transpositions

Indexed keywords

DISCRETE EVENT SYSTEMS; FAILURE DIAGNOSIS; FINITE STATE MACHINES; MODEL CLASSIFICATION; PROBABILISTIC AUTOMATA;

ALGORITHMS; COMMUNICATION; CONTOUR FOLLOWERS; FAILURE ANALYSIS; FINITE AUTOMATA; HIDDEN MARKOV MODELS; LOGIC CIRCUITS; PROBABILITY; TRANSLATION (LANGUAGES);

MAXIMUM LIKELIHOOD;

EID: 77949423810     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2009.2039548     Document Type: Article

References (41)

1. C. G. Cassandras and S. Lafortune, Introduction to Discrete-Event Systems. Norwell, MA: Kluwer, 1999.
2. F. Lin, "Diagnosability of discrete event systems and its applications," Discrete Event Dyn. Syst.: Theory Appl., vol.4, no.2, pp. 197-212, May 1994.
3. M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. Teneketzis, "Diagnosability of discrete-event systems," IEEE Trans. Autom. Control, vol.40, no.9, pp. 1555-1575, Sep. 1995.
4. M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. Teneketzis, "Failure diagnosis using discrete-event models," IEEE Trans. Control Syst. Technol., vol.4, no.2, pp. 105-124, Feb. 1996.
5. A. Benveniste, E. Fabre, S. Haar, and C. Jard, "Diagnosis of asynchronous discrete-event systems: A net unfolding approach," IEEE Trans. Autom. Control, vol.48, no.5, pp. 714-727, May 2003.
6. S. H. Zad, R. H. Kwong, and W. M. Wonham, "Fault diagnosis in discrete- event systems: Framework and model reduction," IEEE Trans. Autom. Control, vol.48, no.7, pp. 1199-1212, Jul. 2003.
7. Y. Wu and C. N. Hadjicostis, "Algebraic approaches for fault identification in discrete-event systems," IEEE Trans. Autom. Control, vol.50, no.12, pp. 2048-2055, Dec. 2005.
8. A. Benveniste, E. Fabre, and S. Haar, "Markov nets: Probabilistic models for distributed and concurrent systems," IEEE Trans. Autom. Control, vol.48, no.11, pp. 1936-1950, Nov. 2003.
9. C. N. Hadjicostis, "Probabilistic detection of FSM single state-transition faults based on state occupancy measurements," IEEE Trans. Autom. Control, vol.50, no.12, pp. 2078-2083, Dec. 2005.
10. M. Blanke, M. Kinnaert, J. Lunze, and M. Staroswiecki, Diagnosis and Fault-Tolerant Control. New York: Springer-Verlag, 2003.
11. D. Thorsley and D. Teneketzis, "Diagnosability of stochastic discrete- event systems," IEEE Trans. Autom. Control, vol.50, no.4, pp. 476-492, Apr. 2005.
12. A. T. Bouloutas, G. W. Hart, and M. Schwartz, "Simple finite-state fault detectors for communication networks," IEEE Trans. Commun., vol.40, no.3, pp. 477-479, Mar. 1992.
13. A. T. Bouloutas, G. W. Hart, and M. Schwartz, "Fault identification using a finite state machine model with unreliable partially observed data sequences," IEEE Trans. Commun., vol.41, no.7, pp. 1074-1083, Jul. 1993.
14. S. H. Low, "Probabilistic conformance testing of protocols with unobservable transitions," in Proc. IEEE Int. Conf. Network Protocols, Oct. 1993, pp. 368-375.
15. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol.77, no.2, pp. 257-286, Feb. 1989.
16. K. S. Fu, Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
17. E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta, and R. C. Carrasco, "Probabilistic finite-state machines-part I," IEEE Trans. Pattern Anal. Mach. Intell., vol.27, no.7, pp. 1013-1025, Jul. 2005.
18. R. Bauer and J. Hagenauer, "Symbol-by-symbol MAP decoding of variable length codes," in Proc. 3rd ITG Conf. Source Channel Coding, Jan. 2000, pp. 111-116.
19. A. Guyader, E. Fabre, C. Guillemot, and M. Robert, "Joint sourcechannel turbo decoding of entropy-coded sources," IEEE J. Sel. Areas Comm., vol.19, no.9, pp. 1680-1696, Sep. 2001.
20. F. Jelinek, Statistical Methods for Speech Recognition. Cambridge, MA: The MIT Press, 1997.
21. R. Durbin, S. R. Eddy, A. Krogh, and G. Mitchison, Biological Sequence Analysis: Probablistic Models of Proteins and Nucleic Acids. Cambridge, U.K.: Cambridge Univ. Press, 1998.
22. T. Koski, Hidden Markov Models of Bioinformatics. Norwell, MA: Kluwer Academic Publishers, 2001.
23. A. M. Poritz, "Hidden Markov models: A guided tour," in Proc. IEEE Conf. Acoust., Speech, Signal Processing, Apr. 1988, vol.1, pp. 7-13.
24. Y. Ephraim and N. Merhav, "Hidden Markov processes," IEEE Trans. Inform. Theory, vol.48, no.6, pp. 1518-1569, Jun. 2002.
25. P. Bremaud, Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. New York: Springer-Verlag, 1999.
26. T. Yoo and H. E. Garcia, "New results on discrete-event counting under reliable and unreliable observation information," in Proc. IEEE Conf. Networking, Sensing, Control, Mar. 2005, pp. 688-693.
27. M. C. Davey and D. J. C. Mackay, "Reliable communication over channels with insertions, deletions, and substitutions," IEEE Trans. Inform. Theory, vol.47, no.2, pp. 687-698, Feb. 2001.
28. E. Athanasopoulou and C. N. Hadjicostis, "Maximum likelihood diagnosis in partially observable finite-state machines," in Proc. IEEE Intl. Symp. Intell. Control, 2005, pp. 896-901.
29. A. Graham, Kronecker Products and Matrix Calculus With Applications. Mathematics and Its Applications. Chichester, U.K.: Ellis Horwood, Ltd., 1981.
30. J. G. Kemeny, J. L. Snell, and A. W. Knapp, Denumerable Markov Chains, 2nd ed. New York: Springer-Verlag, 1976.
31. E. Athanasopoulou, "Diagnosis of Finite State Models Under Partial or Unreliable Observations," Ph.D. dissertation, Univ. Illinois at Urbana- Champaign, Urbana, 2007.
32. L. R. Bahl and F. Jelinek, "Decoding for channels with insertions, deletions and substitutions with applications to speech recognition," IEEE Trans. Inform. Theory, vol.IT-21, no.4, pp. 404-411, Jul. 1975.
33. L. R. Bahl, F. Jelinek, and R. L. Mercer, "A maximum likelihood approach to continuous speech recognition," IEEE Trans. Pattern Anal. Machine Intell., vol.PAMI-5, no.2, pp. 179-190, Mar. 1983.
34. P. Dupont, F. Denis, and Y. Esposito, "Links between probabilistic automata and hidden Markov models: Probability distributions, learning models and induction algorithms," Pattern Recognition, vol.38, no.9, pp. 1349-1371, Sep. 2005.
35. A. D. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol.IT-13, no.2, pp. 260-269, Apr. 1967.
36. G. D. Forney, Jr., "The Viterbi algorithm," Proc. IEEE, vol.61, no.3, pp. 268-278, Mar. 1973.
37. A. Bouloutas, G. W. Hart, and M. Schwartz, "Two extensions of the Viterbi algorithm," IEEE Trans. Inform. Theory, vol.37, no.2, pp. 430-436, Mar. 1991.
38. G. W. Hart and A. T. Bouloutas, "Correcting dependent errors in sequences generated by finite-state processes," IEEE Trans. Inform. Theory, vol.39, no.4, pp. 1249-1260, Jul. 1993.
39. J. C. Amengual and E. Vidal, "Efficient error-correcting Viterbi parsing," IEEE Trans. Pattern Anal. Mach. Intell., vol.20, no.10, pp. 1109-1116, Oct. 1998.
40. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing label error rate," IEEE Trans. Inform. Theory, vol.IT-20, no.2, pp. 284-287, Mar. 1974.
41. Logical Link Control, ANSI/IEEE Std. 802.2-1985, American National Standards Institute, The Institute of Electrical and Electronics Engineers.