This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...