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 Ready Simulation Semantics over BCCSP
 

Summary: Axiomatizing Weak Ready Simulation Semantics
over BCCSP
Luca Aceto1,3, David de Frutos Escrig2,3, Carlos Gregorio-Rodríguez2,3, and
Anna Ingolfsdottir1,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. Ready simulation has proven to be one of the most significant
semantics in process theory. It is at the heart of a number of general results
that pave the way to a comprehensive understanding of the spectrum
of process semantics. Since its original definition by Bloom, Istrail and
Meyer in 1995, several authors have proposed generalizations of ready
simulation to deal with internal actions. However, a thorough study of
the (non-)existence of finite (in)equational bases for weak ready simula-
tion semantics is still missing in the literature. This paper presents a com-
plete account of positive and negative results on the axiomatizability of
weak ready simulation semantics over the language BCCSP. In addition,
this study offers a thorough analysis of the axiomatizability properties of
weak simulation semantics.

  

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

 

Collections: Mathematics; Computer Technologies and Information Sciences