RT Book, Section
T1 Universal Coinductive Characterisations of Process Semantics
A1 Frutos Escrig, David De
A1 Gregorio Rodríguez, Carlos
A2 Ausiello, Giorgio
A2 Karhumaki, Juhani
A2 Mauri, Giancarlo
A2 Ong, Luke
AB We present a theoretical framework which allows to define in a uniform way coinductive characterisations of nearly any semantic preorder or equivalence between processes, by means of simulations up-to and bisimulations up-to. In particular, all the semantics in the linear time-branching time spectrum are covered. Constrained simulations, that generalise plain simulations by including a constraint that all the pairs of related processes must satisfy, are the key to obtain such a general framework. We provide a simple axiomatisation of any constrained simulation preorder and also for the corresponding equivalence. These axiomatizations allow us to prove in a uniform way that each constrained simulation preorder (equivalence) defines a class of process preorders (equivalences) which share commons properties, like the possibility of giving coinductive characterisations for all of them, or the existence of a canonical preorder inducing each of these equivalences.
PB Springer
SN 978-0-387-09679-7
YR 2008
FD 2008
LK https://hdl.handle.net/20.500.14352/53225
UL https://hdl.handle.net/20.500.14352/53225
LA eng
NO Frutos Escrig, D. & Gregorio Rodríguez, C.  «Universal Coinductive Characterisations of Process Semantics». Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008, editado por Giorgio Ausiello et al., vol. 273, Springer US, 2008, pp. 397-412. DOI.org (Crossref), https://doi.org/10.1007/978-0-387-09680-3_27.
NO Ministerio de Educación, Formación Profesional y Deportes (España)
DS Docta Complutense
RD 17 dic 2025