Pages that link to "Item:Q4379556"
From MaRDI portal
The following pages link to Handbook of Graph Grammars and Computing by Graph Transformation (Q4379556):
Displayed 45 items.
- Approximating clique-width and branch-width (Q2496203) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings (Q2576952) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- Combining Graph Transformation and Algebraic Specification into Model Transformation (Q2890331) (← links)
- The Edge of Graph Transformation — Graphs for Behavioural Specification (Q3059705) (← links)
- Graph Transformation by Computational Category Theory (Q3059706) (← links)
- Autonomous Units and Their Semantics – The Concurrent Case (Q3059708) (← links)
- Lessons Learned from Building a Graph Transformation System (Q3059715) (← links)
- Graph decompositions definable in monadic second-order logic (Q3439302) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)
- Towards a component framework for architecture-based self-adaptive applications (Q3446010) (← links)
- Ugo Montanari and Graph Transformation (Q3507353) (← links)
- Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
- Graph-Based Design and Analysis of Dynamic Software Architectures (Q3507356) (← links)
- Graph Transformation Units – An Overview (Q3507357) (← links)
- Transformations in Reconfigurable Place/Transition Systems (Q3507359) (← links)
- Explicit State Model Checking for Graph Grammars (Q3507360) (← links)
- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design (Q3507361) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- Logics and Automata for Totally Ordered Trees (Q3522020) (← links)
- Functional-Logic Graph Parser Combinators (Q3522023) (← links)
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems (Q3522863) (← links)
- Estimating Graph Parameters Using Graph Grammars (Q3528433) (← links)
- An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (Q3540387) (← links)
- Abstracting Complex Data Structures by Hyperedge Replacement (Q3540389) (← links)
- Inductively Sequential Term-Graph Rewrite Systems (Q3540390) (← links)
- A Decentralized Implementation of Mobile Ambients (Q3540392) (← links)
- Embedding and Confluence of Graph Transformations with Negative Application Conditions (Q3540396) (← links)
- Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts (Q3540403) (← links)
- Attributed Graph Constraints (Q3540405) (← links)
- Pullback Grammars Are Context-Free (Q3540411) (← links)
- A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation (Q3540414) (← links)
- From Separation Logic to Hyperedge Replacement and Back (Q3540425) (← links)
- Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions (Q3540428) (← links)
- Modelling and Verifying Mobile Systems Using π-Graphs (Q3599092) (← links)
- Application of Graph Transformation in Verification of Dynamic Systems (Q3605472) (← links)
- (Q4499273) (← links)
- Adhesive and quasiadhesive categories (Q5313719) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (Q5458376) (← links)
- A Logic of Graph Constraints (Q5460000) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)