Parallelism and concurrency of graph manipulations
From MaRDI portal
Publication:1147520
DOI10.1016/0304-3975(80)90016-XzbMath0449.68036MaRDI QIDQ1147520
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (15)
Parallelism and concurrency in high-level replacement systems ⋮ Reachability in Graph Transformation Systems and Slice Languages ⋮ Parallel high-level replacement systems ⋮ Patch Graph Rewriting ⋮ Accretive computation of global transformations ⋮ Graph grammars and operational semantics ⋮ Foundations of rule-based design of modular systems ⋮ Relational graph rewritings ⋮ The category of typed graph grammars and its adjunctions with categories of derivations ⋮ Parallel and distributed derivations in the single-pushout approach ⋮ Categorical principles, techniques and results for high-level-replacement systems in computer science ⋮ -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation ⋮ Amalgamation of graph transformations: a synchronization mechanism ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications ⋮ A generalized concurrent rule construction for double-pushout rewriting
Cites Work
- Deriving graphs from graphs by applying a production
- Dynamics of discrete systems and pattern reproduction
- Grammars on partial graphs
- Relational production systems
- Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
- Contribution to the theory of concurrency in databases
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallelism and concurrency of graph manipulations
