Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Partial evaluation and &ohgr;-completeness of algebraic specifications
Theoretical Computer Science
Algebraic theory of processes
The equational theory of pomsets
Theoretical Computer Science
Axiomatising finite concurrent processes
SIAM Journal on Computing
Process algebra
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A new strategy for proving &ohgr;-completeness applied to process algebra
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Which data types have &ohgr;-complete initial algebra specifications?
Theoretical Computer Science
Formal verification of parallel programs
Communications of the ACM
Communication and Concurrency
Introduction to Process Algebra
Introduction to Process Algebra
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
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
An Interactive Proof Tool for Process Algebras
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Series and Parallel Operations on Pomsets
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The max-plus algebra of the natural numbers has no finite equational basis
Theoretical Computer Science
Mathematical Structures in Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
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
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
On finite alphabets and infinite bases
Information and Computation
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
Ready to preorder: The case of weak process semantics
Information Processing Letters
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
A distribution law for CCS and a new congruence result for the π-calculus
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Information Processing Letters
Rule formats for distributivity
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
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
On finite alphabets and infinite bases III: simulation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The equational theory of weak complete simulation semantics over BCCSP
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
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
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. Obtaining such axiomatizations in concurrency theory often turns out to be difficult, even in the setting of simple languages like BCCSP. This has raised a host of open questions that have been the subject of intensive research in recent years. Most of these questions have been settled over BCCSP, either positively by giving a finite complete axiomatization, or negatively by proving that such an axiomatization does not exist. Still some open questions remain. This paper reports on these results, and on the state-of-the-art in axiomatizations for richer process algebras with constructs like sequential and parallel composition.