Academic Journals Database
Disseminating quality controlled scientific knowledge

Structured Operational Semantics for Graph Rewriting

ADD TO MY LIST
 
Author(s): A. Dorman | T. Heindel | B. König

Journal: Scientific Annals of Computer Science
ISSN 1843-8121

Volume: 22;
Issue: 1;
Start page: 105;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: process calculi | graph transformation | structural operational semantics | compositional methods

ABSTRACT
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.
RPA Switzerland

Robotic Process Automation Switzerland

    

Tango Rapperswil
Tango Rapperswil