Weak bisimilarity and regularity of context-free processes is EXPTIME-hard

Theoretical Computer Science

Volumn 330, Issue 3, 2005, Pages 553-575

  Mayr, Richard ^a  

^a North Carolina State University   (United States)

Author keywords

Bisimulation; BPA; Context free processes; Pushdown automata

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; CONTEXT FREE GRAMMARS; CONTROL SYSTEMS; POLYNOMIALS; SET THEORY;

BISIMULATION; BPA; PUSHDOWN ALGEBRA; PUSHDOWN AUTOMATA (PDA);

COMPUTER SCIENCE;

EID: 12444341891     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.008     Document Type: Conference Paper

References (23)

1. J. Balcazar, J. Gabarro, and M. Santha Deciding bisimilarity is P -complete Formal Aspects Comput. 4 1992 638 648
2. 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 Science Amsterdam 545 623 (Chapter 9)
3. O. Burkart, D. Caucal, and B. Steffen An elementary bisimulation decision procedure for arbitrary context-free processes Proc. MFCS'95, Lecture Notes in Computer Science Vol. 969 1995 Springer Berlin
4. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer Alternation J. ACM 28 1 1981 114 133
5. Y. Hirshfeld Bisimulation trees and the decidability of weak bisimulations Electron. Notes Theoret. Comput. Sci. (ENTCS) 5 1997
6. Y. Hirshfeld, M. Jerrum, and F. Moller A polynomial algorithm for deciding bisimilarity of normed context-free processes Theoret. Comput. Sci. 158 1996 143 159
7. P. J̌anar High undecidability of weak bisimilarity for Petri nets Proc. CAAP'95, Lecture Notes in Computer Science Vol. 915 1995 Springer Berlin 349 363
8. A. Kǔera, and R. Mayr On the complexity of semantic equivalences for pushdown automata and BPA Proc. MFCS 2002 Vol. 2420 2002 Springer Berlin 433 445
9. A. Kǔera, and R. Mayr Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time Theoret. Comput. Sci. 270 2002 667 700
10. R. Mayr Process rewrite systems Inform. Comput. 156 1 2000 264 286
11. R. Mayr Undecidability of weak bisimulation equivalence for counter 1-processes Proc. ICALP 2003, Lecture Notes in Computer Science Vol. 2719 2003 Springer Berlin
12. R. Milner Communication and Concurrency 1989 Englewood Cliffs, NJ Prentice-Hall
13. E.L. Post A variant of a recursively unsolvable problem Bull. Amer. Math. Soc. 52 1946 264 268
14. G. Sénizergues, Decidability of bisimulation equivalence for equational graphs of finite out-degree, in: Proc. FOCS'98, IEEE, New York, 1998.
15. J. Srba, Complexity of weak bisimilarity and regularity for BPA and BPP, Electronic Notes in Theoretical Computer Science (ENTCS), Vol. 39, Proc. Seventh Int. Workshop on Expressiveness in Concurrency (EXPRESS'00), 2000.
16. J. Srba Roadmap of infinite results Bull. Eur. Assoc. for Theoret. Comput. Sci. 78 2002 163 175 (Columns: Concurrency. Regularly updated online version at http://www.brics.dk/ ∼ srba/roadmap)
17. J. Srba Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard Proc. STACS 2002, Lecture Notes in Computer Science Vol. 2285 2002 Springer Berlin 535 546
18. J. Srba Strong bisimilarity and regularity of basic process algebra is PSPACE-hard Proc. ICALP 2002, Lecture Notes in Computer Science Vol. 2380 2002 Springer Berlin 716 727
19. J. Srba Undecidability of weak bisimilarity for pushdown processes Proc. CONCUR 2002, Lecture Notes in Computer Science Vol. 2421 2002 Springer Berlin 579 593
20. J. Srba Undecidability of weak bisimilarity for PA-processes Proc. Sixth Int. Conf. Developments in Language Theory (DLT'02), Lecture Notes in Computer Science Vol. 2450 2003 Springer Berlin 197 208
21. C. Stirling Decidability of bisimulation equivalence for normed pushdown processes Theoret. Comput. Sci. 195 1998 113 131
22. C. Stirling The joys of bisimulation Proc. MFCS'98, Lecture Notes in Computer Science Vol. 1450 1998 Springer Berlin 142 151
23. J. Sťíbrná Hardness results for weak bisimilarity of simple process algebras Electron. Notes Theoret. Comput. Sci. (ENTCS) 18 1998