RT Journal Article
T1 Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
A1 Aceto, Luca
A1 Frutos Escrig, David De
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 (in)equational axiomatization either. These results are in contrast with a claim of finite axiomatizability for those semantics in the literature, which was based on the erroneous assumption that they coincide with complete trace semantics in the presence of a singleton set of actions.
PB Elsevier Science
SN 0020-0190
YR 2011
FD 2011-04-01
LK https://hdl.handle.net/20.500.14352/43728
UL https://hdl.handle.net/20.500.14352/43728
LA eng
NO Aceto, L. & Frutos Escrig, D. «Complete and Ready Simulation Semantics Are Not Finitely Based over BCCSP, Even with a Singleton Alphabet». Information Processing Letters, vol. 111, n.o 9, abril de 2011, pp. 408-13. DOI.org (Crossref), https://doi.org/10.1016/j.ipl.2011.01.015.
NO Icelandic Fund for Research
DS Docta Complutense
RD 7 abr 2025