Concurrency and loose semantics of open graph transformation systems

Authors:
Reiko Heckel;Mercé Llabrés;Hartmut Ehrig;Fernando Orejas
Affiliations:
University of Paderborn, Germany Email: reiko@uni-paderborn.de;University of the Balearic Islands, Palma de Mallorca, Spain Email: merce@ipc4.uib.es;Technical University of Berlin, Germany Email: ehrig@cs.tu-berlin.de;Technical University of Catalonia, Spain Email: orejas@lsi.upc.es
Venue:
Mathematical Structures in Computer Science
Year:
2002

Citing 11
Cited 3

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Event structures

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Graph processes

Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Node replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools

Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
The PROGRES approach: language and environment

Handbook of graph grammars and computing by graph transformation
A view-based approach to system modeling based on open graph transformation systems

Handbook of graph grammars and computing by graph transformation
A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information

TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations

Incremental service composition based on partial matching of visual contracts

FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
An institution for graph transformation

WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Testing against visual contracts: model-based coverage

ICGT'12 Proceedings of the 6th international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph transitions represent an extension of the DPO approach to graph transformation for the specification of reactive systems. In this paper, we develop the theory of concurrency for graph transitions. In particular, we prove a local Church–Rosser theorem and define a notion of shift-equivalence that allows us to represent both intra-concurrency (within the specified subsystem) and inter-concurrency (between subsystem and environment). Via an implementation of transitions in terms of DPO transformations with context rules, a second, more restrictive notion of equivalence is defined that captures, in addition, the extra-concurrency (between operations of the environment). As a running example and motivation, we show how the concepts of this paper provide a formal model for distributed information systems.