Language equivalence for probabilistic automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6806 LNCS, Issue , 2011, Pages 526-540

  Kiefer, Stefan ^a   Murawski, Andrzej S ^b   Ouaknine, Joël ^a   Wachter, Björn ^a   Worrell, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL BOUNDS; DETERMINISTIC ALGORITHMS; ERROR PROBABILITIES; EXTENSIVE BENCHMARKING; POLYNOMIAL IDENTITY TESTING; PROBABILISTIC AUTOMATA; RANDOMISED ALGORITHMS; RUNNING TIME; TEST CASE;

COMPUTER AIDED ANALYSIS; EQUIVALENCE CLASSES;

ALGORITHMS;

EID: 79960344068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22110-1_42     Document Type: Conference Paper

References (22)

1. Baier, C., Bertrand, N., Größer, M.: Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems. In: DCFS. EPTCS, vol. 3, pp. 3-16 (2009)
2. Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theoretical Computer Science 36(3), 231-245 (2003)
3. Blum, M., Chandra, A., Wegman, M.: Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Inf. Process. Lett. 10(2), 80-82 (1980)
4. Chatterjee, K., Doyen, L., Henzinger, T.A.: Probabilistic weighted automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 244-258. Springer, Heidelberg (2009)
5. Christoff, L., Christoff, I.: Efficient algorithms for verification of equivalences for probabilistic processes. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 310-321. Springer, Heidelberg (1992)
6. Condon, A., Lipton, R.: On the complexity of space bounded interactive proofs (extended abstract). In: Proceedings of FOCS, pp. 462-467 (1989)
7. Cortes, C., Mohri, M., Rastogi, A.: On the computation of some standard distances between probabilistic automata. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 137-149. Springer, Heidelberg (2006)
8. Danos, V., Harmer, R.: Probabilistic game semantics. ACM Transactions on Computational Logic 3(3), 359-382 (2002)
9. DeMillo, R., Lipton, R.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193-195 (1978)
10. Doyen, L., Henzinger, T., Raskin, J.-F.: Equivalence of labeled Markov chains. International Journal of Foundations of Computer Science 19(3), 549-563 (2008)
11. Herman, T.: Probabilistic self-stabilization. Inf. Process. Lett. 35(2), 63-67 (1990)
12. Legay, A., Murawski, A.S., Ouaknine, J., Worrell, J.B.: On automated verification of probabilistic programs. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 173-187. Springer, Heidelberg (2008)
13. Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for Probabilistic Automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 208-221. Springer, Heidelberg (2003)
14. Murawski, A.S., Ouaknine, J.: On probabilistic program equivalence and refinement. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 156-170. Springer, Heidelberg (2005)
15. Paz, A.: Introduction to Probabilistic Automata. Academic Press, London (1971)
16. Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230-245 (1963)
17. Schützenberger, M.-P.: On the definition of a family of automata. Inf. and Control 4, 245-270 (1961)
18. Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701-717 (1980)
19. Segala, R.: Modeling and verification of randomized distributed real -time systems. Technical report, MIT, Cambridge MA, USA (1996)
20. Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (1997)
21. Tzeng, W.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing 21(2), 216-227 (1992)
22. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216-226. Springer, Heidelberg (1979)