author | nipkow |
Fri, 02 Oct 1998 14:28:39 +0200 | |
changeset 5608 | a82a038a3e7a |
parent 5536 | 130f3d891fb2 |
child 5620 | 3ac11c4af76a |
permissions | -rw-r--r-- |
4776 | 1 |
(* Title: HOL/UNITY/WFair |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1998 University of Cambridge |
|
5 |
||
6 |
Weak Fairness versions of transient, ensures, leadsTo. |
|
7 |
||
8 |
From Misra, "A Logic for Concurrent Programming", 1994 |
|
9 |
*) |
|
10 |
||
11 |
||
5340 | 12 |
(*Map its type, [('a * 'a)set set] => ('a set * 'a set) set, to just 'a*) |
13 |
Blast.overloaded ("WFair.leadsto", |
|
14 |
#1 o HOLogic.dest_prodT o |
|
15 |
HOLogic.dest_setT o HOLogic.dest_setT o domain_type); |
|
16 |
||
17 |
overload_2nd_set "WFair.transient"; |
|
18 |
overload_2nd_set "WFair.ensures"; |
|
19 |
||
4776 | 20 |
(*** transient ***) |
21 |
||
5069 | 22 |
Goalw [stable_def, constrains_def, transient_def] |
5253 | 23 |
"[| stable acts A; transient acts A |] ==> A = {}"; |
4776 | 24 |
by (Blast_tac 1); |
25 |
qed "stable_transient_empty"; |
|
26 |
||
5069 | 27 |
Goalw [transient_def] |
5253 | 28 |
"[| transient acts A; B<=A |] ==> transient acts B"; |
4776 | 29 |
by (Clarify_tac 1); |
30 |
by (rtac bexI 1 THEN assume_tac 2); |
|
31 |
by (Blast_tac 1); |
|
32 |
qed "transient_strengthen"; |
|
33 |
||
5069 | 34 |
Goalw [transient_def] |
5490 | 35 |
"[| act:acts; A <= Domain act; act^^A <= -A |] ==> transient acts A"; |
4776 | 36 |
by (Blast_tac 1); |
37 |
qed "transient_mem"; |
|
38 |
||
39 |
||
40 |
(*** ensures ***) |
|
41 |
||
5069 | 42 |
Goalw [ensures_def] |
5253 | 43 |
"[| constrains acts (A-B) (A Un B); transient acts (A-B) |] \ |
44 |
\ ==> ensures acts A B"; |
|
4776 | 45 |
by (Blast_tac 1); |
46 |
qed "ensuresI"; |
|
47 |
||
5069 | 48 |
Goalw [ensures_def] |
5253 | 49 |
"ensures acts A B \ |
50 |
\ ==> constrains acts (A-B) (A Un B) & transient acts (A-B)"; |
|
4776 | 51 |
by (Blast_tac 1); |
52 |
qed "ensuresD"; |
|
53 |
||
54 |
(*The L-version (precondition strengthening) doesn't hold for ENSURES*) |
|
5069 | 55 |
Goalw [ensures_def] |
5253 | 56 |
"[| ensures acts A A'; A'<=B' |] ==> ensures acts A B'"; |
4776 | 57 |
by (blast_tac (claset() addIs [constrains_weaken, transient_strengthen]) 1); |
58 |
qed "ensures_weaken_R"; |
|
59 |
||
5069 | 60 |
Goalw [ensures_def, constrains_def, transient_def] |
5253 | 61 |
"acts ~= {} ==> ensures acts A UNIV"; |
5340 | 62 |
by Auto_tac; |
4776 | 63 |
qed "ensures_UNIV"; |
64 |
||
5069 | 65 |
Goalw [ensures_def] |
5253 | 66 |
"[| stable acts C; \ |
67 |
\ constrains acts (C Int (A - A')) (A Un A'); \ |
|
68 |
\ transient acts (C Int (A-A')) |] \ |
|
69 |
\ ==> ensures acts (C Int A) (C Int A')"; |
|
4776 | 70 |
by (asm_simp_tac (simpset() addsimps [Int_Un_distrib RS sym, |
71 |
Diff_Int_distrib RS sym, |
|
72 |
stable_constrains_Int]) 1); |
|
73 |
qed "stable_ensures_Int"; |
|
74 |
||
75 |
||
76 |
(*** leadsTo ***) |
|
77 |
||
78 |
(*Synonyms for the theorems produced by the inductive defn package*) |
|
79 |
bind_thm ("leadsTo_Basis", leadsto.Basis); |
|
80 |
bind_thm ("leadsTo_Trans", leadsto.Trans); |
|
81 |
||
5253 | 82 |
Goal "act: acts ==> leadsTo acts A UNIV"; |
4776 | 83 |
by (blast_tac (claset() addIs [ensures_UNIV RS leadsTo_Basis]) 1); |
84 |
qed "leadsTo_UNIV"; |
|
85 |
Addsimps [leadsTo_UNIV]; |
|
86 |
||
87 |
(*Useful with cancellation, disjunction*) |
|
5253 | 88 |
Goal "leadsTo acts A (A' Un A') ==> leadsTo acts A A'"; |
4776 | 89 |
by (asm_full_simp_tac (simpset() addsimps Un_ac) 1); |
90 |
qed "leadsTo_Un_duplicate"; |
|
91 |
||
5253 | 92 |
Goal "leadsTo acts A (A' Un C Un C) ==> leadsTo acts A (A' Un C)"; |
4776 | 93 |
by (asm_full_simp_tac (simpset() addsimps Un_ac) 1); |
94 |
qed "leadsTo_Un_duplicate2"; |
|
95 |
||
96 |
(*The Union introduction rule as we should have liked to state it*) |
|
97 |
val prems = goal thy |
|
5253 | 98 |
"(!!A. A : S ==> leadsTo acts A B) ==> leadsTo acts (Union S) B"; |
4776 | 99 |
by (blast_tac (claset() addIs (leadsto.Union::prems)) 1); |
100 |
qed "leadsTo_Union"; |
|
101 |
||
102 |
val prems = goal thy |
|
5253 | 103 |
"(!!i. i : I ==> leadsTo acts (A i) B) ==> leadsTo acts (UN i:I. A i) B"; |
4776 | 104 |
by (simp_tac (simpset() addsimps [Union_image_eq RS sym]) 1); |
105 |
by (blast_tac (claset() addIs (leadsto.Union::prems)) 1); |
|
106 |
qed "leadsTo_UN"; |
|
107 |
||
108 |
(*Binary union introduction rule*) |
|
5253 | 109 |
Goal "[| leadsTo acts A C; leadsTo acts B C |] ==> leadsTo acts (A Un B) C"; |
4776 | 110 |
by (stac Un_eq_Union 1); |
111 |
by (blast_tac (claset() addIs [leadsTo_Union]) 1); |
|
112 |
qed "leadsTo_Un"; |
|
113 |
||
114 |
||
115 |
(*The INDUCTION rule as we should have liked to state it*) |
|
116 |
val major::prems = goal thy |
|
5253 | 117 |
"[| leadsTo acts za zb; \ |
118 |
\ !!A B. ensures acts A B ==> P A B; \ |
|
119 |
\ !!A B C. [| leadsTo acts A B; P A B; leadsTo acts B C; P B C |] \ |
|
4776 | 120 |
\ ==> P A C; \ |
5253 | 121 |
\ !!B S. ALL A:S. leadsTo acts A B & P A B ==> P (Union S) B \ |
4776 | 122 |
\ |] ==> P za zb"; |
5232 | 123 |
by (rtac (major RS leadsto.induct) 1); |
4776 | 124 |
by (REPEAT (blast_tac (claset() addIs prems) 1)); |
125 |
qed "leadsTo_induct"; |
|
126 |
||
127 |
||
5608 | 128 |
Goal "[| A<=B; Id: acts |] ==> leadsTo acts A B"; |
4776 | 129 |
by (rtac leadsTo_Basis 1); |
130 |
by (rewrite_goals_tac [ensures_def, constrains_def, transient_def]); |
|
131 |
by (Blast_tac 1); |
|
132 |
qed "subset_imp_leadsTo"; |
|
133 |
||
134 |
bind_thm ("empty_leadsTo", empty_subsetI RS subset_imp_leadsTo); |
|
135 |
Addsimps [empty_leadsTo]; |
|
136 |
||
137 |
||
138 |
(*There's a direct proof by leadsTo_Trans and subset_imp_leadsTo, but it |
|
5608 | 139 |
needs the extra premise Id:acts*) |
5253 | 140 |
Goal "leadsTo acts A A' ==> A'<=B' --> leadsTo acts A B'"; |
4776 | 141 |
by (etac leadsTo_induct 1); |
142 |
by (Clarify_tac 3); |
|
143 |
by (blast_tac (claset() addIs [leadsTo_Union]) 3); |
|
144 |
by (blast_tac (claset() addIs [leadsTo_Trans]) 2); |
|
145 |
by (blast_tac (claset() addIs [leadsTo_Basis, ensures_weaken_R]) 1); |
|
146 |
qed_spec_mp "leadsTo_weaken_R"; |
|
147 |
||
148 |
||
5608 | 149 |
Goal "[| leadsTo acts A A'; B<=A; Id: acts |] ==> \ |
5253 | 150 |
\ leadsTo acts B A'"; |
4776 | 151 |
by (blast_tac (claset() addIs [leadsTo_Basis, leadsTo_Trans, |
152 |
subset_imp_leadsTo]) 1); |
|
153 |
qed_spec_mp "leadsTo_weaken_L"; |
|
154 |
||
155 |
(*Distributes over binary unions*) |
|
5608 | 156 |
Goal "Id: acts ==> \ |
5253 | 157 |
\ leadsTo acts (A Un B) C = (leadsTo acts A C & leadsTo acts B C)"; |
4776 | 158 |
by (blast_tac (claset() addIs [leadsTo_Un, leadsTo_weaken_L]) 1); |
159 |
qed "leadsTo_Un_distrib"; |
|
160 |
||
5608 | 161 |
Goal "Id: acts ==> \ |
5253 | 162 |
\ leadsTo acts (UN i:I. A i) B = (ALL i : I. leadsTo acts (A i) B)"; |
4776 | 163 |
by (blast_tac (claset() addIs [leadsTo_UN, leadsTo_weaken_L]) 1); |
164 |
qed "leadsTo_UN_distrib"; |
|
165 |
||
5608 | 166 |
Goal "Id: acts ==> \ |
5253 | 167 |
\ leadsTo acts (Union S) B = (ALL A : S. leadsTo acts A B)"; |
4776 | 168 |
by (blast_tac (claset() addIs [leadsTo_Union, leadsTo_weaken_L]) 1); |
169 |
qed "leadsTo_Union_distrib"; |
|
170 |
||
171 |
||
5608 | 172 |
Goal "[| leadsTo acts A A'; Id: acts; B<=A; A'<=B' |] \ |
5253 | 173 |
\ ==> leadsTo acts B B'"; |
5340 | 174 |
by (blast_tac (claset() addIs [leadsTo_weaken_R, leadsTo_weaken_L, |
175 |
leadsTo_Trans]) 1); |
|
4776 | 176 |
qed "leadsTo_weaken"; |
177 |
||
178 |
||
179 |
(*Set difference: maybe combine with leadsTo_weaken_L??*) |
|
5608 | 180 |
Goal "[| leadsTo acts (A-B) C; leadsTo acts B C; Id: acts |] \ |
5253 | 181 |
\ ==> leadsTo acts A C"; |
4776 | 182 |
by (blast_tac (claset() addIs [leadsTo_Un, leadsTo_weaken]) 1); |
183 |
qed "leadsTo_Diff"; |
|
184 |
||
185 |
||
186 |
(** Meta or object quantifier ??? |
|
187 |
see ball_constrains_UN in UNITY.ML***) |
|
188 |
||
189 |
val prems = goal thy |
|
5253 | 190 |
"(!! i. i:I ==> leadsTo acts (A i) (A' i)) \ |
191 |
\ ==> leadsTo acts (UN i:I. A i) (UN i:I. A' i)"; |
|
4776 | 192 |
by (simp_tac (simpset() addsimps [Union_image_eq RS sym]) 1); |
193 |
by (blast_tac (claset() addIs [leadsTo_Union, leadsTo_weaken_R] |
|
194 |
addIs prems) 1); |
|
195 |
qed "leadsTo_UN_UN"; |
|
196 |
||
197 |
||
198 |
(*Version with no index set*) |
|
199 |
val prems = goal thy |
|
5253 | 200 |
"(!! i. leadsTo acts (A i) (A' i)) \ |
201 |
\ ==> leadsTo acts (UN i. A i) (UN i. A' i)"; |
|
4776 | 202 |
by (blast_tac (claset() addIs [leadsTo_UN_UN] |
203 |
addIs prems) 1); |
|
204 |
qed "leadsTo_UN_UN_noindex"; |
|
205 |
||
206 |
(*Version with no index set*) |
|
5253 | 207 |
Goal "ALL i. leadsTo acts (A i) (A' i) \ |
208 |
\ ==> leadsTo acts (UN i. A i) (UN i. A' i)"; |
|
4776 | 209 |
by (blast_tac (claset() addIs [leadsTo_UN_UN]) 1); |
210 |
qed "all_leadsTo_UN_UN"; |
|
211 |
||
212 |
||
213 |
(*Binary union version*) |
|
5253 | 214 |
Goal "[| leadsTo acts A A'; leadsTo acts B B' |] \ |
215 |
\ ==> leadsTo acts (A Un B) (A' Un B')"; |
|
4776 | 216 |
by (blast_tac (claset() addIs [leadsTo_Un, |
217 |
leadsTo_weaken_R]) 1); |
|
218 |
qed "leadsTo_Un_Un"; |
|
219 |
||
220 |
||
221 |
(** The cancellation law **) |
|
222 |
||
5608 | 223 |
Goal "[| leadsTo acts A (A' Un B); leadsTo acts B B'; Id: acts |] \ |
5253 | 224 |
\ ==> leadsTo acts A (A' Un B')"; |
4776 | 225 |
by (blast_tac (claset() addIs [leadsTo_Un_Un, |
226 |
subset_imp_leadsTo, leadsTo_Trans]) 1); |
|
227 |
qed "leadsTo_cancel2"; |
|
228 |
||
5608 | 229 |
Goal "[| leadsTo acts A (A' Un B); leadsTo acts (B-A') B'; Id: acts |] \ |
5253 | 230 |
\ ==> leadsTo acts A (A' Un B')"; |
4776 | 231 |
by (rtac leadsTo_cancel2 1); |
232 |
by (assume_tac 2); |
|
233 |
by (ALLGOALS Asm_simp_tac); |
|
234 |
qed "leadsTo_cancel_Diff2"; |
|
235 |
||
5608 | 236 |
Goal "[| leadsTo acts A (B Un A'); leadsTo acts B B'; Id: acts |] \ |
5253 | 237 |
\ ==> leadsTo acts A (B' Un A')"; |
4776 | 238 |
by (asm_full_simp_tac (simpset() addsimps [Un_commute]) 1); |
239 |
by (blast_tac (claset() addSIs [leadsTo_cancel2]) 1); |
|
240 |
qed "leadsTo_cancel1"; |
|
241 |
||
5608 | 242 |
Goal "[| leadsTo acts A (B Un A'); leadsTo acts (B-A') B'; Id: acts |] \ |
5253 | 243 |
\ ==> leadsTo acts A (B' Un A')"; |
4776 | 244 |
by (rtac leadsTo_cancel1 1); |
245 |
by (assume_tac 2); |
|
246 |
by (ALLGOALS Asm_simp_tac); |
|
247 |
qed "leadsTo_cancel_Diff1"; |
|
248 |
||
249 |
||
250 |
||
251 |
(** The impossibility law **) |
|
252 |
||
5253 | 253 |
Goal "leadsTo acts A B ==> B={} --> A={}"; |
4776 | 254 |
by (etac leadsTo_induct 1); |
255 |
by (ALLGOALS Asm_simp_tac); |
|
256 |
by (rewrite_goals_tac [ensures_def, constrains_def, transient_def]); |
|
257 |
by (Blast_tac 1); |
|
258 |
val lemma = result() RS mp; |
|
259 |
||
5253 | 260 |
Goal "leadsTo acts A {} ==> A={}"; |
4776 | 261 |
by (blast_tac (claset() addSIs [lemma]) 1); |
262 |
qed "leadsTo_empty"; |
|
263 |
||
264 |
||
265 |
(** PSP: Progress-Safety-Progress **) |
|
266 |
||
5608 | 267 |
(*Special case of PSP: Misra's "stable conjunction". Doesn't need Id:acts. *) |
5069 | 268 |
Goalw [stable_def] |
5253 | 269 |
"[| leadsTo acts A A'; stable acts B |] \ |
270 |
\ ==> leadsTo acts (A Int B) (A' Int B)"; |
|
4776 | 271 |
by (etac leadsTo_induct 1); |
272 |
by (simp_tac (simpset() addsimps [Int_Union_Union]) 3); |
|
273 |
by (blast_tac (claset() addIs [leadsTo_Union]) 3); |
|
274 |
by (blast_tac (claset() addIs [leadsTo_Trans]) 2); |
|
275 |
by (rtac leadsTo_Basis 1); |
|
276 |
by (asm_full_simp_tac |
|
277 |
(simpset() addsimps [ensures_def, |
|
278 |
Diff_Int_distrib2 RS sym, Int_Un_distrib2 RS sym]) 1); |
|
279 |
by (blast_tac (claset() addIs [transient_strengthen, constrains_Int]) 1); |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
280 |
qed "psp_stable"; |
4776 | 281 |
|
5253 | 282 |
Goal "[| leadsTo acts A A'; stable acts B |] \ |
283 |
\ ==> leadsTo acts (B Int A) (B Int A')"; |
|
5536 | 284 |
by (asm_simp_tac (simpset() addsimps psp_stable::Int_ac) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
285 |
qed "psp_stable2"; |
4776 | 286 |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
287 |
Goalw [ensures_def, constrains_def] |
5253 | 288 |
"[| ensures acts A A'; constrains acts B B' |] \ |
289 |
\ ==> ensures acts (A Int B) ((A' Int B) Un (B' - B))"; |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
290 |
by (blast_tac (claset() addIs [transient_strengthen]) 1); |
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
291 |
qed "psp_ensures"; |
4776 | 292 |
|
5608 | 293 |
Goal "[| leadsTo acts A A'; constrains acts B B'; Id: acts |] \ |
5253 | 294 |
\ ==> leadsTo acts (A Int B) ((A' Int B) Un (B' - B))"; |
4776 | 295 |
by (etac leadsTo_induct 1); |
296 |
by (simp_tac (simpset() addsimps [Int_Union_Union]) 3); |
|
297 |
by (blast_tac (claset() addIs [leadsTo_Union]) 3); |
|
298 |
(*Transitivity case has a delicate argument involving "cancellation"*) |
|
299 |
by (rtac leadsTo_Un_duplicate2 2); |
|
300 |
by (etac leadsTo_cancel_Diff1 2); |
|
301 |
by (assume_tac 3); |
|
302 |
by (asm_full_simp_tac (simpset() addsimps [Int_Diff, Diff_triv]) 2); |
|
303 |
(*Basis case*) |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
304 |
by (blast_tac (claset() addIs [leadsTo_Basis, psp_ensures]) 1); |
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
305 |
qed "psp"; |
4776 | 306 |
|
5608 | 307 |
Goal "[| leadsTo acts A A'; constrains acts B B'; Id: acts |] \ |
5253 | 308 |
\ ==> leadsTo acts (B Int A) ((B Int A') Un (B' - B))"; |
5536 | 309 |
by (asm_simp_tac (simpset() addsimps psp::Int_ac) 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
310 |
qed "psp2"; |
4776 | 311 |
|
312 |
||
5069 | 313 |
Goalw [unless_def] |
5608 | 314 |
"[| leadsTo acts A A'; unless acts B B'; Id: acts |] \ |
5253 | 315 |
\ ==> leadsTo acts (A Int B) ((A' Int B) Un B')"; |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
316 |
by (dtac psp 1); |
4776 | 317 |
by (assume_tac 1); |
318 |
by (asm_full_simp_tac (simpset() addsimps [Un_Diff_Diff, Int_Diff_Un]) 2); |
|
319 |
by (asm_full_simp_tac (simpset() addsimps [Diff_Int_distrib]) 2); |
|
320 |
by (etac leadsTo_Diff 2); |
|
321 |
by (blast_tac (claset() addIs [subset_imp_leadsTo]) 2); |
|
322 |
by Auto_tac; |
|
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
323 |
qed "psp_unless"; |
4776 | 324 |
|
325 |
||
326 |
(*** Proving the induction rules ***) |
|
327 |
||
5257 | 328 |
(** The most general rule: r is any wf relation; f is any variant function **) |
329 |
||
5239 | 330 |
Goal "[| wf r; \ |
5253 | 331 |
\ ALL m. leadsTo acts (A Int f-``{m}) \ |
5239 | 332 |
\ ((A Int f-``(r^-1 ^^ {m})) Un B); \ |
5608 | 333 |
\ Id: acts |] \ |
5253 | 334 |
\ ==> leadsTo acts (A Int f-``{m}) B"; |
4776 | 335 |
by (eres_inst_tac [("a","m")] wf_induct 1); |
5253 | 336 |
by (subgoal_tac "leadsTo acts (A Int (f -`` (r^-1 ^^ {x}))) B" 1); |
4776 | 337 |
by (stac vimage_eq_UN 2); |
338 |
by (asm_simp_tac (HOL_ss addsimps (UN_simps RL [sym])) 2); |
|
339 |
by (blast_tac (claset() addIs [leadsTo_UN]) 2); |
|
340 |
by (blast_tac (claset() addIs [leadsTo_cancel1, leadsTo_Un_duplicate]) 1); |
|
341 |
val lemma = result(); |
|
342 |
||
343 |
||
344 |
(** Meta or object quantifier ????? **) |
|
5239 | 345 |
Goal "[| wf r; \ |
5253 | 346 |
\ ALL m. leadsTo acts (A Int f-``{m}) \ |
5239 | 347 |
\ ((A Int f-``(r^-1 ^^ {m})) Un B); \ |
5608 | 348 |
\ Id: acts |] \ |
5253 | 349 |
\ ==> leadsTo acts A B"; |
4776 | 350 |
by (res_inst_tac [("t", "A")] subst 1); |
351 |
by (rtac leadsTo_UN 2); |
|
352 |
by (etac lemma 2); |
|
353 |
by (REPEAT (assume_tac 2)); |
|
354 |
by (Fast_tac 1); (*Blast_tac: Function unknown's argument not a parameter*) |
|
355 |
qed "leadsTo_wf_induct"; |
|
356 |
||
357 |
||
5239 | 358 |
Goal "[| wf r; \ |
5253 | 359 |
\ ALL m:I. leadsTo acts (A Int f-``{m}) \ |
5257 | 360 |
\ ((A Int f-``(r^-1 ^^ {m})) Un B); \ |
5608 | 361 |
\ Id: acts |] \ |
5253 | 362 |
\ ==> leadsTo acts A ((A - (f-``I)) Un B)"; |
4776 | 363 |
by (etac leadsTo_wf_induct 1); |
364 |
by Safe_tac; |
|
365 |
by (case_tac "m:I" 1); |
|
366 |
by (blast_tac (claset() addIs [leadsTo_weaken]) 1); |
|
367 |
by (blast_tac (claset() addIs [subset_imp_leadsTo]) 1); |
|
368 |
qed "bounded_induct"; |
|
369 |
||
370 |
||
5253 | 371 |
(*Alternative proof is via the lemma leadsTo acts (A Int f-``(lessThan m)) B*) |
372 |
Goal "[| ALL m. leadsTo acts (A Int f-``{m}) \ |
|
5239 | 373 |
\ ((A Int f-``(lessThan m)) Un B); \ |
5608 | 374 |
\ Id: acts |] \ |
5253 | 375 |
\ ==> leadsTo acts A B"; |
4776 | 376 |
by (rtac (wf_less_than RS leadsTo_wf_induct) 1); |
377 |
by (assume_tac 2); |
|
378 |
by (Asm_simp_tac 1); |
|
379 |
qed "lessThan_induct"; |
|
380 |
||
5253 | 381 |
Goal "[| ALL m:(greaterThan l). leadsTo acts (A Int f-``{m}) \ |
5239 | 382 |
\ ((A Int f-``(lessThan m)) Un B); \ |
5608 | 383 |
\ Id: acts |] \ |
5253 | 384 |
\ ==> leadsTo acts A ((A Int (f-``(atMost l))) Un B)"; |
4776 | 385 |
by (simp_tac (HOL_ss addsimps [Diff_eq RS sym, vimage_Compl, Compl_greaterThan RS sym]) 1); |
386 |
by (rtac (wf_less_than RS bounded_induct) 1); |
|
387 |
by (assume_tac 2); |
|
388 |
by (Asm_simp_tac 1); |
|
389 |
qed "lessThan_bounded_induct"; |
|
390 |
||
5253 | 391 |
Goal "[| ALL m:(lessThan l). leadsTo acts (A Int f-``{m}) \ |
5239 | 392 |
\ ((A Int f-``(greaterThan m)) Un B); \ |
5608 | 393 |
\ Id: acts |] \ |
5253 | 394 |
\ ==> leadsTo acts A ((A Int (f-``(atLeast l))) Un B)"; |
4776 | 395 |
by (res_inst_tac [("f","f"),("f1", "%k. l - k")] |
396 |
(wf_less_than RS wf_inv_image RS leadsTo_wf_induct) 1); |
|
397 |
by (assume_tac 2); |
|
398 |
by (simp_tac (simpset() addsimps [inv_image_def, Image_singleton]) 1); |
|
399 |
by (Clarify_tac 1); |
|
400 |
by (case_tac "m<l" 1); |
|
401 |
by (blast_tac (claset() addIs [not_leE, subset_imp_leadsTo]) 2); |
|
402 |
by (blast_tac (claset() addIs [leadsTo_weaken_R, diff_less_mono2]) 1); |
|
403 |
qed "greaterThan_bounded_induct"; |
|
404 |
||
405 |
||
406 |
||
407 |
(*** wlt ****) |
|
408 |
||
409 |
(*Misra's property W3*) |
|
5253 | 410 |
Goalw [wlt_def] "leadsTo acts (wlt acts B) B"; |
4776 | 411 |
by (blast_tac (claset() addSIs [leadsTo_Union]) 1); |
412 |
qed "wlt_leadsTo"; |
|
413 |
||
5253 | 414 |
Goalw [wlt_def] "leadsTo acts A B ==> A <= wlt acts B"; |
4776 | 415 |
by (blast_tac (claset() addSIs [leadsTo_Union]) 1); |
416 |
qed "leadsTo_subset"; |
|
417 |
||
418 |
(*Misra's property W2*) |
|
5608 | 419 |
Goal "Id: acts ==> leadsTo acts A B = (A <= wlt acts B)"; |
4776 | 420 |
by (blast_tac (claset() addSIs [leadsTo_subset, |
421 |
wlt_leadsTo RS leadsTo_weaken_L]) 1); |
|
422 |
qed "leadsTo_eq_subset_wlt"; |
|
423 |
||
424 |
(*Misra's property W4*) |
|
5608 | 425 |
Goal "Id: acts ==> B <= wlt acts B"; |
4776 | 426 |
by (asm_simp_tac (simpset() addsimps [leadsTo_eq_subset_wlt RS sym, |
427 |
subset_imp_leadsTo]) 1); |
|
428 |
qed "wlt_increasing"; |
|
429 |
||
430 |
||
431 |
(*Used in the Trans case below*) |
|
5069 | 432 |
Goalw [constrains_def] |
5111 | 433 |
"[| B <= A2; \ |
5253 | 434 |
\ constrains acts (A1 - B) (A1 Un B); \ |
435 |
\ constrains acts (A2 - C) (A2 Un C) |] \ |
|
436 |
\ ==> constrains acts (A1 Un A2 - C) (A1 Un A2 Un C)"; |
|
5521 | 437 |
by(Blast_tac 1); |
4776 | 438 |
val lemma1 = result(); |
439 |
||
440 |
||
441 |
(*Lemma (1,2,3) of Misra's draft book, Chapter 4, "Progress"*) |
|
5608 | 442 |
Goal "[| leadsTo acts A A'; Id: acts |] ==> \ |
5253 | 443 |
\ EX B. A<=B & leadsTo acts B A' & constrains acts (B-A') (B Un A')"; |
4776 | 444 |
by (etac leadsTo_induct 1); |
445 |
(*Basis*) |
|
446 |
by (blast_tac (claset() addIs [leadsTo_Basis] |
|
447 |
addDs [ensuresD]) 1); |
|
448 |
(*Trans*) |
|
449 |
by (Clarify_tac 1); |
|
450 |
by (res_inst_tac [("x", "Ba Un Bb")] exI 1); |
|
451 |
by (blast_tac (claset() addIs [lemma1, leadsTo_Un_Un, leadsTo_cancel1, |
|
452 |
leadsTo_Un_duplicate]) 1); |
|
453 |
(*Union*) |
|
454 |
by (clarify_tac (claset() addSDs [ball_conj_distrib RS iffD1, |
|
455 |
bchoice, ball_constrains_UN]) 1);; |
|
456 |
by (res_inst_tac [("x", "UN A:S. f A")] exI 1); |
|
457 |
by (blast_tac (claset() addIs [leadsTo_UN, constrains_weaken]) 1); |
|
458 |
qed "leadsTo_123"; |
|
459 |
||
460 |
||
461 |
(*Misra's property W5*) |
|
5608 | 462 |
Goal "Id: acts ==> constrains acts (wlt acts B - B) (wlt acts B)"; |
4776 | 463 |
by (forward_tac [wlt_leadsTo RS leadsTo_123] 1); |
464 |
by (Clarify_tac 1); |
|
5253 | 465 |
by (subgoal_tac "Ba = wlt acts B" 1); |
4776 | 466 |
by (blast_tac (claset() addDs [leadsTo_eq_subset_wlt]) 2); |
467 |
by (Clarify_tac 1); |
|
468 |
by (asm_full_simp_tac (simpset() addsimps [wlt_increasing, Un_absorb2]) 1); |
|
469 |
qed "wlt_constrains_wlt"; |
|
470 |
||
471 |
||
472 |
(*** Completion: Binary and General Finite versions ***) |
|
473 |
||
5253 | 474 |
Goal "[| leadsTo acts A A'; stable acts A'; \ |
5608 | 475 |
\ leadsTo acts B B'; stable acts B'; Id: acts |] \ |
5253 | 476 |
\ ==> leadsTo acts (A Int B) (A' Int B')"; |
477 |
by (subgoal_tac "stable acts (wlt acts B')" 1); |
|
4776 | 478 |
by (asm_full_simp_tac (simpset() addsimps [stable_def]) 2); |
479 |
by (EVERY [etac (constrains_Un RS constrains_weaken) 2, |
|
480 |
etac wlt_constrains_wlt 2, |
|
481 |
fast_tac (claset() addEs [wlt_increasing RSN (2,rev_subsetD)]) 3, |
|
482 |
Blast_tac 2]); |
|
5253 | 483 |
by (subgoal_tac "leadsTo acts (A Int wlt acts B') (A' Int wlt acts B')" 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
484 |
by (blast_tac (claset() addIs [psp_stable]) 2); |
5253 | 485 |
by (subgoal_tac "leadsTo acts (A' Int wlt acts B') (A' Int B')" 1); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
486 |
by (blast_tac (claset() addIs [wlt_leadsTo, psp_stable2]) 2); |
5253 | 487 |
by (subgoal_tac "leadsTo acts (A Int B) (A Int wlt acts B')" 1); |
4776 | 488 |
by (blast_tac (claset() addIs [leadsTo_subset RS subsetD, |
489 |
subset_imp_leadsTo]) 2); |
|
5479 | 490 |
by (blast_tac (claset() addIs [leadsTo_Trans]) 1); |
4776 | 491 |
qed "stable_completion"; |
492 |
||
493 |
||
5608 | 494 |
Goal "[| finite I; Id: acts |] \ |
5253 | 495 |
\ ==> (ALL i:I. leadsTo acts (A i) (A' i)) --> \ |
496 |
\ (ALL i:I. stable acts (A' i)) --> \ |
|
497 |
\ leadsTo acts (INT i:I. A i) (INT i:I. A' i)"; |
|
4776 | 498 |
by (etac finite_induct 1); |
499 |
by (Asm_simp_tac 1); |
|
500 |
by (asm_simp_tac |
|
501 |
(simpset() addsimps [stable_completion, stable_def, |
|
502 |
ball_constrains_INT]) 1); |
|
503 |
qed_spec_mp "finite_stable_completion"; |
|
504 |
||
505 |
||
5253 | 506 |
Goal "[| W = wlt acts (B' Un C); \ |
507 |
\ leadsTo acts A (A' Un C); constrains acts A' (A' Un C); \ |
|
508 |
\ leadsTo acts B (B' Un C); constrains acts B' (B' Un C); \ |
|
5608 | 509 |
\ Id: acts |] \ |
5253 | 510 |
\ ==> leadsTo acts (A Int B) ((A' Int B') Un C)"; |
511 |
by (subgoal_tac "constrains acts (W-C) (W Un B' Un C)" 1); |
|
4776 | 512 |
by (blast_tac (claset() addIs [[asm_rl, wlt_constrains_wlt] |
513 |
MRS constrains_Un RS constrains_weaken]) 2); |
|
5253 | 514 |
by (subgoal_tac "constrains acts (W-C) W" 1); |
4776 | 515 |
by (asm_full_simp_tac |
516 |
(simpset() addsimps [wlt_increasing, Un_assoc, Un_absorb2]) 2); |
|
5253 | 517 |
by (subgoal_tac "leadsTo acts (A Int W - C) (A' Int W Un C)" 1); |
4776 | 518 |
by (simp_tac (simpset() addsimps [Int_Diff]) 2); |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
519 |
by (blast_tac (claset() addIs [wlt_leadsTo, psp RS leadsTo_weaken_R]) 2); |
5456 | 520 |
(** LEVEL 7 **) |
5253 | 521 |
by (subgoal_tac "leadsTo acts (A' Int W Un C) (A' Int B' Un C)" 1); |
4776 | 522 |
by (blast_tac (claset() addIs [wlt_leadsTo, leadsTo_Un_Un, |
5277
e4297d03e5d2
A higher-level treatment of LeadsTo, minimizing use of "reachable"
paulson
parents:
5257
diff
changeset
|
523 |
psp2 RS leadsTo_weaken_R, |
4776 | 524 |
subset_refl RS subset_imp_leadsTo, |
525 |
leadsTo_Un_duplicate2]) 2); |
|
526 |
by (dtac leadsTo_Diff 1); |
|
527 |
by (assume_tac 2); |
|
528 |
by (blast_tac (claset() addIs [subset_imp_leadsTo]) 1); |
|
529 |
by (subgoal_tac "A Int B <= A Int W" 1); |
|
5456 | 530 |
by (blast_tac (claset() addSDs [leadsTo_subset] |
531 |
addSIs [subset_refl RS Int_mono]) 2); |
|
4776 | 532 |
by (blast_tac (claset() addIs [leadsTo_Trans, subset_imp_leadsTo]) 1); |
533 |
bind_thm("completion", refl RS result()); |
|
534 |
||
535 |
||
5608 | 536 |
Goal "[| finite I; Id: acts |] \ |
5253 | 537 |
\ ==> (ALL i:I. leadsTo acts (A i) (A' i Un C)) --> \ |
538 |
\ (ALL i:I. constrains acts (A' i) (A' i Un C)) --> \ |
|
539 |
\ leadsTo acts (INT i:I. A i) ((INT i:I. A' i) Un C)"; |
|
4776 | 540 |
by (etac finite_induct 1); |
541 |
by (ALLGOALS Asm_simp_tac); |
|
542 |
by (Clarify_tac 1); |
|
543 |
by (dtac ball_constrains_INT 1); |
|
544 |
by (asm_full_simp_tac (simpset() addsimps [completion]) 1); |
|
545 |
qed "finite_completion"; |
|
546 |