module Path_analysis: sig
.. end
val trans_l : Promelaast.trans list Pervasives.ref
val states_l : Promelaast.state list Pervasives.ref
val voisins : Promelaast.state -> (Promelaast.state * int) list
val empty : unit -> 'a list
val is_empty : 'a list -> bool
val add : 'a * ('b * 'c) -> ('a * ('b * 'c)) list -> ('a * ('b * 'c)) list
: ('a * 'b) list -> ('a * 'b) * ('a * 'b) list
val dijkstra : ('a -> ('a * int) list) -> 'a -> 'a -> 'a list * int
val existing_path : Promelaast.state list * Promelaast.trans list -> int -> int -> bool
val test : Promelaast.state list * Promelaast.trans list -> unit