A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Partial evaluation and &ohgr;-completeness of algebraic specifications
Theoretical Computer Science
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Tools for proving inductive equalities, relative completeness, and &ohgr;-completeness
Information and Computation
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
Axiomatizing prefix iteration with silent steps
Information and Computation
Communication and Concurrency
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
Mathematical Structures in Computer Science
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On finite alphabets and infinite bases
Information and Computation
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
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 finite alphabets and infinite bases II: completed and ready simulation
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On finite alphabets and infinite bases III: simulation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
| Hi-index | 0.00 |
We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12] .