Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Equational Theory of Weak Complete Simulation Semantics over BCCSP
 

Summary: The Equational Theory of Weak Complete
Simulation Semantics over BCCSP
Luca Aceto1,3, David de Frutos-Escrig2,3, Carlos Gregorio-Rodríguez2,3, and
Anna Ingólfsdóttir1,3
1 ICE-TCS, School of Computer Science, Reykjavik University, Iceland
2 Departamento de Sistemas Informáticos y Computación,
Universidad Complutense de Madrid, Spain
3 Abel Extraordinary Chair (Universidad Complutense-Reykjavik University)
Abstract. This paper presents a complete account of positive and nega-
tive results on the finite axiomatizability of weak complete simulation se-
mantics over the language BCCSP. We offer finite (un)conditional ground-
complete axiomatizations for the weak complete simulation precongru-
ence. In sharp contrast to this positive result, we prove that, in the pres-
ence 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 Introduction

  

Source: Aceto, Luca - School of Computer Science, Reykjavík University

 

Collections: Mathematics; Computer Technologies and Information Sciences