TY  - JOUR
AU  - Aceto, Luca
AU  - Frutos Escrig, David De
PY  - 2011
DO  - 10.1016/j.ipl.2011.01.015
SN  - 0020-0190
UR  - https://hdl.handle.net/20.500.14352/43728
T2  - Information processing letters
AB  - This note shows that the complete and the ready simulation preorders do not have a finite inequational basis over the language BCCSP when the set of actions is a singleton. Moreover, the equivalences induced by those preorders do not have a finite...
LA  - eng
M2  - 408
PB  - Elsevier Science
KW  - Concurrency
KW  - Process algebra
KW  - Complete simulation
KW  - Ready simulation
KW  - Equational logic
KW  - Non-finitely based algebras
TI  - Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
TY  - journal article
VL  - 111
ER  -