Parallel and distributed derivations in the single-pushout approach
From MaRDI portal
Publication:685462
DOI10.1016/0304-3975(93)90066-3zbMath0787.18002OpenAlexW2087502867MaRDI QIDQ685462
Publication date: 15 May 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90066-3
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Related Items
Reversible Causal Graph Dynamics, Parallelism in AGREE Transformations, Block Representation of Reversible Causal Graph Dynamics, Reversible causal graph dynamics: invertibility, block representation, vertex-preservation, Algebraic structures of directed acyclic graphs: application to concurrent calculus, Parallel rewriting of attributed graphs, Relational graph rewritings, Pragmatic and semantic aspects of a module concept for graph transformation systems, Hierarchically distributed graph transformation, Algebraic approach to single-pushout graph transformation, Categorical principles, techniques and results for high-level-replacement systems in computer science, Algebraic graph rewriting with controlled embedding, Reversibility vs Local Creation/Destruction
Cites Work
- Algebraic approach to single-pushout graph transformation
- On graph rewritings
- On ``On graph rewritings
- Parallelism and concurrency of graph manipulations
- Amalgamation of graph transformations: a synchronization mechanism
- Transformations of structures: An algebraic approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
