Handbook of Graph Grammars and Computing by Graph Transformation
From MaRDI portal
Publication:4379556
DOI10.1142/3303zbMath0908.68095OpenAlexW1508113248MaRDI QIDQ4379556
No author found.
Publication date: 2 March 1998
Full work available at URL: https://doi.org/10.1142/3303
Computinggraph rewritinggraph grammargraph transformationGraph transformationsGraph grammarsgraph language
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Grammars and rewriting systems (68Q42)
Related Items (only showing first 100 items - show all)
An Institution for Graph Transformation ⋮ Combining Graph Transformation and Algebraic Specification into Model Transformation ⋮ Towards a component framework for architecture-based self-adaptive applications ⋮ Modeling complex systems with adaptive networks ⋮ Unnamed Item ⋮ Uniform parsing for hyperedge replacement grammars ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Recognizable languages of arrows and cospans ⋮ Non-size increasing graph rewriting for natural language processing ⋮ AGREE – Algebraic Graph Rewriting with Controlled Embedding ⋮ Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings ⋮ Multi-amalgamated Triple Graph Grammars ⋮ Equational Reasoning with Context-Free Families of String Diagrams ⋮ On the computational complexity of the bipartizing matching problem ⋮ Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement ⋮ Multilevel coupled model transformations for precise and reusable definition of model behaviour ⋮ Unification of drags and confluence of drag rewriting ⋮ Recognizable series on graphs and hypergraphs ⋮ Ugo Montanari and Graph Transformation ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Graph-Based Design and Analysis of Dynamic Software Architectures ⋮ Graph Transformation Units – An Overview ⋮ Transformations in Reconfigurable Place/Transition Systems ⋮ Explicit State Model Checking for Graph Grammars ⋮ Linear-Ordered Graph Grammars: Applications to Distributed Systems Design ⋮ Obtaining a Planar Graph by Vertex Deletion ⋮ 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). ⋮ Logics and Automata for Totally Ordered Trees ⋮ Functional-Logic Graph Parser Combinators ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Unnamed Item ⋮ Estimating Graph Parameters Using Graph Grammars ⋮ Unnamed Item ⋮ Graph transformation for incremental natural language analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars ⋮ Abstracting Complex Data Structures by Hyperedge Replacement ⋮ Inductively Sequential Term-Graph Rewrite Systems ⋮ A Decentralized Implementation of Mobile Ambients ⋮ Embedding and Confluence of Graph Transformations with Negative Application Conditions ⋮ Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts ⋮ Attributed Graph Constraints ⋮ Pullback Grammars Are Context-Free ⋮ A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation ⋮ From Separation Logic to Hyperedge Replacement and Back ⋮ Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ Line graphs of bounded clique-width ⋮ Graph automata ⋮ A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques ⋮ Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms ⋮ Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph). ⋮ Algebraic recognizability of regular tree languages ⋮ Towards Common Exchange Formats for Graphs and Graph Transformation Systems ⋮ How to Specify a Graph Transformation Approach ⋮ GETGRATS ⋮ Graph Operations, Graph Transformations and Monadic Second-Order Logic: ⋮ Algebra Transformation Systems as a Unifying Framework ⋮ Two Graph-Based Techniques for Software Architecture Reconfiguration ⋮ Processes and Local Actions ⋮ Graph Transformations for the Specification of Access Control Policies ⋮ Structured Modeling with GRACE ⋮ Parameterized Transformation Units ⋮ The uniqueness condition for the double pushout transformation of algebras ⋮ Graph-based specification of access control policies ⋮ The monadic second-order logic of graphs. XV: On a conjecture by D. Seese ⋮ Approximating clique-width and branch-width ⋮ Recognizability, hypergraph operations, and logical types ⋮ 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). ⋮ Modelling and Verifying Mobile Systems Using π-Graphs ⋮ Application of Graph Transformation in Verification of Dynamic Systems ⋮ The Edge of Graph Transformation — Graphs for Behavioural Specification ⋮ Graph Transformation by Computational Category Theory ⋮ Autonomous Units and Their Semantics – The Concurrent Case ⋮ Lessons Learned from Building a Graph Transformation System ⋮ Using Graph Grammar Systems with Memory in Computer Aided Design ⋮ Bidimensionality and Kernels ⋮ Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker ⋮ 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 ⋮ The recognizability of sets of graphs is a robust property ⋮ Function simulation, graph grammars and colourings ⋮ Quantitative \(\mu\)-calculus and CTL defined over constraint semirings ⋮ A general framework for types in graph rewriting ⋮ A Game Theoretic Approach to the Analysis of Dynamic Networks ⋮ Connector Rewriting with High-Level Replacement Systems ⋮ Graph decompositions definable in monadic second-order logic ⋮ Graph decompositions for cartesian products ⋮ Verification of Random Graph Transformation Systems ⋮ Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting ⋮ Modelling Calculi with Name Mobility using Graphs with Equivalences ⋮ Universal Boolean Systems ⋮ Undecidable Control Conditions in Graph Transformation Units ⋮ On Term-Graph Rewrite Strategies ⋮ Rule Algebras for Adhesive Categories
This page was built for publication: Handbook of Graph Grammars and Computing by Graph Transformation
