2 research outputs found
Structured Operational Semantics for Graph Rewriting
Process calculi and graph transformation systems provide models of reactive
systems with labelled transition semantics. While the semantics for process
calculi is compositional, this is not the case for graph transformation
systems, in general. Hence, the goal of this article is to obtain a
compositional semantics for graph transformation system in analogy to the
structural operational semantics (SOS) for Milner's Calculus of Communicating
Systems (CCS).
The paper introduces an SOS style axiomatization of the standard labelled
transition semantics for graph transformation systems. The first result is its
equivalence with the so-called Borrowed Context technique. Unfortunately, the
axiomatization is not compositional in the expected manner as no rule captures
"internal" communication of sub-systems. The main result states that such a
rule is derivable if the given graph transformation system enjoys a certain
property, which we call "complementarity of actions". Archetypal examples of
such systems are interaction nets. We also discuss problems that arise if
"complementarity of actions" is violated.Comment: In Proceedings ICE 2011, arXiv:1108.014
Structured Operational Semantics for Graph Rewriting
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational semantics (SOS) for Milner's Calculus of Communicating Systems (CCS). The paper introduces an SOS style axiomatization of the standard labelled transition semantics for graph transformation systems that is based on the idea of minimal reaction contexts as labels, due to Leifer and Milner. In comparison to previous work on inductive definitions of similarly derived LTSs, the main feature of the proposed axiomatization is a composition rule that captures the communication of sub-systems so that it can feature as a counterpart to the communication rule of CCS