Strong bisimilarity of simple process algebras: Complexity lower bounds

Acta Informatica

Volumn 39, Issue 6-7, 2003, Pages 469-499

  Srba, Jiří ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DECISION THEORY; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

REGULARITY ANALYSIS;

COMPUTATIONAL COMPLEXITY;

EID: 0038493871     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-003-0116-9     Document Type: Article

References (35)

1. J. Balcazar, J. Gabarro, M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A): 638-648, 1992
2. J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37: 77-121, 1985
3. O. Burkart, D. Caucal, F. Moller, B. Steffen. Verification on infinite structures. In J. Bergstra, A. Ponse, S. Smolka, editors, Handbook of Process Algebra, Chapter 9, pages 545-623. Amsterdam: Elsevier Science, 2001
4. O. Burkart, D. Caucal, B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science (MFCS'95), volume 969 of LNCS, pages 423-433. Berlin Heidelberg New York: Springer, 1995
5. O. Burkart, D. Caucal, B. Steffen, Bisimulation collapse and the process taxonomy. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR'96), volume 1119 of LNCS, pages 247-262. Berlin Heidelberg New York: Springer, 1996
6. D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1): 61-86, 1992
7. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993
8. S. Christensen, Y. Hirshfeld, F. Moller. Bisimulation is decidable for basic parallel processes. In Proceedings of the 4th International Conference on Concurrency Theory (CONCUR'93), volume 715 of LNCS, pages 143-157. Berlin Heidelberg New York: Springer, 1993
9. S. Christensen, H. Hüttel, C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121: 143-148, 1995
10. Y. Hirshfeld and M. Jerrum. Bisimulation equivalence is decidable for normed process algebra. In Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of LNCS, pages 412-421. Berlin Heidelberg New York: Springer, 1999
11. Y. Hirshfeld, M. Jerrum, F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science, 158 (1-2): 143-159, 1996
12. Y. Hirshfeld, M. Jerrum, F. Moller. A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes. Mathematical Structures in Computer Science, 6 (3): 251-259, 1996
13. J.E. Hopcroft, J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979
14. H. Hüttel. Undecidable equivalences for basic parallel processes. In Proceedings of the 2nd International Symposium on Theoretical Aspects of Computer Software (TACS'94), volume 789 of LNCS, pages 454-464. Berlin Heidelberg New York: Springer, 1994
15. P. Jančar. High undecidability of weak bisimilarity for Petri nets. In Proceedings of Colloquium on Trees in Algebra and Programming (CAAP'95), volume 915 of LNCS, pages 349-363. Berlin Heidelberg New York: Springer, 1995
16. P. Jančar. New results for bisimilarity on basic parallel processes. In Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (INFINITY'02), page 153. Technical report, Faculty of Informatics, Masaryk University Brno, FTMU-RS-2002-04, 2002. Short presentation
17. P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimulation. In Proceedings of 23rd International Colloquium on Automata, Languages, and Programming (ICALP'96), volume 1099 of LNCS, pages 478-489. Berlin Heidelberg New York: Springer, 1996
18. Lalita Jategaonkar and Albert R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154(1): 107-143, 1996
19. A. Kučera. Regularity is decidable for normed BPA and normed BPP processes in polynomial time. In Proceedings of the 23th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'96), volume 1175 of LNCS, pages 377-384, Berlin Heidelberg New York: Springer, 1996
20. A. Kučera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of the 16th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), volume 1180 of LNCS, pages 111-122. Berlin Heidelberg New York: Springer, 1996
21. R. Mayr. On the complexity of bisimulation problems for basic parallel processes. In Proceedings of 27st International Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of LNCS, pages 329-341. Berlin Heidelberg New York: Springer, 2000
22. R. Mayr. Process rewrite systems. Information and Computation, 156 (1): 264-286, 2000
23. R. Milner. Communication and Concurrency. Englewood Cliffs, NJ: Prentice-Hall, 1989
24. F. Moller. Infinite results. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR'96), volume 1119 of LNCS, pages 195-216. Berlin Heidelberg New York: Springer, 1996
25. Ch.H. Papadimitriou. Computational Complexity. New York: Addison-Wesley, 1994
26. D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI Conference, volume 104 of LNCS, pages 167-183. Berlin Heidelberg New York: Springer, 1981
27. G. Plotkin. A structural approach to operational semantics. Technical Report Daimi FN-19, Department of Computer Science, University of Aarhus, 1981
28. J. Srba. Basic process algebra with deadlocking states. Theoretical Computer Science, 266 (1-2): 605-630, 2001
29. J. Srba. Roadmap of infinite results. Bulletin of the European Association for Theoretical Computer Science, 78:163-175, October 2002. Columns: Concurrency
30. J. Srba. Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS'02), volume 2285 of LNCS, pages 535-546. Berlin Heidelberg New York: Springer, 2002
31. J. Srba. Strong bisimilarity and regularity of basic process algebra is PSPACE-hard. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP'02), volume 2380 of LNCS, pages 716-727. Berlin Heidelberg New York: Springer, 2002
32. C. Stirling. Local model checking games. In Proceedings of the 6th International Conference on Concurrency Theory (CONCUR '95), volume 962 of LNCS, pages 1-11. Berlin Heidelberg New York: Springer, 1995
33. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract). In Proceedings of the 4th International Joint Conference CAAP/FASE, Theory and Practice of Software Development (TAPSOFT'93), volume 668 of LNCS, pages 559-568. Berlin Heidelberg New York: Springer, 1993
34. R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, CWI/Vrije Universiteit, 1990
35. R.J. van Glabbeek. The linear time - branching time spectrum. In Proceedings of the 1st Internatinal Conference on Theories of Concurrency: Unification and Extension (CONCUR'90), volume 458 of LNCS, pages 278-297. Berlin Heidelberg New York: Springer, 1990