Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-25T10:35:54.714Z Has data issue: false hasContentIssue false
  • English
  • Français

Concurrency and loose semantics of open graph transformation systems

Published online by Cambridge University Press:  16 September 2002

REIKO HECKEL ,
MERCÉ LLABRÉS ,
HARTMUT EHRIG  and
FERNANDO OREJAS
REIKO HECKEL
Affiliation:
University of Paderborn, Germany Email: [email protected]
MERCÉ LLABRÉS
Affiliation:
University of the Balearic Islands, Palma de Mallorca, Spain Email: [email protected]
HARTMUT EHRIG
Affiliation:
Technical University of Berlin, Germany Email: [email protected]
FERNANDO OREJAS
Affiliation:
Technical University of Catalonia, Spain Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 12 , Issue 4 , August 2002 , pp. 349 - 376
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This paper is a complete and revised version of a lecture given at the workshop on Theory and Applications of Graph Transformations (GRATRA 2000), which was a satellite event of ETAPS 2000 in Berlin, March 2000.