Trace simulation semantics is not finitely based over BCCSP
- Aceto, L.
- Frutos Escrig, David de
- Ingolfsdottir, Anna
DOIAbstract
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ónFac. de Ciencias MatemáticasTRUEpu
Add to ORKG