## Undecidable Equivalences for Basic Parallel Processes (1993)

Venue: | 13th Conference on Foundations of Software Technology and Theoretical Computer Science |

Citations: | 25 - 2 self |

### BibTeX

@INPROCEEDINGS{Hüttel93undecidableequivalences,

author = {Hans Hüttel},

title = {Undecidable Equivalences for Basic Parallel Processes},

booktitle = {13th Conference on Foundations of Software Technology and Theoretical Computer Science},

year = {1993},

pages = {454--464},

publisher = {Springer-Verlag}

}

### OpenURL

### 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. 1 Introduction Much attention has been devoted to the study of process calculi and in particular to behavioural semantics for these calculi. In order to capture the behavioural aspects of processes, a variety of equivalences have been proposed. Various criteria exist for comparing the merits and deficiencies of these equivalences. A systematic approach consists of classifying the equivalences according to their coarseness. For this purpose van Glabbeek proposed the linear/branching time spectrum which is illustrated in Figure 1 [12]. The least discriminating equivalences are at the bottom of the diagram. Arrows i...