Axiomatizing weak simulation semantics over BCCSP



Downloads per month over past year

Aceto, Luca and Frutos Escrig, David de and Gregorio Rodríguez, Carlos (2014) Axiomatizing weak simulation semantics over BCCSP. Theoretical computer science, 537 . pp. 42-71. ISSN 0304-3975

[thumbnail of DeFrutos150libre.pdf]

Official URL:


This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract from internal steps in process behaviours. In particular, the article focuses on the (pre)congruences associated with the weak simulation, the weak complete simulation and the weak ready simulation preorders. We present results on the (non)existence of finite (ground-)complete (in)equational axiomatizations for each of these behavioural semantics. The axiomatization of those semantics using conditional equations is also discussed in some detail.

Item Type:Article
Uncontrolled Keywords:Process algebra; Simulation semantics; Complete simulation semantics; Ready simulation semantics; Equational logic; Equational axiomatizations; Non-finitely based algebras
Subjects:Sciences > Computer science
ID Code:26667
Deposited On:10 Sep 2014 11:32
Last Modified:26 Nov 2014 09:33

Origin of downloads

Repository Staff Only: item control page