The MSGraph have a specific predicate for the path patterns. It will try to implicitly match path pattern between the different scales of the other predicates.

// graph with two nodes connected by a refinement edges
[Axiom ==> A /> B;]
derive(); // application of waiting rules
MSGraph msgraph = MSGraph.get (graph()) ; // get an instance of a MSGraph
// use the MSGraph as query model
msgraph.[A b:B ::> println(b);]; // the node B is found because Node "SPACE" Node look for refinement edges as well