+module NodeHash = Hashtbl.Make (Node)
+
+type t = (StateSet.t*StateSet.t) NodeHash.t
+(** Map from nodes to query and recognizing states *)
+(* Note that we do not consider nil nodes *)
+
+exception Oracle_fail
+exception Over_max_fail
+exception Max_fail
+
+(* Mapped sets for leaves *)
+let map_leaf asta = (Asta.bot_states_s asta, StateSet.empty)
+
+(* Build the Oracle *)
+let rec bu_oracle asta run tree tnode =
+ let node = Tree.preorder tree tnode in
+ if Tree.is_leaf tree tnode
+ then
+ if tnode == Tree.nil
+ then ()
+ else NodeHash.add run node (map_leaf asta)
+ else
+ let tfnode = Tree.first_child_x tree tnode
+ and tnnode = Tree.next_sibling tree tnode in
+ let fnode,nnode = (* their preorders *)
+ (Tree.preorder tree tfnode, Tree.preorder tree tnnode) in
+ begin
+ bu_oracle asta run tree tfnode;
+ bu_oracle asta run tree tnnode;
+ let q_rec n = (* compute the set for child/sibling *)
+ try NodeHash.find run n
+ with Not_found -> map_leaf asta in
+ let (_,qfr),(_,qnr) = q_rec fnode,q_rec nnode (* computed in rec call *)
+ and lab = Tree.tag tree tnode in
+ let _,list_tr = Asta.transitions_lab asta lab in (* only reco. tran.*)
+ let rec result set flag = function (* add states which satisfy a transition *)
+ | [] -> set,flag
+ | (q,form) :: tl ->
+ if Formula.eval_form (set,qfr,qnr) form (* evaluates the formula*)
+ then
+ if StateSet.mem q set
+ then result set 0 tl
+ else result (StateSet.add q set) 1 tl
+ else result set 0 tl in
+ let rec fix_point set_i = (* compute the fixed point of states of node *)
+ let set,flag = result set_i 0 list_tr in
+ if flag = 0 then set
+ else fix_point set in
+ NodeHash.add run node (StateSet.empty, fix_point StateSet.empty)
+ end
+
+(* Build the over-approx. of the maximal run *)
+let rec bu_over_max asta run tree tnode =
+ if (Tree.is_leaf tree tnode) (* BU_oracle has already created the map *)
+ then
+ ()
+ else
+ let tfnode = Tree.first_child_x tree tnode
+ and tnnode = Tree.next_sibling tree tnode in
+ begin
+ bu_over_max asta run tree tfnode;
+ bu_over_max asta run tree tnnode;
+ let (fnode,nnode) =
+ (Tree.preorder tree tfnode, Tree.preorder tree tnnode)
+ and node = Tree.preorder tree tnode in
+ let q_rec n =
+ try NodeHash.find run n
+ with Not_found -> map_leaf asta in
+ let qf,qn = q_rec fnode,q_rec nnode in
+ let lab = Tree.tag tree tnode in
+ let list_tr,_ = Asta.transitions_lab asta lab (* only take query st. *)
+ and _,resultr = try NodeHash.find run node
+ with _ -> raise Over_max_fail in
+ let rec result set flag = function
+ | [] -> if flag = 0 then set else result set 0 list_tr
+ | (q,form) :: tl ->
+ if StateSet.mem q set
+ then result set 0 tl
+ else if Formula.infer_form (set,resultr) qf qn form
+ then result (StateSet.add q set) 1 tl
+ else result set 0 tl in
+ let result_set = result StateSet.empty 0 list_tr in
+ (* we keep the old recognizing states set *)
+ NodeHash.replace run node (result_set, resultr)
+ end
+
+
+(* Build the maximal run *)
+let rec tp_max asta run tree tnode =
+ if (Tree.is_leaf tree tnode) (* BU_oracle has already created the map *)
+ then
+ ()
+ else
+ let node = Tree.preorder tree tnode
+ and tfnode = Tree.first_child_x tree tnode
+ and tnnode = Tree.next_sibling tree tnode in
+ let (fnode,nnode) =
+ (Tree.preorder tree tfnode, Tree.preorder tree tnnode) in
+ begin
+ if tnode == Tree.root tree (* we must intersect with top states *)
+ then let setq,_ = try NodeHash.find run node
+ with _ -> raise Max_fail in
+ NodeHash.replace run node
+ ((StateSet.inter (Asta.top_states_s asta) setq),StateSet.empty)
+ else ();
+ let q_rec n =
+ try NodeHash.find run n
+ with Not_found -> map_leaf asta in
+ let qf,qn = q_rec fnode,q_rec nnode in
+ let lab = Tree.tag tree tnode in
+ let list_tr,_ = Asta.transitions_lab asta lab in (* only take query. *)
+ let (self_q,self_r) = try NodeHash.find run node
+ with Not_found -> raise Max_fail in