Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Hi-index | 0.00 |
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 system specifications, the congruence is usually lifted from closed terms to open terms by instantiating the free variables in all possible ways; the only alternatives considered in the literature relying on Larsen and Xinxin''s context systems and Rensink''s conditional transition systems. We propose a different approach based on tile logic, where both closed and open terms are managed analogously. In particular, we analyze the `bisimilarity as congruence'' property for several tile formats that accomplish different concepts of subterm sharing.