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
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Algebraic theory of processes
The equational theory of pomsets
Theoretical Computer Science
Axiomatising finite concurrent processes
SIAM Journal on Computing
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
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
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
Communication and Concurrency
Introduction to Process Algebra
Introduction to Process Algebra
Process Algebra with Timing
The Importance of the Left Merge Operator in Process Algebras
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Series and Parallel Operations on Pomsets
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Comparison of Additivity Axioms in Timed Transition Systems.
A Comparison of Additivity Axioms in Timed Transition Systems.
Varieties generated by languages with poset operations
Mathematical Structures in Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
A brief history of process algebra
Theoretical Computer Science - Process algebra
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
Impossibility results for the equational theory of timed CCS
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
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
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Hi-index | 0.00 |
This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCS-like languages. It focuses, in particular, on non-finite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice. The paper also highlights the role that auxiliary operators, such as Bergstra and Klop's left and communication merge and Hennessy's merge operator, play in the search for a finite, equational axiomatization of parallel composition both for classic process algebras and for their real-time extensions.