Abstract
Weshow Σ 11 -completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show π 11 -hardness of weak ω-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).
Both authors are partly supported by the Grant Agency of the Czech Rep., grant No. 201/03/1161.
Basic Research in Computer Science, Centre of the Danish National Research Foundation.
Chapter PDF
Similar content being viewed by others
References
Büchi, J.R. (1964). Regular canonical systems. Arch. Math. Logik u. Grundlagenforschung, 6:91–111.
Burkart, O., Caucal, D., Moller, F., and Steffen, B. (2001). Verification on infinite structures. In Bergstra, J., Ponse, A., and Smolka, S., editors, Handbook of Process Algebra, chapter 9, pages 545–623. Elsevier Science.
Esparza, J. (1997). Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31:13–26.
Groote, J.F. and Hüttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation, 115(2):353–371.
Harel, D. (1986). Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. Journal of the ACM (JACM), 33(1):224–248.
Hirshfeld, Y. (1994). Deciding equivalences in simple process algebras. Tech. report ECS-LFCS-94-294, Dept. of Computer Science, University of Edinburgh.
Hüttel, H. (1994). Undecidable equivalences for basic parallel processes. In Proc. of TACS’94, volume 789 of LNCS, pages 454–464. Springer-Verlag.
Jančar, P. (2003). Strong bisimilarity on basic parallel processes is PSPACEcomplete. In Proc. of LICS’03, pages 218–227. IEEE Computer Society Press.
Jančar, P., Kučera, A., and Moller, F. (2003). Deciding bisimilarity between bpa and bpp processes. In Proc. of CONCUR’03, volume 2761 of LNCS, pages 159–173. Springer-Verlag.
Jančar, P. and Srba, J. (2004). Highly Undecidable questions for process algebras. Tech. Report RS-04-8, BRICS Research Series.
Kučera, A., and Jančar, P. (2002). Equivalence-checking with infinite-state systems: Techniques and results. In Proc. of SOFSEM’02, volume 2540 of LNCS, pages 41–73. Springer-Verlag.
Lugiez, D. and Schnoebelen, Ph. (2002). The regular viewpoint on pa-processes. Theoretical Computer Science, 274(1–2): 89–115.
Mayr, R. (2000). Process rewrite systems. Information and Computation, 156(1):264–286.
Mayr, R. (2003). Weak bisimilarity and regularity of BPA is EXPTIME-hard. In Proc. of EXPRESS’03, pages 160–143.
Rogers, H. (1967). Theory of Recursive Functions and Effective Computability. McGraw-Hill.
Srba, J. (2002). Roadmap of infinite results. Bulletin of the European Association for Theoretical Computer Science (Columns: Concurrency), 78:163–175. Updated online version:http://www.brics.dk/~srba/roadmap.
Srba, J. (2003a). Completeness results for undecidable bisimilarity problems. In Proc. of INFINITY’03, pages 9–22.
Srba, J. (2003b). Undecidability of weak bisimilarity for PA-processes. In Proc. of DLT’02, volume 2450 of LNCS, pages 197–208. Springer-Verlag.
van Glabbeek, R.J. (1993). The linear time-branching time spectrum II (the semantics of sequential systems with silent moves). In Proc. of CONCUR’ 93, volume 715 of LNCS, pages 66–81. Springer-Verlag.
van Glabbeek, R.J. (2001). The linear time-branching time spectrum I: The semantics of concrete, sequential processes. In Handbook of Process Algebra, chapter 1, pages 3–99. Elsevier Science.
van Glabbeek, R.J. and Weijland, W.P. (1996). Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555–600.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Jančar, P., Srba Brics, J. (2004). Highly Undecidable Questions for Process Algebras. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_39
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_39
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive