Single pushout transformations of equationally defined graph structures with applications to actor systems

DOI10.1007/3-540-57787-4_15zbMath1494.68114OpenAlexW1501916033MaRDI QIDQ5096285

Martin Korff

Publication date: 16 August 2022

Published in: Graph Transformations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57787-4_15

zbMATH Keywords

actor systemsalgebraic graph transformationsequationally defined graph structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items

On the expressive power of algebraic graph grammars with application conditions ⋮ Hierarchically distributed graph transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• Categorical principles, techniques and results for high-level-replacement systems in computer science
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• On the structure of node-label-controlled graph languages
• Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems
• Amalgamation of graph transformations: a synchronization mechanism
• Implementing term rewriting by jungle evaluation
• Actor grammars
• Transformations of structures: An algebraic approach
• Parallelism and concurrency in high-level replacement systems