Universidad Complutense de Madrid
E-Prints Complutense

Bisimilarity congruences for open terms and term graphs via tile logic



Último año

Bruni, Roberto y Frutos Escrig, David de y Martí Oliet, Narciso y 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

[img] PDF
Restringido a Sólo personal autorizado del repositorio


URL Oficial: http://link.springer.com/content/pdf/10.1007%2F3-540-44618-4_20

URLTipo de 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.

Tipo de documento:Sección de libro
Palabras clave:Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Materias:Ciencias > Informática
Código ID:20696
Depositado:08 Abr 2013 11:38
Última Modificación:07 Aug 2018 07:18

Descargas en el último año

Sólo personal del repositorio: página de control del artículo