Bruni, RobertoFrutos Escrig, David DeMartí Oliet, NarcisoMontanari, UgoPalamidessi, Catuscia2023-06-202023-06-202000Bruni, 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.978-3-540-67897-710.1007/3-540-44618-4_20https://hdl.handle.net/20.500.14352/60659The 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.engbook parthttps//doi.org/10.1007/3-540-44618-4_20http://link.springer.com/content/pdf/10.1007%2F3-540-44618-4_20open access004Models and methods for concurrent and distributed computingBisimulationTransition netsProcess algebrasInformática (Informática)1203.17 Informática