Universidad Complutense de Madrid
E-Prints Complutense

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

Impacto

Downloads

Downloads per month over past year

Aceto, Luca and Frutos Escrig, David de (2011) Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet. Information processing letters, 111 (9). pp. 408-413. ISSN 0020-0190

[img] PDF
Restringido a Repository staff only

147kB

Official URL: http://www.sciencedirect.com/science/article/pii/S002001901100024X


URLURL Type
http://www.sciencedirect.com/Publisher


Abstract

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.


Item Type:Article
Uncontrolled Keywords:Concurrency; Process algebra; Complete simulation; Ready simulation; Equational logic; Non-finitely based algebras
Subjects:Sciences > Computer science
ID Code:20634
Deposited On:03 Apr 2013 11:55
Last Modified:02 Aug 2018 07:36

Origin of downloads

Repository Staff Only: item control page