|
Título:
|
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
|
|
Autores:
|
Aceto, Luca ;
Frutos Escrig, David de
|
|
Tipo de documento:
|
texto impreso
|
|
Editorial:
|
Elsevier Science, 2011-04-01
|
|
Dimensiones:
|
application/pdf
|
|
Nota general:
|
info:eu-repo/semantics/restrictedAccess
|
|
Idiomas:
|
|
|
Palabras clave:
|
Estado = Publicado
,
Materia = Ciencias: Informática
,
Tipo = Artículo
|
|
Resumen:
|
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.
|
|
En línea:
|
https://eprints.ucm.es/id/eprint/20634/1/Frutos04elsevier.pdf
|
