Trace simulation semantics is not finitely based over BCCSP
AbstractThis 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.
How to Cite
Aceto, L., Escrig, D. de F., & Ingólfsdóttir, A. (2017). Trace simulation semantics is not finitely based over BCCSP. Acta Cybernetica, 23(1), 81-90. https://doi.org/10.14232/actacyb.23.1.2017.6