On GS-Monoidal Theories for Graphs with Nesting

DOI10.1007/978-3-642-17322-6_4zbMath1309.68147WikidataQ56501660 ScholiaQ56501660MaRDI QIDQ3059707

Andrea Corradini, Ugo Montanari, Fabio Gadducci, Alberto Lluch Lafuente, Roberto Bruni

Publication date: 26 November 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-17322-6_4

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

18A10: Graphs, diagram schemes, precategories

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for the verification of infinite-state graph transformation systems
• A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
• An abstract machine for concurrent modular systems: CHARM
• Hierarchical graph transformation
• LEAN: An intermediate language based on graph rewriting
• Normal forms for algebras of connections.
• Tile formats for located and mobile systems.
• An algebraic presentation of term graphs, via gs-monoidal categories
• Pure bigraphs: structure and dynamics
• An Algebra for Directed Bigraphs
• Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
• Theoretical foundations for compensations in flow composition languages
• Graph rewriting for the π-calculus
• Abstract hierarchical graph transformation