Abstract
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any other models in the hierarchy of PRS (Process Rewrite Systems) whose branching bisimilarity is decidable. It is shown in this paper that the branching bisimilarity for both nOCN (normed One Counter Nets) and nPA (normed Process Algebras) is undecidable. These results essentially imply that the question has a negative answer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of Bisimulation Equivalence for Processes Generating Context-free Languages. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 94–111. Springer, Heidelberg (1987)
Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on Infinite Structures. In: Handbook of Process Algebra. Elsevier Science (2001)
Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation Equivalence is Decidable for Basic Parallel Processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 143–157. Springer, Heidelberg (1993)
Christensen, S., Hüttel, H., Stirling, C.: Bisimulation Equivalence is Decidable for all Context-free Processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 138–147. Springer, Heidelberg (1992)
Czerwiński, W., Hofman, P., Lasota, S.: Decidability of Branching Bisimulation on Normed Commutative Context-free Processes. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 528–542. Springer, Heidelberg (2011)
De Nicola, R., Montanari, U., Vaandrager, F.: Back and Forth Bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152–165. Springer, Heidelberg (1990)
Fu, Y.: Checking Equality and Regularity for Normed BPA with Silent Moves. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 238–249. Springer, Heidelberg (2013)
Hirshfeld, Y., Jerrum, M.: Bisimulation Equivanlence is Decidable for Normed Process Algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 412–421. Springer, Heidelberg (1999)
Jančar, P.: Undecidability of Bisimilarity for Petri Nets and Some Related Problems. Theoretical Computer Science 148, 281–301 (1995)
Jančar, P., Brics, J.S.: Highly Undecidable Questions for Process Algebras. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP, vol. 155, pp. 507–520. Springer, Boston (2004)
Jančar, P., Srba, J.: Undecidability of Bisimilarity by Defender’s Forcing. Journal of the ACM 55, 1–26 (2008)
Kučera, A., Jančar, P.: Equivalence-Checking on Infinite-State Systems: Techniques and Results. Theory and Practice of Logic Programming 6, 227–264 (2006)
Mayr, R.: Process Rewrite Systems. Information and Computation 156, 264–286 (2000)
Mayr, R.: Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 570–583. Springer, Heidelberg (2003)
Milner, R.: Communication and Concurrency. Prentice Hall (1989)
Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)
Srba, J.: Undecidability of Weak Bisimilarity for Pushdown Processes. In: Brim, L., Jančar, P., Křetínský, M., Kučera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 579–594. Springer, Heidelberg (2002)
Srba, J.: Roadmap of Infinite Results. EATCS 78, 163–175 (2002)
Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 197–208. Springer, Heidelberg (2003)
Srba, J.: Completeness Results for Undecidable Bisimilarity Problems. Electronic Notes in Computer Science 98, 5–19 (2004)
Stirling, C.: Decidability of Bisimulation Equivalence for Normed Pushdown Processes. Theoretical Computer Science 195, 113–131 (1998)
Stirling, C.: The Joys of Bisimulation. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 142–151. Springer, Heidelberg (1998)
Stirling, C.: Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 379–393. Springer, Heidelberg (2001)
van Glabbeek, R., Weijland, W.: Branching Time and Abstraction in Bisimulation Semantics. Journal of ACM 43, 555–600 (1996)
Yin, Q., Fu, Y., He, C., Huang, M., Tao, X.: Branching Bisimilarity Checking for PRS (2014), http://arxiv.org/abs/1402.0050
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, Q., Fu, Y., He, C., Huang, M., Tao, X. (2014). Branching Bisimilarity Checking for PRS. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-662-43951-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43950-0
Online ISBN: 978-3-662-43951-7
eBook Packages: Computer ScienceComputer Science (R0)