Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Axiomatizing Weak Simulation Semantics Luca Aceto1,3, David de Frutos Escrig2,3, Carlos
 

Summary: Axiomatizing Weak Simulation Semantics
over BCCSP
Luca Aceto1,3, David de Frutos Escrig2,3, Carlos
Gregorio-RodrŽiguez2,3, and Anna Ingolfsdottir1,3
1 ICE-TCS, School of Computer Science, Reykjavik University, Iceland
2 Departamento de Sistemas InformŽaticos y ComputaciŽon,
Universidad Complutense de Madrid, Spain
3 Abel Extraordinary Chair (Universidad Complutense-Reykjavik University)
Abstract. This paper is devoted to the study of the (in)equational the-
ory of the largest (pre)congruences over the language BCCSP induced
by variations on the classic simulation preorder and equivalence that ab-
stract from internal steps in process behaviours. In particular, the article
focuses on the (pre)congruences associated with the weak simulation, the
weak complete simulation and the weak ready simulation preorders. For
each of these behavioural semantics, results on the (non)existence of finite
(ground-)complete (in)equational axiomatizations are given. The axiom-
atization of those semantics using conditional equations is also discussed
in some detail.
1 Introduction
Process algebras, such as ACP [11, 13], CCS [39] and CSP [31], are

  

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

 

Collections: Mathematics; Computer Technologies and Information Sciences