Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Algebraic theory of processes
The equational theory of pomsets
Theoretical Computer Science
Communication and concurrency
Axiomatising finite concurrent processes
SIAM Journal on Computing
The importance of the left merge operator in process algebras
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Process algebra
A new strategy for proving &ohgr;-completeness applied to process algebra
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Unique decomposition of processes
Theoretical Computer Science
On "Axiomatising Finite Concurrent Processes"
SIAM Journal on Computing
Turning SOS rules into equations
Information and Computation
Free shuffle algebras in language varieties
Theoretical Computer Science
Axiomatizing shuffle and concatenation in languages
Information and Computation
Journal of the ACM (JACM)
Formal verification of parallel programs
Communications of the ACM
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
Axiomatizing GSOS with Termination
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Nonfinite Axiomatizability of Shuffle Inequalities
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
CONCUR '94 Proceedings of the Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Varieties generated by languages with poset operations
Mathematical Structures in Computer Science
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
On the axiomatisability of priority
Mathematical Structures in Computer Science
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
On the axiomatizability of priority
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A finite equational base for CCS with left merge and communication merge
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Rule formats for distributivity
Theoretical Computer Science
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
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 Communicating 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 modulo bisimulation equivalence is desired.