Bisimilarity congruences for open terms and term graphs via tile logic



Downloads per month over past year

Bruni, Roberto and Frutos Escrig, David de and Martí Oliet, Narciso and Montanari, Ugo (2000) Bisimilarity congruences for open terms and term graphs via tile logic. In CONCUR 2000 — Concurrency Theory : 11th International Conference University Park, PA, USA, August 22–25, 2000 Proceedings. Lecture notes in computer science (1877). Springer, pp. 259-274. ISBN 978-3-540-67897-7

[thumbnail of Frutos19springer.pdf]

Official URL:


The definition of sos formats ensuring that bisimilarity on closed terms is a congruence has received much attention in the last two decades. For dealing with open terms, the congruence is usually lifted from closed terms by instantiating the free variables in all possible ways; the only alternatives considered in the literature are Larsen and Xinxin’s context systems and Rensink’s conditional transition systems. We propose an approach based on tile logic, where closed and open terms are managed uniformly, and study the ‘bisimilarity as congruence’ property for several tile formats, accomplishing different concepts of open system.

Item Type:Book Section
Uncontrolled Keywords:Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Subjects:Sciences > Computer science
ID Code:20696
Deposited On:08 Apr 2013 11:38
Last Modified:02 Sep 2020 10:00

Origin of downloads

Repository Staff Only: item control page