Universidad Complutense de Madrid
E-Prints Complutense

The equational theory of weak complete simulation semantics over BCCSP

Impacto

Downloads

Downloads per month over past year

Aceto, Luca and Frutos Escrig, David de and Gregorio Rodríguez, Carlos and Ingolfsdottir, Anna (2012) The equational theory of weak complete simulation semantics over BCCSP. In SOFSEM 2012: Theory and Practice of Computer Science : 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings. Lecture notes in computer science (7147). Springer, pp. 141-152. ISBN 978-3-642-27659-0

[img] PDF
Restringido a Repository staff only

202kB

Official URL: http://link.springer.com/content/pdf/10.1007%2F978-3-642-27660-6_12


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


Abstract

This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equational theory of the weak complete simulation precongruence over BCCSP does not have a finite (in)equational basis. In fact, the set of (in)equations in at most one variable that hold in weak complete simulation semantics over BCCSP does not have an (in)equational basis of ‘bounded depth’, let alone a finite one.


Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20794
Deposited On:12 Apr 2013 09:24
Last Modified:02 Aug 2018 07:38

Origin of downloads

Repository Staff Only: item control page