Handbook of Graph Grammars and Computing by Graph Transformation

DOI10.1142/3303zbMath0908.68095OpenAlexW1508113248MaRDI QIDQ4379556

No author found.

Publication date: 2 March 1998

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

zbMATH Keywords

Computinggraph rewritinggraph grammargraph transformationGraph transformationsGraph grammarsgraph language

Mathematics Subject Classification ID

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

Reducibility between classes of port graph grammar., Node replacements in embedding normal form., Theorem proving graph grammars with attributes and negative application conditions, Trees, grids, and MSO decidability: from graphs to matroids, Automatic graphs and D0L-sequences of finite graphs, Navigating the chemical space of HCN polymerization and hydrolysis: guiding graph grammars by mass spectrometry data, Prosperity is associated with instability in dynamical networks, Clustering for Petri nets, Graph traversal and graph transformation, Incremental construction of coverability graphs, Vertex-minors, monadic second-order logic, and a conjecture by Seese, Configuration logics: modeling architecture styles, Amalgamation of domain specific languages with behaviour, Average case analysis of DJ graphs, Algebraic hierarchical graph transformation, Algorithmic uses of the Feferman-Vaught theorem, Unfolding semantics of graph transformation, Can abstract state machines be useful in language theory?, Logical description of context-free graph languages, Labelled graph strategic rewriting for social networks, Connectivity games over dynamic networks, Drags: a compositional algebraic framework for graph rewriting, Specifying graph languages with type graphs, A decentralised graphical implementation of mobile ambients, A monadic second-order definition of the structure of convex hypergraphs., The generative power of delegation networks, Criteria to disprove context freeness of collage languages., Tree-width and the monadic quantifier hierarchy., Graphs of separability at most 2, Decomposition width of matroids, Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs, Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes, Polynomial graph transformability, Graph grammars, insertion Lie algebras, and quantum field theory, Query efficient implementation of graphs of bounded clique-width, Recognizing optimal 1-planar graphs in linear time, Correct transformation: from object-based graph grammars to PROMELA, Verification of graph grammars using a logical approach, Ranking of network elements based on functional substructures, The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs, On the directed full degree spanning tree problem, Parallel rewriting of attributed graphs, Solutions for subset sum problems with special digraph constraints, Graph grammars with string-regulated rewriting, Spanners in sparse graphs, Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs, Subobject transformation systems, Upper bounds to the clique width of graphs, The PBPO graph transformation approach, A framework for the verification of infinite-state graph transformation systems, Parallel coherent graph transformations, Reachability analysis of reversal-bounded automata on series-parallel graphs, Circle graphs and monadic second-order logic, Grammatical inference of directed acyclic graph languages with polynomial time complexity, Grammar-based model transformations: definition, execution, and quality properties, Multiple context-free tree grammars: lexicalization and characterization, Polarity of chordal graphs, Graphical and incremental type inference. A graph transformation approach, Translating controlled graph grammars to ordinary graph grammars, Verifying polymer reaction networks using bisimulation, Linear delay enumeration and monadic second-order logic, Recent developments on graphs of bounded clique-width, Algebraic graph rewriting with controlled embedding, Graph automata: Natural expression of self-reproduction, Reasoning with graph constraints, An algebraic semantics for MOF, Packing disjoint cycles over vertex cuts, Graph transformation through graph surfing in reaction systems, On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems, Finite graph automata for linear and boundary graph languages, Language theoretic properties of regular DAG languages, Adaptive star grammars and their languages, Formal specification and verification of dynamic parametrized architectures, On the reachability of a version of graph-rewriting system, Well-structured graph transformation systems, A structural approach to graph transformation based on symmetric Petri nets, Framework and authoring tool for an extension of the UIML language, A calculus of concurrent graph-rewriting processes, Treewidth and logical definability of graph products, Single pushout rewriting in comprehensive systems of graph-like structures, Concurrent semantics for fusions: weak prime domains and connected event structures, Graph transformations for object-oriented refinement, The equivalence of bottom-up and top-down tree-to-graph transducers, Nondeterministic operations on finite relational structures, Comprehensive systems: a formal foundation for multi-model consistency management, A tale of two graph models: a case study in wireless sensor networks, The generating power of total deterministic tree transducers, Two-dimensional models, Constant delay traversal of grammar-compressed graphs with bounded rank, The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings, Hypergraph Lambek grammars, Context-sensitive fusion grammars and fusion grammars with forbidden context are universal, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, Labelled port graph -- a formal structure for models and computations, Macro tree transducers, attribute grammars, and MSO definable tree translations., The complexity of the \(K_{n,n}\)-problem for node replacement graph languages, Node replacement graph grammars with dynamic node relabeling, 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, Preserving consistency in geometric modeling with graph transformations, Adhesive and quasiadhesive categories, Algebras for Tree Decomposable Graphs, Fundamentals of compositional rewriting theory, A strict constrained superposition calculus for graphs, Multimodality in the Hypergraph Lambek Calculus, Unnamed Item, Unnamed Item, Towards a Systematic Method for Proving Termination of Graph Transformation Systems, Towards a Notion of Transaction in Graph Rewriting, Graph Transformation Semantics for a QVT Language, A Rewriting Calculus for Multigraphs with Ports, Free Energy of Petri Nets, Formal analysis of model transformations based on triple graph grammars, Formal Verification of Graph Grammars using Mathematical Induction, Separation results for separated apex NLC and NCE graph languages, Unnamed Item, Linear Recurrence Relations for Graph Polynomials, Deriving Bisimulation Congruences in the Presence of Negative Application Conditions, A Logic of Graph Constraints, On the Complexity of Local Graph Transformations, Unnamed Item, A Formal Model for Role-Based Access Control Using Graph Transformation, Decidability of Safety in Graph-Based Models for Access Control, 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