Abstract This paper confirms a conjecture of Bergstra and Klop¿s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner¿s Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy¿s merge cannot replace the left merge and communication merge operators proposed by Bergstra and Klop, at least if a finite axiomatization of parallel composition is desired. 2000 MATHEMATICS SUBJECT CLASSIFICATION: 08A70, 03B45, 03C05, 68Q10, 68Q45, 68Q55, 68Q70. CR SUBJECT CLASSIFICATION (1991): D.3.1, F.1.1, F.1.2, F.3.2, F.3.4, F.4.1. KEYWORDS AND PHRASES: Concurrency, process algebra, CCS, bisimulation, Henne...
In this paper we investigate the equational theory of (the restriction, relabelling, and recursion f...
Using the left merge and communication merge from ACP, we present an equational base for the fragmen...
AbstractThis essay recounts the story of the quest for equational axiomatizations of parallel compos...
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process a...
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process a...
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process a...
AbstractThis paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the p...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS e...
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS e...
This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity ov...
In this paper we investigate the equational theory of (the restriction, relabelling, and recursion f...
Using the left merge and communication merge from ACP, we present an equational base for the fragmen...
AbstractThis essay recounts the story of the quest for equational axiomatizations of parallel compos...
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process a...
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process a...
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process a...
AbstractThis paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the p...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS e...
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS e...
This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity ov...
In this paper we investigate the equational theory of (the restriction, relabelling, and recursion f...
Using the left merge and communication merge from ACP, we present an equational base for the fragmen...
AbstractThis essay recounts the story of the quest for equational axiomatizations of parallel compos...