type state = int
val mk_state : unit -> state

type predicate = Ptset.t*Ptset.t -> Tree.Binary.t ->  [ `True | `False | `Maybe ]
type formula_expr =
    False
  | True
  | Or of formula * formula
  | And of formula * formula
  | Atom of ([ `Left | `Right ] * bool * state * predicate option)
and formula = { fid : int; pos : formula_expr; neg : formula; st : Ptset.t*Ptset.t;}
val true_ : formula
val false_ : formula
val atom_ : ?pred:predicate option -> [`Left | `Right ] -> bool -> state -> formula
val and_ : formula -> formula -> formula
val or_ : formula -> formula -> formula
val not_ : formula -> formula 
val equal_form : formula -> formula -> bool
val pr_frm : Format.formatter -> formula -> unit


type property = [ `None | `Existential  ]

type t = {
  id : int;
  states : Ptset.t;
  init : Ptset.t;
  final : Ptset.t;
  universal : Ptset.t;
  phi : (TagSet.t * state, bool * formula) Hashtbl.t;
  delta : (TagSet.t, Ptset.t * bool * Ptset.t * Ptset.t) Hashtbl.t;
  properties : (state,property) Hashtbl.t;
}
val dump : Format.formatter -> t -> unit
    
module Transitions : sig
type t = state*TagSet.t*bool*formula
(* Doing this avoid the parenthesis *)
val ( ?< ) : state -> state 
val ( >< ) : state -> TagSet.t*bool -> state*(TagSet.t*bool)
val ( >=> ) : state*(TagSet.t*bool) -> formula -> t
val ( +| ) : formula -> formula -> formula
val ( *& ) : formula -> formula -> formula
val ( ** ) : [`Left | `Right ] -> state -> formula

end
type transition = Transitions.t
val equal_trans : transition -> transition -> bool


module BottomUpNew : 
sig
  val miss : int ref
  val call : int ref
  val run : t -> Tree.Binary.t -> Tree.Binary.t list
end