<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-27T12:23:53Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/60659" metadataPrefix="mods">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/60659</identifier><datestamp>2024-07-10T15:58:24Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_21</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Bruni, Roberto</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Frutos Escrig, David De</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Martí Oliet, Narciso</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Montanari, Ugo</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2023-06-20T21:05:22Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2023-06-20T21:05:22Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">2000</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="citation">Bruni, R., Frutos Escrig, D., Martí Oliet, N. &amp; 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.</mods:identifier>
   <mods:identifier type="isbn">978-3-540-67897-7</mods:identifier>
   <mods:identifier type="doi">10.1007/3-540-44618-4_20</mods:identifier>
   <mods:identifier type="uri">https://hdl.handle.net/20.500.14352/60659</mods:identifier>
   <mods:identifier type="officialurl">https//doi.org/10.1007/3-540-44618-4_20</mods:identifier>
   <mods:identifier type="relatedurl">http://link.springer.com/content/pdf/10.1007%2F3-540-44618-4_20</mods:identifier>
   <mods:abstract>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.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:titleInfo>
      <mods:title>Bisimilarity congruences for open terms and term graphs via tile logic</mods:title>
   </mods:titleInfo>
   <mods:genre>book part</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>