论文信息 - A Cancellation Theorem for BCCSP

A Cancellation Theorem for BCCSP

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.

[1] Bas Luttik,et al. On finite alphabets and infinite bases , 2008, Inf. Comput..

[2] Luca Aceto,et al. Ready to Preorder: Get Your BCCSP Axiomatization for Free! , 2007, CALCO.

[3] Wan Fokkink,et al. On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces , 2003, ICALP.

[4] Jan Friso Groote. A New Strategy for Proving omega-Completeness applied to Process Algebra , 1990, CONCUR.

[5] Wan Fokkink,et al. A Finite Basis for Failure Semantics , 2005, ICALP.

[6] Faron Moller,et al. Axioms for concurrency , 1989 .

[7] Luca Aceto,et al. A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces , 1998, Mathematical Structures in Computer Science.

[8] Wan Fokkink,et al. On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds , 2004, FoSSaCS.

[9] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[10] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[11] J. Bergstra,et al. Fixed point semantics in process algebras : (preprint) , 1982 .

[12] R. V. Glabbeek. The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

[13] Luca Aceto,et al. Nested Semantics over Finite Trees are Equationally Hard: Invited Talk , 2003, EXPRESS.

[14] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.