RT Book, Section
T1 Bisimilarity congruences for open terms and term graphs via tile logic
A1 Bruni, Roberto
A1 Frutos Escrig, David De
A1 Martí Oliet, Narciso
A1 Montanari, Ugo
A2 Palamidessi, Catuscia
AB 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.
PB Springer
SN 978-3-540-67897-7
YR 2000
FD 2000
LK https://hdl.handle.net/20.500.14352/60659
UL https://hdl.handle.net/20.500.14352/60659
LA eng
NO Bruni, R., Frutos Escrig, D., Martí Oliet, N. & Montanari, U. «Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic». CONCUR 2000 — Concurrency Theory, editado por Catuscia Palamidessi, vol. 1877, Springer Berlin Heidelberg, 2000, pp. 259-74. DOI.org (Crossref), https://doi.org/10.1007/3-540-44618-4_20.
DS Docta Complutense
RD 9 abr 2025