Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Structured operational semantics and bisimulation as a congruence
Information and Computation
Journal of the ACM (JACM)
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Process and Term Tile Logic
Tile Bisimilarity Congruences for Open Terms and Term Graphs
Tile Bisimilarity Congruences for Open Terms and Term Graphs
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Preserving contexts for soft conformance relation
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| 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 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.