RT Journal Article
T1 Trace simulation semantics is not finitely based over BCCSP
A1 Aceto, Luca
A1 Frutos Escrig, David De
A1 Ingolfsdottir, Anna
AB 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.
PB University of Szeged
SN 0324721X
YR 2017
FD 2017
LK https://hdl.handle.net/20.500.14352/17910
UL https://hdl.handle.net/20.500.14352/17910
LA eng
NO 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.
DS Docta Complutense
RD 13 abr 2025