Abstract
Recent results show that strong bisimilarity is decidable for the class of Basic Parallel Processes (BPP), which corresponds to the subset of CCS definable using recursion, action prefixing, nondeterminism and the full merge operator. In this paper we examine all other equivalences in the linear/branching time hierarchy [12] and show that none of them are decidable for BPP.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bergstra and J.W. Klop Process algebra for synchronous communication Information and Computation, 60:109–137, 1984.
J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Proceedings PARLE conference, Eindhoven, Vol. II (Parallel Languages), volume 259 of Lecture Notes in Computer Science, pages 94–113. Springer-Verlag, 1987.
J.A. Bergstra, J.W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating processes. SIAM J. on Comput., 17:1134–1177, 1988.
B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Technical Report 90-1150, Department of Computer Science, Cornell University, Ithaca, New York, August 1990.
S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. JACM, 31:560–599, 1984.
D. Caucal. Graphes canoniques de graphes algébriques. Theoretical Informatics and Applications 24:339–352, 1990.
S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, University of Edinburgh 1993.
S. Christensen, Y. Hirshfeld, and F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In Proceedings of LICS '93. IEEE, Computer Society Press, June 1993.
S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR '93. Springer-Verlag, 1993.
S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In W.R. Cleaveland, editor, Proceedings of CONCUR '92, LNCS 630, pages 138–147. Springer-Verlag, August 1992.
E.P. Friedman. The inclusion problem for simple languages. Theoretical Computer Science, 1:297–316, 1976.
R.J. van Glabbeek. The linear time — branching time spectrum. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of LNCS, pages 278–297. Springer-Verlag, 1990.
J.F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 1993. to appear.
J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence (extended abstract). In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Del la Rocca, editors, Proceedings of ICALP89, volume 372 of LNCS, pages 423-438. Springer-Verlag, 1989. Full version to appear in Information and Computation.
M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, Massachusetts, 1988.
Y. Hirshfeld. Finitely Generated Processes, Petri Nets and the Equivalence Problem To appear at Computer Science Logic '93.
J. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
H. Hüttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings 6th Annual Symposium on Logic in Computer Science, Amsterdam, The Netherlands, pages 376–386. IEEE Computer Society Press, 1991.
H. Hüttel. Dedidability, Behavioural Equivalences and Infinite Transition Graphs Ph.D. thesis. Report ECS-LFCS-91-191, University of Edinburgh, 1991.
D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.
P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43–68, 1990.
A.J. Korenjak and J.E. Hopcroft Simple Deterministic Languages In Proc. Seventh Annual IEEE Symposium on Switching and Automata Theory, pages 36–46, 1966.
K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Proceedings 16th ACM Symposium on Principles of Programming Languages, Austin, Texas, pages 344–352, 1989.
Milner, R. A Calculus of Communicating Systems Springer-Verlag LNCS 92, 1980.
Milner, R. Communication and Concurrency Prentice-Hall International 1989.
Minsky, M.L. Computation: Finite and Infinite Machines Prentice-Hall International 1967
E.-R. Olderog and C.A.R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23:9–66, 1986.
D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proceedings 5th GI Conference LNCS 104, pages 167–183. Springer, 1981.
I.C.C. Philips. Refusal testing. Theoretical Computer Science, 50:241–284, 1987.
W.S. Rounds and S.D. Brookes. Possible futures, acceptances, refusals and communicating processes. In Proc. 22nd Annual Symposium on Foundations of Computer Science, pages 140–149, New York, 1981. IEEE.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hüttel, H. (1994). Undecidable equivalences for basic parallel processes. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_110
Download citation
DOI: https://doi.org/10.1007/3-540-57887-0_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57887-1
Online ISBN: 978-3-540-48383-0
eBook Packages: Springer Book Archive