Visibly pushdown automata: From language equivalence to simulation and bisimulation

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

Volumn 4207 LNCS, Issue , 2006, Pages 89-103

  Srba, Jiří ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SIMULATION; COMPUTER SIMULATION LANGUAGES; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

BISIMULATION EQUIVALENCE; HARDNESS RESULTS; POLYNOMIAL TIME; PUSHDOWN AUTOMATA;

AUTOMATA THEORY;

EID: 33750373069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_6     Document Type: Conference Paper

References (25)

1. L. Aceto, W. Fokkink, and A. Ingólfsdóttir. 2-nested simulation is not finitely equationally axiomatizable. In Proc. of STACS'01, vol. 2010 of LNCS, p. 39-50. Springer, 2001.
2. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In Proc. of TACAS'04, vol. 2988 of LNCS, p. 467-481. Springer, 2004.
3. R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan. Congruences for visibly pushdown languages. In Proc. of ICALP'05, vol. 3580 of LNCS, p. 1102-1114. Springer, 2005.
4. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proc. of STOC'04, p. 202-211. ACM Press, 2004.
5. J. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A):638-648, 1992.
6. V. Bárány, Ch. Löding, and O. Serre. Regularity problems for visibly pushdown languages. In Proc. of STACS'06, vol. 3884 of LNCS, p. 420-431. Springer, 2006.
7. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. of CONCUR'97, vol. 1243 of LNCS, p. 135-150. Springer, 1997.
8. O. Burkart, D. Caucal, and B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proc. of MFCS'95, vol. 969 of LNCS, p. 423-433. Springer, 1995.
9. O. Burkart, D. Caucal, and B. Steifen. Bisimulation collapse and the process taxonomy. In Proc. of CONCUR'96, vol. 1119 of LNCS, p. 247-262. Springer, 1996.
10. J.F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):353-371, 1994.
11. M. Holzer. On emptiness and counting for alternating finite automata. In Proc. of DLT'95, pages 88-97. World Scientific, 1996.
12. P. Jančar. Decidability of bisimilarity for one-counter processes. Information and Computation, 158(1):1-17, 2000.
13. P. Jančar, A. Kučera, F. Moller, and Z. Sawa. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation, 188(1):1-19, 2004.
14. P. Jančar, F. Moller, and Z. Sawa. Simulation problems for one-counter machines. In Proc. of SOFSEM'99, vol. 1725 of LNCS, p. 404-413. Springer, 1999.
15. P. Jančar and J. Srba. Highly undecidable questions for process algebras. In Proc. of TCS'04, p. 507-520. Kluwer Academic Publishers, 2004.
16. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
17. A, Kučera and R. Mayr. On the complexity of semantic equivalences for pushdown automata and BPA. In Proc. of MFCS'02, vol. 2420 of LNCS, p. 433-445. Springer, 2002.
18. A. Murawski and I. Walukiewicz. Third-order idealized algol with iteration is decidable. In Proc. of FOBSACS'05, vol. 3441 of LNCS, p. 202-218, 2005.
19. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973-989, December 1987.
20. C. Pitcher. Visibly pushdown expression effects for XML stream processing. In Proc. of PLAN-X, pages 5-19, 2005.
21. Z. Sawa and P. Jančar. P-hardness of equivalence testing on finite-state processes. In Proc. of SOFSEM'01, vol. 2234 of LNCS, p. 326-345. Springer, 2001.
22. G. Sénizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proc. of FOCS'98, p. 120-129. IEEE Computer Society, 1998.
23. O. Serre, Parity games played on transition graphs of one-counter processes. In Proc. of FOSSACS'06, vol. 3921 of LNCS, p. 337-351, Springer, 2006.
24. J. Srba. Strong bisimilarity and regularity of basic process algebra is PSPACE-hard. In Proc. of ICALP'02, vol. 2380 of LNCS, p. 716-727, Springer, 2002.
25. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234-263, 2001.