DMCA
The equational theory of weak complete simulation semantics over BCCSP (2012)
| Venue: | SOFSEM 2012: Theory and Practice of Computer Science, 38th Conference on Current Trends in Theory and Practice of Computer Science |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Aceto12theequational,
author = {Luca Aceto and David De Frutos-escrig and Carlos Gregorio-rodríguez and Anna Ingólfsdóttir},
title = {The equational theory of weak complete simulation semantics over BCCSP},
booktitle = {SOFSEM 2012: Theory and Practice of Computer Science, 38th Conference on Current Trends in Theory and Practice of Computer Science},
year = {2012},
pages = {141--152},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 groundcomplete 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 collection 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. 1
Keyphrases
weak complete simulation semantics equational theory equational basis weak complete simulation precongruence finite axiomatizability bounded depth conditional groundcomplete axiomatizations sharp contrast observable action complete account positive result negative result language bccsp finite one
