The following pages link to (Q4194478):
Displaying 37 items.
- Code generation for parallel applications modelled with object-based graph grammars (Q2870327) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- Parallelism in AGREE Transformations (Q3187802) (← links)
- Implementing term rewriting by jungle evaluation (Q3486867) (← links)
- Transformations in Reconfigurable Place/Transition Systems (Q3507359) (← links)
- (Q3657456) (← links)
- (Q4222787) (← links)
- The contractum in algebraic graph rewriting (Q4645265) (← links)
- A category-theoretical approach to vertex replacement: The generation of infinite graphs (Q4645266) (← links)
- Graph unification and matching (Q4645268) (← links)
- Pragmatic and semantic aspects of a module concept for graph transformation systems (Q4645272) (← links)
- Hierarchically distributed graph transformation (Q4645284) (← links)
- Transformations of graph grammars (Q4645292) (← links)
- On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH (Q4923505) (← links)
- Pullback rewriting and applications (Q4923531) (← links)
- Basic Results for Two Types of High-Level Replacement Systems (Q4923535) (← links)
- Note on standard representation of graphs and graph derivations (Q5096277) (← links)
- Canonical derivations for high-level replacement systems (Q5096280) (← links)
- Single pushout transformations of equationally defined graph structures with applications to actor systems (Q5096285) (← links)
- Parallelism in single-pushout graph rewriting (Q5096286) (← links)
- Semantics of full statecharts based on graph rewriting (Q5096287) (← links)
- On relating rewriting systems and graph grammars to event structures (Q5096291) (← links)
- Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system (Q5096295) (← links)
- A decade of TAPSOFT (Q5096723) (← links)
- On the expressive power of algebraic graph grammars with application conditions (Q5096746) (← links)
- Adhesive and quasiadhesive categories (Q5313719) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- Implementing term rewriting by graph reduction: Termination of combined systems (Q5881286) (← links)
- CoReS: a tool for computing core graphs via SAT/SMT solvers (Q5918209) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
- Concurrent graph and term graph rewriting (Q6162098) (← links)
- Specification of graph translators with triple graph grammars (Q6184366) (← links)
- (Q6198042) (← links)
- Moving a derivation along a derivation preserves the spine (Q6535507) (← links)
- Node rewriting in hypergraphs (Q6550530) (← links)
- Closure properties of context-free hyperedge replacement systems (Q6550538) (← links)
- Algebraic graph derivations for graphical calculi (Q6550547) (← links)
