On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

Information and Computation

Volumn 208, Issue 7, 2010, Pages 737-771

  Kuera, Antonín ^a   Mayr, Richard ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Bisimulation; Pushdown automata; Simulation; Verification

Indexed keywords

BISIMULATION EQUIVALENCES; BISIMULATIONS; CONCURRENCY THEORY; FINITE CONTROL; FINITE-STATE PROCESS; FIXED-PARAMETER TRACTABILITY; INPUT PARAMETER; PUSH-DOWN AUTOMATA; PUSHDOWN PROCESS; SEMANTIC EQUIVALENCES; SIMULATION VERIFICATION; STANDARD DEFINITIONS; STRONG BISIMULATION; WEAK BISIMULATION;

POLYNOMIALS; SEMANTICS; TRANSLATION (LANGUAGES);

COMPUTATIONAL COMPLEXITY;

EID: 77955314726     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2010.03.002     Document Type: Article

References (59)

1. Proceedings of CONCUR'96, Lecture Notes in Computer Science, vol. 1119, Springer, 1996.
2. Proceedings of CONCUR'99, Lecture Notes in Computer Science, vol. 1664, Springer, 1999.
3. Proceedings of CAV 2001, Lecture Notes in Computer Science, vol. 2102, Springer, 2001.
4. Proceedings of CONCUR 2002, Lecture Notes in Computer Science, vol. 2421, Springer, 2002.
5. R. Alur, K. Etessami, P. Madhusudan, A temporal logic of nested calls and returns, in: Proceedings of TACAS 2004, Lecture Notes in Computer Science, vol. 2988, Springer, 2004.
6. R. Alur, K. Etessami, M. Yannakakis, Analysis of recursive state machines, in: Proceedings of CAV 2001 [3], pp. 207-220.
7. J. Baeten, J. Bergstra, and J. Klop Decidability of bisimulation equivalence for processes generating context-free languages Journal of the Association for Computing Machinery 40 1993 653 682
8. J. Baeten, W. Weijland, Process Algebra, No. 18 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990.
9. A. Bouajjani, Languages, rewriting systems, and verification of infinite-state systems, in: Proceedings of ICALP 2001, Lecture Notes in Computer Science, vol. 2076, Springer, 2001.
10. A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model checking, in: Proceedings of CONCUR'97, Lecture Notes in Computer Science, vol. 1243, Springer, 1997.
11. O. Burkart, D. Caucal, F. Moller, and B. Steffen Verification on infinite structures J. Bergstra, A. Ponse, S. Smolka, Handbook of Process Algebra 2001 Elsevier
12. O. Burkart, D. Caucal, B. Steffen, An elementary decision procedure for arbitrary context-free processes, in: Proceedings of MFCS'95, Lecture Notes in Computer Science, vol. 969, Springer, 1995.
13. O. Burkart, D. Caucal, B. Steffen, Bisimulation collapse and the process taxonomy, in: Proceedings of CONCUR'96 [1], pp. 247-262.
14. D. Caucal Graphes canoniques des graphes algébriques Informatique Théorique et Applications (RAIRO) 24 4 1990 339 352
15. S. Christensen, H. Hüttel, and C. Stirling Bisimulation equivalence is decidable for all context-free processes Information and Computation 121 1995 143 148
16. E. Clark, O. Grumberg, and D. Peled Model Checking 1999 The MIT Press
17. J. Esparza Decidability of model checking for infinite-state concurrent systems Acta Informatica 34 1997 85 107
18. J. Esparza, J. Knoop, An automata-theoretic approach to interprocedural data-flow analysis, in: Proceedings of FoSSaCS'99, Lecture Notes in Computer Science, vol. 1578, Springer, 1999.
19. J. Esparza, A. Kuera, and S. Schwoon Model-checking LTL with regular valuations for pushdown systems Information and Computation 186 2 2003 355 376
20. J. Esparza, S. Schwoon, A BDD-based model checker for recursive programs, in: Proceedings of CAV 2001 [3], pp. 324-336.
21. E. Friedman The inclusion problem for simple languages Theoretical Computer Science 1 4 1976 297 316
22. J. Groote A short proof of the decidability of bisimulation for normed BPA processes Information Processing Letters 42 1992 167 171
23. M. Hennessy, R. Milner, On observing nondeterminism and concurrency, vol. 85 of LNCS, 1980.
24. Y. Hirshfeld, M. Jerrum, and F. Moller A polynomial algorithm for deciding bisimilarity of normed context-free processes Theoretical Computer Science 158 1996 143 159 (Pubitemid 126411929)
25. J. Hopcroft, and J. Ullman Introduction to Automata Theory, Languages, and Computation 1979 Addison-Wesley
26. H. Hüttel, and C. Stirling Actions speak louder than words: proving bisimilarity for context-free processes Journal of Logic and Computation 8 4 1998 485 509
27. P. Janar Undecidability of bisimilarity for Petri nets and some related problems Theoretical Computer Science 148 2 1995 281 301
28. P. Janar, A. Kuera, and R. Mayr Deciding bisimulation-like equivalences with finite-state processes Theoretical Computer Science 258 1-2 2001 409 433
29. P. Janar, F. Moller, Techniques for decidability and undecidability of bisimilarity, in: Proceedings of CONCUR'99 [2], pp. 30-45.
30. P. Janar, and A. Kuera Equivalence checking on infinite-state systems: techniques and results Theory and Practice of Logic Programming 6 3 2006 227 264
31. P. Janar, and J. Srba Undecidability of bisimilarity by defender's forcing Journal of the ACM 55 1 2008 1 26
32. D. Kozen Results on the propositional μ -calculus Theoretical Computer Science 27 1983 333 354
33. A. Kuera, On simulation-checking with sequential systems, in: Proceedings of ASIAN 2000, Lecture Notes in Computer Science, vol. 1961, Springer, 2000.
34. A. Kuera, R. Mayr, Simulation preorder on simple process algebras, in: Proceedings of ICALP'99, Lecture Notes in Computer Science, vol. 1644, Springer, 1999.
35. A. Kuera, R. Mayr, Weak bisimilarity with infinite-state systems can be decided in polynomial time, in: Proceedings of CONCUR'99 [2], pp. 368-382.
36. A. Kuera, R. Mayr, On the complexity of semantic equivalences for pushdown automata and BPA, in: Proceedings of MFCS 2002, Lecture Notes in Computer Science, vol. 2420, Springer, 2002.
37. A. Kuera, and R. Mayr Simulation preorder over simple process algebras Information and Computation 173 2 2002 184 198
38. A. Kuera, and R. Mayr Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time Theoretical Computer Science 270 1-2 2002 677 700
39. A. Kuera, R. Mayr, Why is simulation harder than bisimulation? in: Proceedings of CONCUR 2002 [4], pp. 594-609.
40. A. Kuera, R. Mayr, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata, in: Proceedings of IFIP TCS 2004, 2004.
41. R. Mayr, On the complexity of bisimulation problems for pushdown automata, in: Proceedings of IFIP TCS'2000, Lecture Notes in Computer Science, vol. 1872, Springer, 2000.
42. R. Mayr, Undecidability of weak bisimulation equivalence for 1-counter processes, in: Proceedings of ICALP 2003, Lecture Notes in Computer Science, vol. 2719, Springer, 2003.
43. R. Mayr Weak bisimilarity and regularity of context-free processes is exptime-hard TCS 330 2005 553 575
44. R. Milner Communication and Concurrency 1989 Prentice-Hall
45. F. Moller, Infinite results, in: Proceedings of CONCUR'96 [1], pp. 195-216.
46. D. Park, Concurrency and automata on infinite sequences, in: Proceedings 5th GI Conference, Lecture Notes in Computer Science, vol. 104, Springer, 1981.
47. G. Sénizergues Decidability of bisimulation equivalence for equational graphs of finite out-degree Proceedings of FOCS'98 1998 IEEE Computer Society Press
48. J. Srba Roadmap of infinite results EATCS Bulletin 78 2002 163 175
49. J. Srba, Strong bisimilarity and regularity of basic process algebra is PSPACE-hard, in: Proceedings of ICALP 2002, Lecture Notes in Computer Science, vol. 2380, Springer, 2002.
50. J. Srba, Undecidability of weak bisimilarity for pushdown processes, in: Proceedings of CONCUR 2002 [4], pp. 579-593.
51. C. Stirling Decidability of bisimulation equivalence for normed pushdown processes Theoretical Computer Science 195 1998 113 131
52. C. Stirling, The joys of bisimulation, in: Proceedings of MFCS'98, Lecture Notes in Computer Science, vol. 1450, Springer, 1998.
53. W. Thomas, On the Ehrenfeucht-Fraïssé game in theoretical computer science, in: Proceedings of TAPSOFT'93, Lecture Notes in Computer Science, vol. 668, Springer, 1993.
54. R. van Glabbeek, The linear time - branching time spectrum II: the semantics of sequential systems with silent moves, in: Proceedings of CONCUR'93, Lecture Notes in Computer Science, vol. 715, Springer, 1993.
55. R. van Glabbeek The linear time - branching time spectrum Handbook of Process Algebra 1999 3 99
56. J. van Leeuwen, Handbook of Theoretical Computer Science: Volume A Algorithms and Complexity 1990 Elsevier
57. I. Walukiewicz, Model checking CTL properties of pushdown systems, in: Proceedings of FST&TCS 2000, Lecture Notes in Computer Science, vol. 1974, Springer, 2000.
58. I. Walukiewicz Pushdown processes: games and model-checking Information and Computation 164 2 2001 234 263
59. I. Walukiewicz, Personal communication, 2006.