Categorical principles, techniques and results for high-level-replacement systems in computer science
From MaRDI portal
(Redirected from Publication:690375)
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
Cites work
- scientific article; zbMATH DE number 1638662 (Why is no real title available?)
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 4049096 (Why is no real title available?)
- scientific article; zbMATH DE number 44486 (Why is no real title available?)
- scientific article; zbMATH DE number 177439 (Why is no real title available?)
- scientific article; zbMATH DE number 3555491 (Why is no real title available?)
- scientific article; zbMATH DE number 4125035 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 3417640 (Why is no real title available?)
- Amalgamation of graph transformations: a synchronization mechanism
- Hyperedge replacement: grammars and languages
- On ``On graph rewritings
- On graph rewritings
- Parallel and distributed derivations in the single-pushout approach
- Parallelism and concurrency in high-level replacement systems
- Parallelism and concurrency of graph manipulations
- Petri nets are monoids
- Pushout-complements and basic concepts of grammars in toposes
Cited in
(10)- scientific article; zbMATH DE number 792228 (Why is no real title available?)
- Applications of category theory in symbolic computation
- Categorical approach to horizontal structuring and refinement of high-level replacement systems
- Algebraic transformation of unary partial algebras. I: Double-pushout approach
- On the expressive power of algebraic graph grammars with application conditions
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- The uniqueness condition for the double pushout transformation of algebras
- Adhesivity with partial maps instead of spans
- Algebraic transformation of unary partial algebras II: Single-pushout approach
- Single pushout rewriting in comprehensive systems of graph-like structures
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)