Aceto, LucaFrutos Escrig, David DeGregorio Rodríguez, Carlos2023-06-192023-06-192014-06-05Aceto, 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.0304-397510.1016/j.tcs.2013.03.013https://hdl.handle.net/20.500.14352/33637This 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.engjournal articlehttps//doi.org/10.1016/j.tcs.2013.03.013http://www.researchgate.net/publication/220933255_Axiomatizing_Weak_Ready_Simulation_Semantics_over_BCCSP/file/79e41509c05ea33919.pdfhttp://www.sciencedirect.com/science/article/pii/S0304397513002144open access004Process algebraSimulation semanticsComplete simulation semanticsReady simulation semanticsEquational logicEquational axiomatizationsNon-finitely based algebrasInformática (Informática)1203.17 Informática