An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Hierarchical graph transformation
Journal of Computer and System Sciences
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Algebraic hierarchical graph transformation
Journal of Computer and System Sciences
Abstract hierarchical graph transformation
Mathematical Structures in Computer Science
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Sessions and Pipelines for Structured Service Programming
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Hierarchical Design Rewriting with Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
An algebraic semantics for MOF
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
A graph syntax for processes and services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A graph syntax for processes and services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Transformation of Typed Composite Graphs with Inheritance and Containment Structures
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Hi-index | 0.00 |
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.