Handbook of Graph Grammars and Computing by Graph Transformation

DOI10.1142/4180zbMath0998.68001OpenAlexW190356767MaRDI QIDQ4951113

No author found.

Publication date: 1 May 2000

Full work available at URL: https://doi.org/10.1142/4180

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (including graph drawing) in computer science (68R10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Grammars and rewriting systems (68Q42) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items (76)

Reducibility between classes of port graph grammar. ⋮ Theorem proving graph grammars with attributes and negative application conditions ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A rewriting approach to binary decision diagrams ⋮ Graph Transformation with Dependencies for the Specification of Interactive Systems ⋮ Adhesive and quasiadhesive categories ⋮ Amalgamation of domain specific languages with behaviour ⋮ Algebraic hierarchical graph transformation ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Attributed graph transformation with node type inheritance ⋮ A Port Graph Rewriting Approach to Relational Database Modelling ⋮ A strict constrained superposition calculus for graphs ⋮ On congruences of automata defined by directed graphs ⋮ Graph Transformation Units – An Overview ⋮ Criteria to disprove context freeness of collage languages. ⋮ Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs ⋮ Polynomial graph transformability ⋮ A Graph Transformation View on the Specification of Applications using Mobile Code* *Research partially supported by project ForMOS (Métodos Formais para Código Móvelem Sistemas Abertos) - grant CNPq 520269/98-5, by the Research Training Network GET-GRATS (General Theory of Graph Transformation Systems), and by the MURST project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Unnamed Item ⋮ Inductively Sequential Term-Graph Rewrite Systems ⋮ Graph Multiset Transformation as a Framework for Massively Parallel Computation ⋮ A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation ⋮ Adaptive Star Grammars for Graph Models ⋮ Workshop on Graph Computation Models ⋮ Towards a Notion of Transaction in Graph Rewriting ⋮ Graph Transformation Semantics for a QVT Language ⋮ The York Abstract Machine ⋮ Learning an efficient constructive sampler for graphs ⋮ Graph grammars according to the type of input and manipulated data: a survey ⋮ A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques ⋮ Abstraction in Graph-Transformation Based Diagram Editors ⋮ An Agg Application Supporting Visual Reasoning1 ⋮ Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph). ⋮ Visual Design of Software Architecture and Evolution based on Graph Transformation ⋮ Specifying and Implementing Visual Process Modeling Languages with DiaGen1 1Support by the Esprit Working Group AppliGraph is gratefully acknowledged. ⋮ Adding Graph Transformation Concepts to UML's Constraint Language OCL ⋮ GETGRATS ⋮ Towards a Formal Framework for Inter-Enterprise Application Integration ⋮ Algebra Transformation Systems as a Unifying Framework ⋮ Solving Equations by Graph Transformation ⋮ Structured Modeling with GRACE ⋮ Parameterized Transformation Units ⋮ An Abstract Module Concept for Graph Transformation Systems ⋮ Visual Modeling of Distributed Object Systems by Graph Transformation ⋮ Programming with narrowing: a tutorial ⋮ Automating the transformation-based analysis of visual languages ⋮ Analysis of UML Activities Using Dynamic Meta Modeling ⋮ GRACE as a unifying approach to graph-transformation-based specification1 1This work was partially supported by the ESPRIT Working Group Applications of Graph Transformation (APPLIGRAPH) and the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems). ⋮ Adaptive star grammars and their languages ⋮ Graph Rewriting Components ⋮ A Generic Construction for Crossovers of Graph-Like Structures ⋮ The Edge of Graph Transformation — Graphs for Behavioural Specification ⋮ Graph Transformation by Computational Category Theory ⋮ Autonomous Units and Their Semantics – The Concurrent Case ⋮ Tree-based generation of languages of fractals ⋮ A structural approach to graph transformation based on symmetric Petri nets ⋮ A living monograph for graph transformation ⋮ A formalisation of deep metamodelling ⋮ Using Graph Grammar Systems with Memory in Computer Aided Design ⋮ Transformation of Shaped Nested Graphs and Diagrams1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph). ⋮ GS·Λ Theories ⋮ Tree-based picture generation ⋮ Towards automated software model checking using graph transformation systems and bogor ⋮ Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation Systems ⋮ A Formal Model for Role-Based Access Control Using Graph Transformation ⋮ Verification of Random Graph Transformation Systems ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting ⋮ Undecidable Control Conditions in Graph Transformation Units ⋮ On Term-Graph Rewrite Strategies ⋮ Formal software specification with refinements and modules of typed graph transformation systems ⋮ Hierarchical graph transformation ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars ⋮ Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars ⋮ Compiling dyadic first-order specifications into map algebra ⋮ Decidability of Safety in Graph-Based Models for Access Control

This page was built for publication: Handbook of Graph Grammars and Computing by Graph Transformation