2026-06-01T01:49:27Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/179102025-09-12T16:13:35Zcom_20.500.14352_14col_20.500.14352_15
Trace simulation semantics is not finitely based over BCCSP
Aceto, Luca
Frutos Escrig, David De
Ingolfsdottir, Anna
519.216
Trace simulation preorder
Complete axiomatizations
BCCSP
Procesos estocásticos
1208.08 Procesos Estocásticos
This note shows that the trace simulation preorder does not have a finite inequational basis over the language BCCSP. Indeed, no collection of sound inequations of bounded depth is ground-complete with respect to the trace simulation preorder over BCCSP even over a singleton set of actions.
Sección Deptal. de Sistemas Informáticos y Computación
Fac. de Ciencias Matemáticas
TRUE
pub
2023-06-17T21:59:52Z
2023-06-17T21:59:52Z
2017
journal article
https://hdl.handle.net/20.500.14352/17910
0324-721X
10.14232/actacyb.23.1.2017.6
eng
Aceto, L, Frutos Escrig, D. & Ingolfsdottir, A. «Trace Simulation Semantics Is Not Finitely Based over BCCSP». Acta Cybernetica, vol. 23, n.o 1, 2017, pp. 81-90. DOI.org (Crossref), https://doi.org/10.14232/actacyb.23.1.2017.6.
restricted access
application/pdf
University of Szeged