-let get_trans a tag states =
- let trs =
- Cache.N2.find a.cache2
- (tag.QName.id :> int) (states.StateSet.id :> int)
- in
- if trs == dummy2 then
- let trs = get_trans_aux a tag states in
- (Cache.N2.add
- a.cache2
- (tag.QName.id :> int)
- (states.StateSet.id :> int) trs; trs)
- else trs
-
-let simplify_atom atom pos q { Config.node=config; _ } =
- if (pos && StateSet.mem q config.sat)
- || ((not pos) && StateSet.mem q config.unsat) then Formula.true_
- else if (pos && StateSet.mem q config.unsat)
- || ((not pos) && StateSet.mem q config.sat) then Formula.false_
- else atom
-
-let eval_form phi fcs nss ps ss summary =
- let rec loop phi =
- begin match Formula.expr phi with
- Boolean.True | Boolean.False -> phi
- | Boolean.Atom (a, b) ->
- begin
- match a.Atom.node with
- | Move (m, q) ->
- let states = match m with
- `First_child -> fcs
- | `Next_sibling -> nss
- | `Parent | `Previous_sibling -> ps
- | `Stay -> ss
- in simplify_atom phi b q states
- | Is_first_child -> Formula.of_bool (b == (is_left summary))
- | Is_next_sibling -> Formula.of_bool (b == (is_right summary))
- | Is k -> Formula.of_bool (b == (k == (kind summary)))
- | Has_first_child -> Formula.of_bool (b == (has_left summary))
- | Has_next_sibling -> Formula.of_bool (b == (has_right summary))
- end
- | Boolean.And(phi1, phi2) -> Formula.and_ (loop phi1) (loop phi2)
- | Boolean.Or (phi1, phi2) -> Formula.or_ (loop phi1) (loop phi2)
- end
- in
- loop phi
-
-
-
-let eval_trans auto fcs nss ps ss =
- let fcsid = (fcs.Config.id :> int) in
- let nssid = (nss.Config.id :> int) in
- let psid = (ps.Config.id :> int) in
- let rec loop old_config =
- let oid = (old_config.Config.id :> int) in
- let res =
- let res = Cache.N4.find auto.cache4 oid fcsid nssid psid in
- if res != dummy_config then res
- else
- let { sat = old_sat;
- unsat = old_unsat;
- todo = old_todo;
- summary = old_summary } = old_config.Config.node
- in
- let sat, unsat, removed, kept, todo =
- TransList.fold
- (fun trs acc ->
- let q, lab, phi = Transition.node trs in
- let a_sat, a_unsat, a_rem, a_kept, a_todo = acc in
- if StateSet.mem q a_sat || StateSet.mem q a_unsat then acc else
- let new_phi =
- eval_form phi fcs nss ps old_config old_summary
- in
- if Formula.is_true new_phi then
- StateSet.add q a_sat, a_unsat, StateSet.add q a_rem, a_kept, a_todo
- else if Formula.is_false new_phi then
- a_sat, StateSet.add q a_unsat, StateSet.add q a_rem, a_kept, a_todo
- else
- let new_tr = Transition.make (q, lab, new_phi) in
- (a_sat, a_unsat, a_rem, StateSet.add q a_kept, (TransList.cons new_tr a_todo))
- ) old_todo (old_sat, old_unsat, StateSet.empty, StateSet.empty, TransList.nil)
- in
- (* States that have been removed from the todo list and not kept are now
- unsatisfiable *)
- let unsat = StateSet.union unsat (StateSet.diff removed kept) in
- (* States that were found once to be satisfiable remain so *)
- let unsat = StateSet.diff unsat sat in
- let new_config = Config.make { old_config.Config.node with sat; unsat; todo; } in
- Cache.N4.add auto.cache4 oid fcsid nssid psid new_config;
- new_config
- in
- if res == old_config then res else loop res
- in
- loop ss
-
-(*
- [add_trans a q labels f] adds a transition [(q,labels) -> f] to the
- automaton [a] but ensures that transitions remains pairwise disjoint
-*)
-
-let add_trans a q s f =
- let trs = try Hashtbl.find a.transitions q with Not_found -> [] in
- let cup, ntrs =
- List.fold_left (fun (acup, atrs) (labs, phi) ->
- let lab1 = QNameSet.inter labs s in
- let lab2 = QNameSet.diff labs s in
- let tr1 =
- if QNameSet.is_empty lab1 then []
- else [ (lab1, Formula.or_ phi f) ]
- in
- let tr2 =
- if QNameSet.is_empty lab2 then []
- else [ (lab2, Formula.or_ phi f) ]
- in
- (QNameSet.union acup labs, tr1@ tr2 @ atrs)
- ) (QNameSet.empty, []) trs
- in
- let rem = QNameSet.diff s cup in
- let ntrs = if QNameSet.is_empty rem then ntrs
- else (rem, f) :: ntrs
- in
- Hashtbl.replace a.transitions q ntrs