An institution for graph transformation
From MaRDI portal
Recommendations
Cites work
- A framework for the verification of infinite-state graph transformation systems
- Adhesive and quasiadhesive categories
- Algebraic approach to single-pushout graph transformation
- An algebraic presentation of term graphs, via gs-monoidal categories
- Approach-independent structuring concepts for rule-based systems.
- Concurrency and loose semantics of open graph transformation systems
- Conditional rewriting logic as a unified model of concurrency
- Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
- Formal software specification with refinements and modules of typed graph transformation systems
- Graph Transformation Units – An Overview
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 125888 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 1086713 (Why is no real title available?)
- scientific article; zbMATH DE number 1504829 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Institutions for logic programming
- Institutions: abstract model theory for specification and programming
- Sesqui-Pushout Rewriting
- Specifications in an arbitrary institution
- Structured CSP – A Process Algebra as an Institution
- Unfolding semantics of graph transformation
Cited in
(2)
This page was built for publication: An institution for graph transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890329)