Categorical principles, techniques and results for high-level-replacement systems in computer science

DOI10.1007/BF00872984zbMath0784.68063OpenAlexW1986020155MaRDI QIDQ690375

Hartmut Ehrig, Michael Löwe

Publication date: 2 January 1994

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00872984

zbMATH Keywords

algebraic specificationsformal languagesgraph grammarsformal systemsgrammarsalgebraic approachhigh- level-replacement systemspecial categories

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General theory of categories and functors (18A99) Theory of computing (68Q99)

Related Items

Single pushout transformations of equationally defined graph structures with applications to actor systems, On the expressive power of algebraic graph grammars with application conditions, Algebraic transformation of unary partial algebras. I: Double-pushout approach, The uniqueness condition for the double pushout transformation of algebras, Single pushout rewriting in comprehensive systems of graph-like structures, Algebraic transformation of unary partial algebras II: Single-pushout approach

Cites Work

• Hyperedge replacement: grammars and languages
• Parallel and distributed derivations in the single-pushout approach
• Pushout-complements and basic concepts of grammars in toposes
• On graph rewritings
• Petri nets are monoids
• On ``On graph rewritings
• Parallelism and concurrency of graph manipulations
• Amalgamation of graph transformations: a synchronization mechanism
• Parallelism and concurrency in high-level replacement systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item