Frutos Escrig, David DeGregorio Rodríguez, CarlosAusiello, GiorgioKarhumaki, JuhaniMauri, GiancarloOng, Luke2023-06-202023-06-202008Frutos 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.978-0-387-09679-710.1007/978-0-387-09680-3_27https://hdl.handle.net/20.500.14352/53225We 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.engbook parthttps//doi.org/10.1007/978-0-387-09680-3_27http://link.springer.com/content/pdf/10.1007%2F978-0-387-09680-3_27open access004Informática (Informática)1203.17 Informática