Aceto, LucaFrutos Escrig, David DeIngolfsdottir, Anna2023-06-172023-06-172017Aceto, 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.0324721X10.14232/actacyb.23.1.2017.6https://hdl.handle.net/20.500.14352/17910This 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.engTrace simulation semantics is not finitely based over BCCSPjournal articlehttps//doi.org/10.14232/actacyb.23.1.2017.6https://www.inf.u-szeged.hu/actacybernetica/edb/vol23n1/actacyb_23_1_2017_6.xmlrestricted access519.216Trace simulation preorderComplete axiomatizationsBCCSPProcesos estocásticos1208.08 Procesos Estocásticos