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.
Cite
CITATION STYLE
Hüttel, H. (1994). Undecidable equivalences for basic parallel processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 789 LNCS, pp. 454–464). Springer Verlag. https://doi.org/10.1007/3-540-57887-0_110
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
