Module Interpreted_automata.WTO

Datatype for WTOs

type node = vertex
type pref = node -> node -> int

Partial order of preference for the choice of the head of a loop. pref current_head new_candidate must return < 0 if new_candidate is preferred to current_head. Use "(fun _ _ -> 0)" for no specific preference.

val partition : pref:pref -> init:node -> succs:(node -> node list) -> node Fclib.Wto.partition

Implements Bourdoncle "Efficient chaotic iteration strategies with widenings" algorithm to compute a WTO.

val pretty_partition : Stdlib.Format.formatter -> node Fclib.Wto.partition -> unit
val pretty_component : Stdlib.Format.formatter -> node Fclib.Wto.component -> unit
val equal_component : node Fclib.Wto.component -> node Fclib.Wto.component -> bool
val equal_partition : node Fclib.Wto.partition -> node Fclib.Wto.partition -> bool