1 (***********************************************************************)
5 (* Lucca Hirschi, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2012 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
24 module NodeHash = Hashtbl.Make (Node)
26 type t = (StateSet.t*StateSet.t) NodeHash.t
27 (** Map from nodes to query and recognizing states *)
28 (* Note that we do not consider nil nodes *)
31 exception Over_max_fail
34 (* Mapped sets for leaves *)
35 let map_leaf asta = (Asta.bot_states_s asta, StateSet.empty)
37 (* Build the Oracle *)
38 let rec bu_oracle asta run tree tnode =
39 let node = Tree.preorder tree tnode in
40 if Tree.is_leaf tree tnode
44 else NodeHash.add run node (map_leaf asta)
46 let tfnode = Tree.first_child tree tnode (* first child *)
47 and tnnode = Tree.next_sibling tree tnode in (* next-sibling *)
48 let fnode,nnode = (* their preorders *)
49 (Tree.preorder tree tfnode, Tree.preorder tree tnnode) in
51 bu_oracle asta run tree tfnode;
52 bu_oracle asta run tree tnnode;
53 let q_rec n = (* compute the set for child/sibling *)
54 try NodeHash.find run n
55 with Not_found -> map_leaf asta in
56 let (_,qfr),(_,qnr) = q_rec fnode,q_rec nnode (* computed in rec call *)
57 and lab = Tree.tag tree tnode in
58 let _,list_tr = Asta.transitions_lab asta lab in (* only reco. tran.*)
59 let rec result set flag = function (* add states which satisfy a transition *)
62 if Formula.eval_form (set,qfr,qnr) form (* evaluates the formula*)
66 else result (StateSet.add q set) 1 tl
67 else result set 0 tl in
68 let rec fix_point set_i = (* compute the fixed point of states of node *)
69 let set,flag = result set_i 0 list_tr in
72 NodeHash.add run node (StateSet.empty, fix_point StateSet.empty)
75 (* Build the over-approx. of the maximal run *)
76 let rec bu_over_max asta run tree tnode =
77 if (Tree.is_leaf tree tnode) (* BU_oracle has already created the map *)
81 let tfnode = Tree.first_child tree tnode
82 and tnnode = Tree.next_sibling tree tnode in
84 bu_over_max asta run tree tfnode;
85 bu_over_max asta run tree tnnode;
87 (Tree.preorder tree tfnode, Tree.preorder tree tnnode)
88 and node = Tree.preorder tree tnode in
90 try NodeHash.find run n
91 with Not_found -> map_leaf asta in
92 let qf,qn = q_rec fnode,q_rec nnode in
93 let lab = Tree.tag tree tnode in
94 let list_tr,_ = Asta.transitions_lab asta lab (* only take query st. *)
95 and _,resultr = try NodeHash.find run node
96 with _ -> raise Over_max_fail in
97 let rec result set flag = function
100 if Formula.infer_form (set,resultr) qf qn form (* infers the formula*)
101 then if StateSet.mem q set
103 else result (StateSet.add q set) 1 tl
104 else result set 0 tl in
105 let rec fix_point set_i =
106 let set,flag = result set_i 0 list_tr in
109 else fix_point set in
110 let result_set = fix_point StateSet.empty in
111 (* we keep the old recognizing states set *)
112 NodeHash.replace run node (result_set, resultr)
116 (* Build the maximal run *)
117 let rec tp_max asta run tree tnode =
118 if (Tree.is_leaf tree tnode) (* BU_oracle has already created the map *)
122 let node = Tree.preorder tree tnode
123 and tfnode = Tree.first_child tree tnode
124 and tnnode = Tree.next_sibling tree tnode in
126 (Tree.preorder tree tfnode, Tree.preorder tree tnnode) in
128 if tnode == Tree.root tree (* we must intersect with top states *)
129 then let setq,_ = try NodeHash.find run node
130 with _ -> raise Max_fail in
131 NodeHash.replace run node
132 ((StateSet.inter (Asta.top_states_s asta) setq),StateSet.empty)
135 try NodeHash.find run n
136 with Not_found -> map_leaf asta in
137 let qf,qn = q_rec fnode,q_rec nnode in
138 let lab = Tree.tag tree tnode in
139 let list_tr,_ = Asta.transitions_lab asta lab in (* only take query. *)
140 let set_node,_ = try NodeHash.find run node
141 with _ -> raise Max_fail in
142 let self = try NodeHash.find run node
143 with Not_found -> raise Max_fail in
144 let rec result = function
147 if (Formula.infer_form self qf qn form) &&
148 (StateSet.mem q set_node) (* infers & trans. can start here *)
149 then form :: (result tl)
151 let list_form = result list_tr in (* tran. candidates *)
152 (* compute states occuring in transition candidates *)
153 let rec add_st (ql,qr) = function
155 | f :: tl -> let sql,sqr = Formula.st f in
156 let ql' = StateSet.union sql ql
157 and qr' = StateSet.union sqr qr in
158 add_st (ql',qr') tl in
159 let ql,qr = add_st (StateSet.empty, StateSet.empty) list_form in
160 let qfq,qfr = try NodeHash.find run fnode
161 with | _ -> map_leaf asta
162 and qnq,qnr = try NodeHash.find run nnode
163 with | _ -> map_leaf asta in
165 if tfnode == Tree.nil
167 else NodeHash.replace run fnode (StateSet.inter qfq ql,qfr);
168 if tnnode == Tree.nil
170 else NodeHash.replace run nnode (StateSet.inter qnq qr,qnr);
171 tp_max asta run tree tfnode;
172 tp_max asta run tree tnnode;
176 let compute tree asta =
177 let flag = 2 in (* debug *)
178 let size_tree = 10000 in (* todo (Tree.size ?) *)
179 let map = NodeHash.create size_tree in
180 bu_oracle asta map tree (Tree.root tree);
181 if flag > 0 then begin
182 bu_over_max asta map tree (Tree.root tree);
185 tp_max asta map tree (Tree.root tree)
191 let selected_nodes tree asta =
192 let run = compute tree asta in
195 if not(StateSet.is_empty
196 (StateSet.inter (fst set) (Asta.selec_states asta)))
202 let print_d_set fmt (s_1,s_2) =
203 Format.fprintf fmt "(%a,%a)"
204 StateSet.print s_1 StateSet.print s_2 in
205 let print_map fmt run =
206 let pp = Format.fprintf fmt in
207 if NodeHash.length run = 0
208 then Format.fprintf fmt "ø"
210 NodeHash.iter (fun cle set -> pp "| %i->%a @ " cle print_d_set set)
212 let print_box fmt run =
213 let pp = Format.fprintf fmt in
214 pp "@[<hov 0>@. # Mapping:@. @[<hov 0>%a@]@]"
217 Format.fprintf fmt "@[<hov 0>##### RUN #####@, %a@]@." print_box run