GETGRATS

DOI10.1016/S1571-0661(04)80191-9zbMath1263.68069OpenAlexW4233288065MaRDI QIDQ4923529

Andrea Corradini

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80191-9

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Bibliographies for mathematics in general (00A15)

Related Items (2)

Connectivity games over dynamic networks ⋮ A Game Theoretic Approach to the Analysis of Dynamic Networks

Uses Software

• Maude
• ViewPoints

Cites Work

• Some remarks on the Kronecker product of graphs
• Pancyclicity in switching classes
• Basic notions of universal algebra for language theory and graph grammars
• Acyclicity of switching classes
• Decidability of the finiteness of ranges of tree transductions
• The equivalence of bottom-up and top-down tree-to-graph transducers
• A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
• Algebraic transformation of unary partial algebras II: Single-pushout approach
• Non-uniform random spanning trees on weighted graphs
• Cooperating distributed hyperedge replacement grammars
• The monadic second-order logic of graphs. X: Linear orderings
• Parallel high-level replacement systems
• A monadic second-order definition of the structure of convex hypergraphs.
• Criteria to disprove context freeness of collage languages.
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps
• The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
• Graph transformation units with interleaving semantics
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• Tree-based picture generation
• The generative power of context-free node rewriting in hypergraphs
• Compositional SOS and beyond: A coalgebraic view of open systems
• Gene assembly through cyclic graph decomposition
• Graph transformation for specification and programming
• Normal forms for algebras of connections.
• A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Bisimilarity in term graph rewriting.
• Zero-safe nets: Comparing the collective and individual token approaches.
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• Functorial models for Petri nets
• Contextual Petri nets, asymmetric event structures, and processes
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• GETGRATS closing workshop on graph transformation systems, Bordeaux, France, June 22--23, 2001. Proceedings
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
• Theory and application of graph transformations. 6th international workshop, TAGT '98. Paderborn, Germany, November 16--20, 1998. Selected papers
• An algebraic presentation of term graphs, via gs-monoidal categories
• Graph rewriting, constraint solving and tiles for coordinating distributed systems
• Categorical approach to horizontal structuring and refinement of high-level replacement systems
• Distributed graphs and graph transformation
• Linear time solvable optimization problems on graphs of bounded clique-width
• The size of switching classes with skew gains
• Upper bounds to the clique width of graphs
• Double-pushout graph transformation revisited
• Normal forms for context-free node-rewriting hypergraph grammars
• Fusion in relational structures and the verification of monadic second-order properties
• Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
• Domino Treewidth
• Handbook of Graph Grammars and Computing by Graph Transformation
• Macro Tree Translations of Linear Size Increase are MSO Definable
• An interactive semantics of logic programming
• A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
• Constraint satisfaction algorithms for graph pattern matching
• Algebraic properties of processes for Local Action Systems
• A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
• Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”.
• Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.
• Concurrency for Graph Grammars in a Petri net shell
• Pullback rewriting and applications
• Graph Relabelling Systems
• Categorical rewriting of term-like structures
• Basic Results for Two Types of High-Level Replacement Systems
• Algebra Transformation Systems as a Unifying Framework
• Solving Equations by Graph Transformation
• Processes and Local Actions
• Context-free hypergraph grammars with node rewriting
• Parameterized Transformation Units
• Essentials of Term Graph Rewriting
• Visual Modeling of Distributed Object Systems by Graph Transformation
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Handbook of Graph Grammars and Computing by Graph Transformation
• Abstract hierarchical graph transformation
• A Formal Model for Role-Based Access Control Using Graph Transformation
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• Pullback as a generic graph rewriting mechanism
• Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
• Rule-based refinement of high-level nets preserving safety properties
• A coalgebraic presentation of structured transition systems
• Tree-based generation of languages of fractals
• Node rewriting in graphs and hypergraphs: A categorical framework
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: GETGRATS