RT Journal Article
T1 Axiomatizing weak simulation semantics over BCCSP
A1 Aceto, Luca
A1 Frutos Escrig, David De
A1 Gregorio Rodríguez, Carlos
AB 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.
PB Elsevier
SN 0304-3975
YR 2014
FD 2014-06-05
LK https://hdl.handle.net/20.500.14352/33637
UL https://hdl.handle.net/20.500.14352/33637
LA eng
NO Aceto, L., Frutos Escrig, D. & Gregorio Rodríguez, C. «Axiomatizing Weak Simulation Semantics over BCCSP». Theoretical Computer Science, vol. 537, junio de 2014, pp. 42-71. DOI.org (Crossref), https://doi.org/10.1016/j.tcs.2013.03.013.
NO Comunidad de Madrid
NO Ministerio de Ciencia, Innovación y Universidades (España)
NO Ministerio de Educación, Formación Profesional y Deportes (España)
NO Icelandic Fund for Research
NO NILS Mobility Project
NO IMT Lucca Institute for Advanced Studies (Italy)
DS Docta Complutense
RD 27 jul 2024