Relabelling in graph transformation
From MaRDI portal
Recommendations
Cited in
(18)- The PBPO graph transformation approach
- Reducibility between classes of port graph grammar.
- Monadic second-order incorrectness logic for GP 2
- Graph rewriting and relabeling with PBPO\textsuperscript{+}
- Incorrectness logic for graph programs
- Verifying graph programs with monadic second-order logic
- Theorem proving graph grammars with attributes and negative application conditions
- Double-pushout graph transformation revisited
- M, N-adhesive transformation systems
- Double-pushout approach with injective matching
- Guided relinking of graph pyramids
- GMTE: a tool for graph transformation and exact/inexact graph matching
- scientific article; zbMATH DE number 7456056 (Why is no real title available?)
- Preserving consistency in geometric modeling with graph transformations
- Changing labels in the double-pushout approach can be treated categorically
- Linear-time graph algorithms in GP 2
- Graph rewriting and relabeling with PBPO^+: a unifying theory for quasitoposes
- Rule-based graph programs matching the time complexity of imperative algorithms
This page was built for publication: Relabelling in graph transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4438775)