+ type t
+ val hash : t -> int
+ val uid : t -> int
+ val equal : t -> t -> bool
+ val expr : t -> t expr
+ val st :
+ t ->
+ (StateSet.t * StateSet.t * StateSet.t) *
+ (StateSet.t * StateSet.t * StateSet.t)
+ val size : t -> int
+ val print : Format.formatter -> t -> unit
+ val is_true : t -> bool
+ val is_false : t -> bool
+ val true_ : t
+ val false_ : t
+ val atom_ :
+ [ `LLeft | `Left | `RRight | `Right ] ->
+ bool -> StateSet.elt -> t
+ val not_ : t -> t
+ val or_ : t -> t -> t
+ val and_ : t -> t -> t
+ module Infix : sig
+ val ( +| ) : t -> t -> t
+ val ( *& ) : t -> t -> t
+ val ( *+ ) :
+ [ `LLeft | `Left | `RRight | `Right ] -> StateSet.elt -> t
+ val ( *- ) :
+ [ `LLeft | `Left | `RRight | `Right ] -> StateSet.elt -> t
+ end
+ end
+module Transition :
+ sig
+ type node = State.t * bool * Formula.t * bool
+ type data = node
+ type t
+ val make : data -> t
+ val node : t -> data
+ val hash : t -> int
+ val uid : t -> int
+ val equal : t -> t -> bool
+ module Infix : sig
+ val ( ?< ) : State.t -> State.t
+ val ( >< ) : State.t -> TagSet.t * bool -> State.t*(TagSet.t*bool*bool)
+ val ( ><@ ) : State.t -> TagSet.t * bool -> State.t*(TagSet.t*bool*bool)
+ val ( >=> ) : State.t * (TagSet.t*bool*bool) -> Formula.t -> (State.t*TagSet.t*t)
+ end
+ val print : Format.formatter -> t -> unit
+ end