Module Bigraph.Flatten

Operation to flatten a bigraph to a directed graph with special nodes and constraints.

Defined in:

B. Archibald, K. Burns, C. McCreesh, M. Sevegnani. Practical Bigraphs via Subgraph Isomorphism, International Conference on Principles and Practice of Constraint Programming (CP 2021).

type node

Flattened node representation

type t

Type of flattened digraphs

type colouring

Colour tracking

val default_colouring : unit -> colouring
val colouring_for_pattern : Big.t -> colouring

Colouring for matching rule pattern p against a concrete target: fine (Val-pruning) when p's params are all concrete, coarse when it carries Cons/Expr parameters (which must match concrete target nodes).

val flatten_target : Big.t -> colouring -> t * colouring

Convert a bigraph to flattened target representation

val flatten_pattern : Big.t -> colouring -> t * colouring

Convert a bigraph to flattened pattern representation

val toGBS : t -> Gbs.t