A Cancellation Theorem for BCCSP

Authors:
Luca Aceto;Wan Fokkink;Anna Ingolfsdottir
Affiliations:
Reykjavík University, School of Computer Science, Reykjavík, Iceland. luca@ru.is;(Correspd.) Department of Computer Science, Vrije Universiteit, Amsterdam, The Netherlands & Department of Software Engineering, CWI, Amsterdam, The Netherlands. wanf@cs.vu.nl;Reykjavík University, School of Computer Science, Reykjavík, Iceland. annai@ru.is
Venue:
Fundamenta Informaticae
Year:
2008

Citing 10
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
Communication and Concurrency

Communication and Concurrency
A New Strategy for Proving omega-Completeness applied to Process Algebra

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.