%0 Journal Article
%A Aceto, Luca
%A Frutos Escrig, David De
%A Ingolfsdottir, Anna
%T Trace simulation semantics is not finitely based over BCCSP
%D 2017
%@ 0324721X
%U https://hdl.handle.net/20.500.14352/17910
%X 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.
%~