Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Programmed graph replacement systems
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
Journal of Functional Programming
Theoretical Computer Science - Special issue: Computational systems biology
From Chemical Rules to Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Tom: piggybacking rewriting on java
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Graph theory for rule-based modeling of biochemical networks
Transactions on Computational Systems Biology VII
A Higher-Order Graph Calculus for Autonomic Computing
Graph Theory, Computational Intelligence and Thought
A Port Graph Calculus for Autonomic Computing and Invariant Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Runtime Verification for Biochemical Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and a multigraph rewriting relation. Then we encode the multigraphs and multigraph rewriting using algebraic terms and term rewriting to provide an operational semantics of the multigraph rewriting relation. This term version can be embedded in the rewriting calculus, thus defining for labeled multigraph transformations a high-level pattern calculus, called @r"m"g-calculus.