The bisimulation problem for equational graphs of finite out-degree

SIAM Journal on Computing

Volumn 34, Issue 5, 2005, Pages 1025-1106

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Bisimulation; Complete formal systems; Deterministic pushdown automata; Equational graphs; Finite dimensional vector spaces; Matrix semigroups; Rational languages

Indexed keywords

AUTOMATION; COMPUTABILITY AND DECIDABILITY; COMPUTER SIMULATION; PROBLEM ORIENTED LANGUAGES; PROBLEM SOLVING; VECTORS;

BISIMULATION; COMPLETE FORMAL SYSTEMS; DETERMINISTIC PUSHDOWN AUTOMATA; EQUATIONAL GRAPHS; FINITE DIMENSIONAL VECTOR SPACES; MATRIX SEMIGROUPS; RATIONAL LANGUAGES;

GRAPH THEORY;

EID: 27144492978     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700377256     Document Type: Article

References (50)

1. J. BAETEN, J. BERGSTRA, AND J. KLOP, Decidability of bisimulation equivalence for processes generating context-free languages, in Proceedings of PARLE 87, Lecture Notes in Comput. Sci. 259, Springer-Verlag, Berlin, 1987, pp. 94-111.
2. M. BAUDERON, Infinite hypergraph I. Basic properties (fundamental study), Theoret. Comput. Sci., 82 (1991), pp. 177-214.
3. M. BAUDERON, Infinite hypergraph II. Systems of recursive equations, Theoret. Comput. Sci., 103 (1992), pp. 165-190.
4. M. BOFFA, Une remarque sur les systèmes complets d'identités rationnelles, RAIRO Inform. Théor. Appl., 24 (1990), pp. 419-423.
5. D. CAUCAL, Graphes canoniques des graphes algébriques, RAIRO Inform. Théor. Appl., 24 (1990), pp. 339-352.
6. D. CAUCAL, Bisimulation of context-free grammars and of pushdown automata, in Modal Logic and Process Algebra, CSLI Lecture Notes 53, CSLI Publications, Stanford, CA, 1995, pp. 85-106.
7. S. CHRISTENSEN, Y. HIRSHFELD, AND F. MOLLER, Bisimulation is decidable for basic parallel processes, in Proceedings of CONCUR'93, Lecture Notes in Comput. Sci. 715, Springer-Verlag, Berlin, 1993, pp. 143-157.
8. S. CHRISTENSEN, H. HÜTTEL, AND C. STIRLING, Bisimulation equivalence is decidable for all context-free processes, Inform, and Comput., 121 (1995), pp. 143-148.
9. B. COURCELLE, An axiomatic approach to the Korenjac-Hopcroft algorithms, Math. Systems Theory, 16 (1983), pp. 191-231.
10. B. COURCELLE, Fundamental properties of infinite trees, Theoret. Comput. Sci., 25 (1983), pp. 95-169.
11. B. COURCELLE, The monadic second-order logic of graphs II. Infinite graphs of bounded width, Math. Systems Theory, 21 (1989), pp. 187-221.
12. B. COURCELLE, Graph rewriting: An algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed., MIT Press, Cambridge, MA, 1990, pp. 193-242.
13. B. COURCELLE, The monadic second-order logic of graphs IV. Definability properties of equational graphs, Ann. Pure Appl. Logic, 49 (1990), pp. 193-255.
14. J. GROOTE AND H. HÜTTEL, Undecidable equivalences for basic process algebra, Inform, and Comput., 115 (1994), pp. 354-371.
15. M. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
16. M. HARRISON, I. HAVEL, AND A. YEHUDAI, On equivalence of grammars through transformation trees, Theoret. Comput. Sci., 9 (1979), pp. 173-205.
17. Y. HIRSHFELD, M. JERRUM, AND F. MOLLER, A polynomial algorithm for deciding equivalence of normed context-free processes, in Proceedings of FOCS'94, IEEE, 1994, pp. 623-631.
18. H. HÜTTEL AND C. STIRLING, Actions speak louder than words: Proving bisimilarity for context-free processes, in Proceedings of LICS'91, IEEE, 1991, pp. 376-385.
19. P. JANCAR, Bisimulation is decidable for one-counter processes, in Proceedings of ICALP 97, Springer-Verlag, Berlin, 1997, pp. 549-559.
20. D. KOZEN, A completeness theorem for Kleene algebras and the algebra of regular events, in Proceedings of LICS'91, IEEE, 1991, pp. 214-225.
21. D. KROB, Complete systems of B-rational identities, Theoret. Comput. Sci., 89 (1991), pp. 207-343.
22. R. MAYR, Undecidability of weak bisimulation equivalence for 1-counter processes, in Proceedings of ICALP 03, Lecture Notes in Comput. Sci. 2719, Springer-Verlag, Berlin, 2003, pp. 570-583.
23. Y. MEITUS, The equivalence problem for real-time strict deterministic pushdown automata, Kibernetika, 5 (1989), pp. 14-25 (in Russian; English translation in Cybernetics and Systems Analysis).
24. Y. MEITUS, Decidability of the equivalence problem for deterministic pushdown automata, Kibernetika, 5 (1992), pp. 20-45 (in Russian; English translation in Cybernetics and Systems Analysis).
25. R. MILNER, A complete inference system for a class of regular behaviours, J. Comput. System Sci., 28 (1984), pp. 439-466.
26. R. MILNER, Communication and Concurrency, Prentice-Hall, New York, 1989.
27. D. MULLER AND P. SCHUPP, The theory of ends, pushdown automata and second-order logic, Theoret. Comput. Sci., 37 (1985), pp. 51-75.
28. M. OYAMAGUCHI, The equivalence problem for real-time d.p.d.a's. J. Assoc. Comput. Mach., 34 (1987), pp. 731-760.
29. D. PARK, Concurrency and automata on infinite sequences, in Theoretical Computer Science, Lecture Notes in Comput. Sci. 104, Springer-Verlag, Berlin, 1981, pp. 167-183.
30. H. ROGERS, Theory of Recursive Functions and Effective Calculability, Series in Higher Mathematics, McGraw-Hill, New York, 1967.
31. V. ROMANOVSKII, Equivalence problem for real-time deterministic pushdown automata, Kibernetika, 2 (1985), pp. 13-23.
32. A. SALOMAA, Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach., 13 (1966), pp. 158-169.
33. G. SÉNIZERGUES, Γ(A) ∼ Γ(B)?, tech. report, nr1183-97, LaBRI, Université Bordeaux I, Talence, France, 1997; available online from http://www.labri.u-bordeaux.fr/~ges/.
34. G. SÉNIZERGUES, L(A) = L(B)?, tech. report, nr1161-97, LaBRI, Université Bordeaux I, Talence, France, 1997.
35. G. SÉNIZERGUES, L(A) = L(B)?, in Proceedings of INFINITY 97, Electronic Notes in Theoretical Computer Science 9, Elsevier, Amsterdam, 1997, pp. 1-26; available online from http://www.elsevier.nl/locate/entcs/volume9. html.
36. G. SÉNIZERGUES, The equivalence problem for deterministic pushdown automata is decidable, in Proceedings ICALP 97, Lecture Notes in Comput. Sci. 1256, Springer-Verlag, Berlin, 1997, pp. 671-681.
37. G. SÉNIZERGUES, Decidability of bisimulation equivalence for equational graphs of finite out-degree, in Proceedings of FOCS'98, R. Motwani, ed., IEEE Computer Society Press, Los Alamitos, CA, 1998, pp. 120-129.
38. G. SÉNIZERGUES, T(A) = T(B)?, in Proceedings of ICALP 99, Lecture Notes in Comput. Sci. 1644, Springer-Verlag, Berlin, 1999, pp. 665-675.
39. Full proofs in T(A) = T(B)?, tech. report 1209-99, LaBRI, Université Bordeaux I, Talence, France, 1999, pp. 1-61.
40. G. SÉNIZERGUES, Complete formal systems for equivalence problems, Theoret. Comput. Sci., 231 (2000), pp. 309-334.
41. G. SÉNIZERGUES, L(A) = L(B)? Decidability results from complete formal systems, Theoret. Comput. Sci., 251 (2001), pp. 1-166.
42. G. SÉNIZERGUES, Some applications of the decidability of dpda's equivalence, in Proceedings of MCU'01, Lecture Notes in Comput. Sci. 2055, Springer-Verlag, Berlin, 2001, pp. 114-132.
43. G. SÉNIZERGUES, L(A) = L(B)? A simplified decidability proof, Theoret. Comput. Sci., 281 (2002), pp. 555-608.
44. G. SÉNIZERGUES, The equivalence problem for t-turn dpda is co-NP, in Proceedings of ICALP 03, Lecture Notes in Comput. Sci. 2719, Springer-Verlag, Berlin, 2003, pp. 478-489.
45. J. SRBA, Undecidability of weak bisimilarity for pushdown processes, in Proceedings of CONCUR 02, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 579-593.
46. C. STIRLING, Decidability of bisimulation equivalence for normed pushdown processes, in Proceedings of CONCUR 96, Lecture Notes in Comput. Sci. 1119, Springer-Verlag, Berlin, 1996, pp. 217-232.
47. C. STIRLING, Decidability of DPDA Equivalence, tech. report, Edinburgh ECS-LFCS-99-411, 1999, pp. 1-25; available online from http://www.lfcs.inf.ed. ac.uk/reports/99/ECS-LFCS-99-411/.
48. C. STIRLING, Decidability of DPDA equivalence, Theoret. Comput. Sci., 255 (2001), pp. 1-31.
49. C. STIRLING, Deciding DPDA equivalence is primitive recursive, in Proceedings of ICALP 02, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 821-832.
50. L. VALIANT, The equivalence problem for deterministic finite-turn pushdown automata, Inform. and Control, 25 (1974), pp. 123-133.