Aceto, LucaFrutos Escrig, David De2023-06-202023-06-202011-04-01Aceto, 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.0020-019010.1016/j.ipl.2011.01.015https://hdl.handle.net/20.500.14352/43728This 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.engjournal articlehttps//doi.org/10.1016/j.ipl.2011.01.015http://www.sciencedirect.com/science/article/pii/S002001901100024Xrestricted access004ConcurrencyProcess algebraComplete simulationReady simulationEquational logicNon-finitely based algebrasInformática (Informática)1203.17 Informática