Universal Coinductive Characterisations of Process Semantics



Downloads per month over past year

Frutos Escrig, David de and Gregorio Rodríguez, Carlos (2008) Universal Coinductive Characterisations of Process Semantics. In Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 :. IFIP International Federation for Information Processing, Part I (273). Springer, pp. 397-412. ISBN 978-0-387-09679-7

[thumbnail of Frutos26springer.pdf]

Official URL: http://link.springer.com/content/pdf/10.1007%2F978-0-387-09680-3_27


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.

Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20749
Deposited On:10 Apr 2013 11:11
Last Modified:10 Aug 2018 08:15

Origin of downloads

Repository Staff Only: item control page