Grammar Morphisms and Weakly Adhesive Categories
From MaRDI portal
Publication:3540427
DOI10.1007/978-3-540-87405-8_43zbMath1175.68224OpenAlexW2168950078MaRDI QIDQ3540427
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_43
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri nets, algebras, morphisms, and compositionality
- Categories of partial maps
- Unfolding Grammars in Adhesive Categories
- The category of typed graph grammars and its adjunctions with categories of derivations
- Foundations of Software Science and Computation Structures
- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
This page was built for publication: Grammar Morphisms and Weakly Adhesive Categories