scientific article; zbMATH DE number 3854447
[For the entire collection see Zbl 0527.00033.] This paper provides a common framework to study transformations of structures ranging from all kinds of graphs to relational data structures. Transformations of structures can be used as derivations of graphs in the sense of graph grammars, as update of relations in the sense of relational data bases, or even as operations on data structures in the sense of abstract data types. The main aim of the paper is to construct parallel and concurrent transformations from given sequential ones and to study vice versa sequentializability properties of complex transformations. The main results are three fundamental theorems concerning parallelism, concurrency and decomposition of transformations of structures. On one hand these results can be considered as a contribution to the study of concurrency in graph grammars and on the other hand as a formal framework for consistent concurrent update of relational data structures.
- A graph transformation algorithm for concurrency control in a partitioned database
- Realizing Graph Transformations by Pre- and Postconditions and Command Sequences
- scientific article; zbMATH DE number 3951989 (Why is no real title available?)
- scientific article; zbMATH DE number 1136656 (Why is no real title available?)
- A relation-algebraic approach to graph structure transformation
- A language for generic graph-transformations
- Concurrency and loose semantics of open graph transformation systems
- Delaying Constraint Solving in Symbolic Graph Transformation
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Using weakest application conditions to rank graph transformations for graph repair
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323294)