2018
DOI: 10.1007/978-3-319-75396-6_4
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Notion of Parallel Graph Transformation and Its Perspectives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…This particularly entails that their parallel rewrite steps can be simulated by sequential ones. This is also the case for other frameworks where massive parallel graph transformations is defined so that it can be simulated by sequential rewriting e.g., [10,21,20].…”
Section: Examplementioning
confidence: 94%
See 1 more Smart Citation
“…This particularly entails that their parallel rewrite steps can be simulated by sequential ones. This is also the case for other frameworks where massive parallel graph transformations is defined so that it can be simulated by sequential rewriting e.g., [10,21,20].…”
Section: Examplementioning
confidence: 94%
“…Kreowski [14] tackled the problem of parallel graph transformations and proposed conditions under which parallel graph transformations could be sequentialized and how sequential independent graph transformations could be parallelized. This pioneering work has been considered for several algebraic graph transformation approaches, see, e.g., the most recent contributions [9,22,21] or Volume 3 of the Handbook of Graph Grammars and Computing by Graph Transformation [12]. However, this stream of work departs drastically from our goal where parallel graph transformations are not aimed to be sequentialized.…”
Section: Examplementioning
confidence: 99%
“…A similar idea has been proposed in [25] by using edge-labelled graphs and rules with positive context where the state of cells are encoded by the label of loops. Rules with positive context seem very close to weak-spans, the only difference is the way direct transformations are defined.…”
Section: Examplesmentioning
confidence: 99%
“…Kreowski [17] tackled the problem of parallel graph transformations and introduced the notion of parallel independence. This pioneering work has been considered for several algebraic graph transformation approaches, see [15] as well as the more recent contributions [7,26,25]. At almost the same period, parallel graph transformations has been used as an extension of L-systems [29,31] as was proposed in, e.g., [21].…”
Section: Conclusion and Related Workmentioning
confidence: 99%
See 1 more Smart Citation