On the complexity of the equivalence problem for probabilistic automata

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

Volumn 7213 LNCS, Issue , 2012, Pages 467-481

  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

ANONYMITY PROPERTY; ARITHMETIC CIRCUIT; COST DISTRIBUTION; CUMULATIVE COST; DETERMINISTIC ALGORITHMS; EFFICIENT ALGORITHM; EQUIVALENCE PROBLEM; EQUIVALENCE TESTS; LOGSPACE; POLYNOMIAL IDENTITY TESTING; POLYNOMIAL-TIME; PROBABILISTIC AUTOMATA; PROBABILISTIC COSTS; PROBABILISTIC SYSTEMS; PUSH-DOWN AUTOMATA; VISIBLY PUSHDOWN AUTOMATON;

ALGORITHMS; COSTS; EQUIVALENCE CLASSES; POLYNOMIAL APPROXIMATION; SOFTWARE TESTING; AUTOMATA THEORY; LOGIC CIRCUITS; POLYNOMIALS; PROBABILISTIC LOGICS;

AUTOMATA THEORY; EQUIVALENCE CLASSES;

EID: 84859112263     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28729-9_31     Document Type: Conference Paper

References (30)

1. Allender, E.E., Bürgisser, P., Kjeldgaard-Pedersen, J., Bro Miltersen, P.: On the complexity of numerical analysis. SIAM J. Comput. 38(5), 1987-2006 (2009)
2. Almagor, S., Boker, U., Kupferman, O.: What's Decidable about Weighted Automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 482-491. Springer, Heidelberg (2011)
3. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. 36th Annual ACM Symposium on Theory of Computing, STOC, pp. 202-211. ACM (2004)
4. Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theoretical Computer Science 36(3), 231-245 (2003)
5. Brumley, D., Boneh, D.: Remote timing attacks are practical. Computer Networks 48(5), 701-716 (2005)
6. Condon, A., Lipton, R.: On the complexity of space bounded interactive proofs (extended abstract). In: Proceedings of FOCS, pp. 462-467 (1989)
7. Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Information and Control 64(1-3), 2-22 (1985)
8. 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)
9. DeMillo, R., Lipton, R.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193-195 (1978)
10. Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56(1), 1:1-1:66 (2009)
11. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: P-completeness theory. Oxford University Press (1995)
12. Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: On the complexity of the equivalence problem for probabilistic automata. Technical report, arxiv.org (2012), http://arxiv.org/abs/1112.4644
13. Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: Language Equivalence for Probabilistic Automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 526-540. Springer, Heidelberg (2011)
14. Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104-113. Springer, Heidelberg (1996)
15. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. Journal of Alg. and Comp. 4(3), 232-249 (1994)
16. Kučera, A., Esparza, J., Mayr, R.: Model checking probabilistic pushdown automata. Logical Methods in Computer Science 2(1), 1-31 (2006)
17. Legay, A., Murawski, A.S., Ouaknine, J., Worrell, J.: On Automated Verification of Probabilistic Programs. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 173-187. Springer, Heidelberg (2008)
18. Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: STOC, pp. 345-354 (1987)
19. 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)
20. Niven, I.: Formal power series. American Mathematical Monthly 76(8), 871-889 (1969)
21. Rabin, M.O.: Probabilistic automata. Inf. and Control 6(3), 230-245 (1963)
22. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120-126 (1978)
23. Rudin, W.: Functional analysis, 2nd edn. International Series in Pure and Applied Mathematics. McGraw-Hill Inc., New York (1991)
24. Schützenberger, M.-P.: On the definition of a family of automata. Inf. and Control 4, 245-270 (1961)
25. Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701-717 (1980)
26. Sénizergues, G.: The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 671-681. Springer, Heidelberg (1997)
27. Stirling, C.: Deciding DPDA Equivalence Is Primitive Recursive. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 821-832. Springer, Heidelberg (2002)
28. Tzeng, W.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing 21(2), 216-227 (1992)
29. Tzeng, W.: On path equivalence of nondeterministic finite automata. Inf. Process. Lett. 58(1), 43-46 (1996)
30. 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)