2026-08-23T03:42:59Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/454322024-07-10T15:55:26Zcom_20.500.14352_14col_20.500.14352_21
Docta Complutense
author
Aceto, Luca
author
Frutos Escrig, David De
author
Gregorio Rodríguez, Carlos
author
Ingolfsdottir, Anna
editor
Bieliková, Mária
2023-06-20T05:45:09Z
2023-06-20T05:45:09Z
2012
Aceto, L. Frutos Escrig, D., Gregorio Rodríguez, C. & Ingolfsdottir, A. «The Equational Theory of Weak Complete Simulation Semantics over BCCSP». SOFSEM 2012: Theory and Practice of Computer Science, editado por Mária Bieliková et al., vol. 7147, Springer Berlin Heidelberg, 2012, pp. 141-52. DOI.org (Crossref), https://doi.org/10.1007/978-3-642-27660-6_12.
978-3-642-27659-0
10.1007/978-3-642-27660-6_12
https://hdl.handle.net/20.500.14352/45432
https//doi.org/10.1007/978-3-642-27660-6_12
http://link.springer.com/content/pdf/10.1007%2F978-3-642-27660-6_12
This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equational theory of the weak complete simulation precongruence over BCCSP does not have a finite (in)equational basis. In fact, the set of (in)equations in at most one variable that hold in weak complete simulation semantics over BCCSP does not have an (in)equational basis of ‘bounded depth’, let alone a finite one.
eng
The equational theory of weak complete simulation semantics over BCCSP
book part
URL
https://docta.ucm.es/bitstreams/1ccbe5d9-0aab-44d9-876f-db09f953b757/download
File
MD5
71e370015e7c29488f613b0d716acaa7
202256
application/pdf
Frutos38springer.pdf