Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Category Theory and Computer Science
An Abstract Formulation for Rewrite Systems
Category Theory and Computer Science
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
A semantic framework for open processes
Theoretical Computer Science
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
On Symbolic Semantics for Name-decorated Contexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A modular LTS for open reactive systems
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Hi-index | 0.00 |
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition systems (LTSs) whose labels model the possible interactions with the environment; (ii) their abstract semantics is conveniently expressed by observational congruences. However, many current-day process calculi are more easily equipped with reduction semantics, where the notion of observable action is missing. Recent techniques attempted to bridge this gap by synthesising LTSs whose labels are process contexts that enable reactions and for which bisimulation is a congruence. Starting from Sewell's set-theoretic construction, category-theoretic techniques were defined and based on Leifer and Milner's relative pushouts, later refined by Sassone and the fourth author to deal with structural congruences given as groupoidal 2-categories.Building on recent works concerning observational equivalences for tile logic, the paper demonstrates that double categories provide an elegant setting in which the aforementioned contributions can be studied. Moreover, the formalism allows for a straightforward and natural definition of weak observational congruence.