Equivalence of labeled Markov chains

International Journal of Foundations of Computer Science

Volumn 19, Issue 3, 2008, Pages 549-563

  Doyen, Laurent ^a   Henzinger, Thomas A ^b   Raskin, Jean Françios ^c  

^a EPFL   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Bisimulation; Equivalence; Labeled Markov chain; Markov decision process; Probabilistic automaton

Indexed keywords

EID: 44849116532     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054108005814     Document Type: Conference Paper

References (8)

1. Hans Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Uppsala University, 1991.
2. Kim Guldstrand Larsen and Arne Skou. Bisimulation through probabilistic testing. Inf. Comput, 94(l):l-28, 1991.
3. Azaria Paz. Introduction to probabilistic automata. Computer Science and Applied Mathematics. Academic Press, New York, 1971.
4. Michael Oser Rabin. Probabilistic automata. Information and Control, 6(3):230-245, 1963.
5. Marcel Paul Schützenberger. On the definition of a family of automata. Information and Control, 4(2-3) :245-27O, 1961.
6. Wen-Guey Tzeng. A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput, 21(2):216-227, 1992.
7. Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta, and Rafael C. Carrasco. Probabilistic finite-state machines-part I. IEEE Trans. Pattern Anal. Mach. Intell., 27(7):1013-1025, 2005.
8. Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta, and Rafael C. Carrasco. Probabilistic finite-state machines-part II. IEEE Trans. Pattern Anal. Mach. Intell, 27(7): 1026-1039, 2005.