Trace simulation semantics is not finitely based over BCCSP



Downloads per month over past year

Aceto, L. and Frutos Escrig, David de and Ingolfsdottir, Anna (2017) Trace simulation semantics is not finitely based over BCCSP. Acta Cybernetica, 23 (1). pp. 81-90. ISSN 0324721X

[thumbnail of Frutos52.pdf] PDF
Restringido a Repository staff only


Official URL:


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.

Item Type:Article
Uncontrolled Keywords:Trace simulation preorder; Complete axiomatizations; BCCSP
Subjects:Sciences > Mathematics > Stochastic processes
ID Code:43810
Deposited On:11 Jul 2017 08:12
Last Modified:11 Jul 2017 08:12

Origin of downloads

Repository Staff Only: item control page