## A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces (1998)

Venue: | Mathematical Structures in Computer Science |

Citations: | 24 - 19 self |

### BibTeX

@INPROCEEDINGS{Aceto98amenagerie,

author = {Luca Aceto and Wan Fokkink and Anna Ingólfsdóttir},

title = {A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces},

booktitle = {Mathematical Structures in Computer Science},

year = {1998},

pages = {193--230}

}

### Years of Citing Articles

### OpenURL

### Abstract

Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ∗). In the light of this positive result on the mathematical tractability of bisimulation equivalence over BPA ∗ , a natural question to ask is whether any other (pre)congruence relation in van Glabbeek’s linear time/branching time spectrum is finitely (in)equationally axiomatizable over it. In this paper, we prove that, unlike bisimulation equivalence, none of the preorders and equivalences in van Glabbeek’s linear time/branching time spectrum, whose discriminating power lies in between that of ready simulation and that of completed traces, has a finite equational axiomatization. This we achieve by exhibiting a family of (in)equivalences that holds in ready simulation semantics, the finest semantics that we consider, whose instances cannot all be proven by means of any finite set of (in)equations