Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
A new strategy for proving &ohgr;-completeness applied to process algebra
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Communication and Concurrency
Mathematical Structures in Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
On finite alphabets and infinite bases
Information and Computation
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hi-index | 0.00 |
This paper presents a cancellation theorem for the preorders in van Glabbeek's linear time-branching time spectrum over BCCSP. Apart from having some intrinsic interest, the proven cancellation result plays a crucial role in the study of the cover equations, in the sense of Fokkink and Nain, that characterize the studied semantics. The techniques used in the proof of the cancellation theorem may also have some independent interest.