Categorical principles, techniques and results for high-level-replacement systems in computer science
DOI10.1007/BF00872984zbMATH Open0784.68063OpenAlexW1986020155MaRDI QIDQ690375FDOQ690375
Authors: 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
Recommendations
- Categorical approach to horizontal structuring and refinement of high-level replacement systems
- Basic results for two types of high-level replacement systems
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
- Parallelism and concurrency in high-level replacement systems
- On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH
formal languagesalgebraic approachgraph grammarsgrammarsalgebraic specificationsformal systemshigh- level-replacement systemspecial categories
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)
Cites Work
- Hyperedge replacement: grammars and languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets are monoids
- Pushout-complements and basic concepts of grammars in toposes
- On ``On graph rewritings
- Parallelism and concurrency of graph manipulations
- Parallelism and concurrency in high-level replacement systems
- Title not available (Why is that?)
- Parallel and distributed derivations in the single-pushout approach
- On graph rewritings
- Amalgamation of graph transformations: a synchronization mechanism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Categorical approach to horizontal structuring and refinement of high-level replacement systems
- Algebraic transformation of unary partial algebras II: Single-pushout approach
- Algebraic transformation of unary partial algebras. I: Double-pushout approach
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- Single pushout rewriting in comprehensive systems of graph-like structures
- Title not available (Why is that?)
- The uniqueness condition for the double pushout transformation of algebras
- Adhesivity with partial maps instead of spans
- Applications of category theory in symbolic computation
- On the expressive power of algebraic graph grammars with application conditions
This page was built for publication: Categorical principles, techniques and results for high-level-replacement systems in computer science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690375)