Equivalence-checking with infinite-state systems: Techniques and results

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

Volumn 2540 LNCS, Issue , 2002, Pages 41-73

  Kučera, Antonín ^a   Jančar, Petr ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INFINITE STATE SYSTEMS; TECHNIQUES AND RESULTS; EQUIVALENCE CHECKING;

INFORMATION SCIENCE;

EID: 56649120073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36137-5_3     Document Type: Conference Paper

References (81)

1. P.A. Abdulla and K.Čerans. Simulation is decidable for one-counter nets. In Proceedings of CONCUR'98, vol. 1466 of LNCS, pp. 253-268. Springer, 1998.
2. P.A. Abdulla, K.Čerans, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of LICS'96, pp. 160-170. IEEE, 1996.
3. P.A. Abdulla and M. Kindahl. Decidability of simulation and bisimulation between lossy channel systems and finite state systems. In Proceedings of CONCUR' 95, vol. 962 of LNCS, pp. 333-347. Springer, 1995.
4. J .C.M. Baeten, J .A. Bergstra, and J .W. Klop. On the consistency of Koomen's fair abstraction rule. TCS, 51(1):129-176, 1987.
5. J .C.M. Baeten, J .A. Bergstra, and J .W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. JACM, 40: 653-682, 1993.
6. J .C.M. Baeten and W.P. Weijland. Process Algebra. No. 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
7. J. Blanco. Normed BPP and BPA. In Proceedings of ACP'94, Workshops in Computing, pp. 242-251. Springer, 1995.
8. J .R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L .J. Hwang. Symbolic model checking: 1020 states and beyond. I&C, 98(2):142-170, 1992.
9. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In Handbook of Process Algebra, pp. 545-623. Elsevier, 2001.
10. O. Burkart, D. Caucal, and B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proceedings of MFCS'95, vol. 969 of LNCS, pp. 423-433. Springer, 1995.
11. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR'96, vol. 1119 of LNCS, pp. 247-262. Springer, 1996.
12. D. Caucal. Graphes canoniques des graphes algébriques. Informatique Théorique et Applications (RAIRO), 24(4):339-352, 1990.
13. I. Černá, M. Kretínský, and A. Kučera. Comparing expressibility of normed BPA and normed BPP processes. Acta Informatica, 36(3):233-256, 1999.
14. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993.
15. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR'93, vol. 715 of LNCS, pp. 143-157. Springer, 1993.
16. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. I&C, 121:143-148, 1995.
17. E.M. Clark, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 1999.
18. E.A. Emerson. Temporal and modal logic. Handbook of TCS, B: 995-1072, 1991.
19. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. In Proceedings of FCT'95, vol. 965 of LNCS, pp. 221-232. Springer, 1995.
20. J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997.
21. E.P. Friedman. The inclusion problem for simple languages. TCS, 1(4):297-316, 1976.
22. J .F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42:167-171, 1992.
23. Y. Hirshfeld. Petri nets and the equivalence problem. In Proceedings of CSL'93, vol. 832 of LNCS, pp. 165-174. Springer, 1994. 68, 69.
24. Y. Hirshfeld. Bisimulation trees and the decidability of weak bisimulations. ENTCS, 5, 1996.
25. Y. Hirshfeld and M. Jerrum. Bisimulation equivalence is decidable for normed process algebra. In Proceedings of ICALP'99, vol. 1644 of LNCS, pp. 412-421. Springer, 1999.
26. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. TCS, 158:143-159, 1996.
27. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. MSCS, 6:251-259, 1996.
28. J .E. Hopcroft and J .D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
29. H. Hüttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. Journal of Logic and Computation, 8(4):485-509, 1998.
30. D.T. Huynh and L. Tian. Deciding bisimilarity of normed context-free processes is in ΣP 2 . TCS, 123:183-197, 1994.
31. P. Jančar. New results for bisimilarity on basic parallel processes. A short presentation at Infinity 2002 workshop.
32. P. Jančar. High undecidability of weak bisimilarity for Petri nets. In Proceedings of CAAP'95, vol. 915 of LNCS, pp. 349-363. Springer, 1995.
33. P. Jančar. Undecidability of bisimilarity for Petri nets and some related problems. TCS, 148(2):281-301, 1995.
34. P. Jančar. Decidability of bisimilarity for one-counter processes. I&C, 158(1):1-17, 2000.
35. P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, vol. 1099 of LNCS, pp. 478-489. Springer, 1996.
36. P. Jančar and A. Kučera. Bisimilarity of processes with finite-state systems. ENTCS, 9, 1997.
37. P. Jančar, A. Kučera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. TCS, 258(1-2):409-433, 2001.
38. P. Jančar, A. Kučera, and F. Moller. Simulation and bisimulation over onecounter processes. In Proceedings of STACS 2000, vol. 1770 of LNCS, pp. 334-345. Springer, 2000.
39. P. Jančar, A. Kučera, F. Moller, and Z. Sawa. Equivalence-checking with onecounter automata: A generic method for proving lower bounds. In Proceedings of FoSSaCS 2002, vol. 2303 of LNCS, pp. 172-186. Springer, 2002.
40. P. Jančar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR'95, vol. 962 of LNCS, pp. 348-362. Springer, 1995.
41. P. Jančar, F. Moller, and Z. Sawa. Simulation problems for one-counter machines. In Proceedings of SOFSEM'99, vol. 1725 of LNCS, pp. 404-413. Springer, 1999.
42. D. Kozen. Results on the propositional μ-calculus. TCS, 27:333-354, 1983.
43. A. Kučera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS'96, vol. 1180 of LNCS, pp. 111-122. Springer, 1996.
44. A. Kučera. Effective decomposability of sequential behaviours. TCS, 242(1-2):71- 89, 2000.
45. A. Kučera. Efficient verification algorithms for one-counter processes. In Proceedings of ICALP 2000, vol. 1853 of LNCS, pp. 317-328. Springer, 2000.
46. A. Kučera. On simulation-checking with sequential systems. In Proceedings of ASIAN 2000, vol. 1961 of LNCS, pp. 133-148. Springer, 2000.
47. A. Kučera and R. Mayr. On the complexity of semantic equivalences for pushdown automata and BPA. In Proceedings of MFCS 2002, vol. 2420 of LNCS, pp. 433- 445. Springer, 2002.
48. A. Kučera and R. Mayr. Simulation preorder over simple process algebras. I&C, 173(2):184-198, 2002.
49. A. Kučera and R. Mayr. Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. TCS, 270(1-2):677-700, 2002.
50. A. Kučera and R. Mayr. Why is simulation harder than bisimulation? In Proceedings of CONCUR 2002, vol. 2421 of LNCS, pp. 594-609. Springer, 2002.
51. R. Lipton. The reachability problem requires exponential space. Technical report 62, Yale University, 1976.
52. R. Mayr. Weak bisimulation and model checking for basic parallel processes. In Proceedings of FST&TCS'96, vol. 1180 of LNCS, pp. 88-99. Springer, 1996.
53. R. Mayr. On the complexity of bisimulation problems for basic parallel processes. In Proceedings of ICALP 2000, vol. 1853 of LNCS, pp. 329-341. Springer, 2000.
54. R. Mayr. On the complexity of bisimulation problems for pushdown automata. In Proceedings of IFIP TCS'2000, vol. 1872 of LNCS, pp. 474-488. Springer, 2000.
55. R. Mayr. Decidability of model checking with the temporal logic EF. TCS, 256:31-62, 2001. 59.
56. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
57. M.L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
58. F. Moller. Infinite results. In Proceedings of CONCUR'96, vol. 1119 of LNCS, pp. 195-216. Springer, 1996.
59. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second order logic. TCS, 37(1):51-75, 1985.
60. Ch. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
61. th GI Conference, vol. 104 of LNCS, pp. 167-183. Springer, 1981.
62. D. Sangiorgi. On the proof method for bisimulation. In Proceedings of MFCS'95, vol. 969 of LNCS, pp. 479-488. Springer, 1995.
63. Ph. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proceedings of TACS'2001, vol. 2215 of LNCS, pp. 385-399. Springer, 2001.
64. G. Sénizergues. The equivalence problem for deterministic pushdown automata is decidable. In Proceedings of ICALP'97, vol. 1256 of LNCS, pp. 671-681. Springer, 1997.
65. G. Sénizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proceedings of FOCS'98, pp. 120-129. IEEE, 1998.
66. J. Srba. Applications of the existential quantification technique. A short presentation at Infinity 2002 workshop.
67. J. Srba. Complexity of weak bisimilarity and regularity for BPA and BPP. MSCS. To appear.
68. J. Srba. Strong bisimilarity and regularity of basic parallel processes is PSPACE hard. In Proceedings of STACS 2002, vol. 2285 of LNCS, pp. 535-546. Springer, 2002.
69. J. Srba. Strong bisimilarity and regularity of basic process algebra is PSPACEhard. In Proceedings of ICALP 2002, vol. 2380 of LNCS, pp. 716-727. Springer, 2002.
70. J. Srba. Undecidability of weak bisimilarity for PA-processes. In Proceedings of DLT 2002, LNCS. Springer, 2002. To appear.
71. J. Srba. Undecidability of weak bisimilarity for pushdown processes. In Proceedings of CONCUR 2002, vol. 2421 of LNCS, pp. 579-593. Springer, 2002.
72. B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. I&C, 110(1):149-163, 1994.
73. C. Stirling. Modal and temporal logics. Handbook of Logic in Comp. Sci., 2:477- 563, 1992.
74. C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. TCS, 195:113-131, 1998.
75. C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001.
76. C. Stirling. Deciding DPDA equivalence is primitive recursive. In Proceedings of ICALP 2002, vol. 2380 of LNCS, pp. 821-832. Springer, 2002.
77. J. Stríbrná. Hardness results for weak bisimilarity of simple process algebras. ENTCS, 18, 1998.
78. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science. In Proceedings of TAPSOFT'93, vol. 668 of LNCS, pp. 559-568. Springer, 1993.
79. R. van Glabbeek. The linear time-branching time spectrum. Handbook of Process Algebra, pp. 3-99, 1999.
80. I. Walukiewicz. Model checking CTL properties of pushdown systems. In Proceedings of FST&TCS 2000, vol. 1974 of LNCS, pp. 127-138. Springer, 2000.
81. I. Walukiewicz. Pushdown processes: Games and model-checking. I&C, 164(2):234-263, 2001.