Axiomatizing weak simulation semantics over BCCSP

Thumbnail Image
Download
downoloadDeFrutos150libre.pdf (330.2 KB)
Official URL
https//doi.org/10.1016/j.tcs.2013.03.013
Full text at PDC
Publication date

2014

Authors
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Citations
Google Scholar
Exportar
DC QDC MarcXML RDF MODS METS ORE-ATOM
URI
https://hdl.handle.net/20.500.14352/33637
Citation
Aceto, L., Frutos Escrig, D. & Gregorio Rodríguez, C. «Axiomatizing Weak Simulation Semantics over BCCSP». Theoretical Computer Science, vol. 537, junio de 2014, pp. 42-71. DOI.org (Crossref), https://doi.org/10.1016/j.tcs.2013.03.013.
Abstract
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract 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. We present results on the (non)existence of finite (ground-)complete (in)equational axiomatizations for each of these behavioural semantics. The axiomatization of those semantics using conditional equations is also discussed in some detail.
Research Projects
Organizational Units
Journal Issue
Description
UCM subjects
Informática (Informática)
Unesco subjects
1203.17 Informática
Keywords
Collections
Artículos