Bisimulations Up-to for the Linear Time Branching Time Spectrum



Downloads per month over past year

Frutos Escrig, David de and Gregorio Rodríguez, Carlos (2005) Bisimulations Up-to for the Linear Time Branching Time Spectrum. In CONCUR 2005 – Concurrency Theory : 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005. Proceedings. Lecture notes in computer science (3653). Springer, pp. 278-292. ISBN 978-3-540-28309-6

[thumbnail of Frutos15springer.pdf]

Official URL:


Coinductive definitions of semantics based on bisimulations have rather pleasant properties and are simple to use. In order to get coinductive characterisations of those semantic equivalences that are weaker than strong bisimulation we use a variant of the bisimulation up-to technique in which we allow the use of a given preorder relation. We prove that under some technical conditions our bisimulations up-to characterise the kernel of the given preorder. It is remarkable that the adequate orientation of the ordering relation is crucial to get this result. As a corollary, we get nice coinductive characterisations of all the axiomatic semantic equivalences in Van Glabbeek’s spectrum. Although we first prove our results for finite processes, reasoning by induction, then we see, by using continuity arguments, that they are also valid for infinite (finitary) processes.

Item Type:Book Section
Uncontrolled Keywords:Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.); Specification and verification (program logics, model checking, etc.)
Subjects:Sciences > Computer science
ID Code:20690
Deposited On:08 Apr 2013 11:07
Last Modified:10 Aug 2018 08:18

Origin of downloads

Repository Staff Only: item control page