src/HOL/TLA/TLA.thy
author wenzelm
Wed May 23 16:53:12 2012 +0200 (2012-05-23)
changeset 47968 3119ad2b5ad3
parent 45605 a89b4bc311a5
child 51668 5e1108291c7f
permissions -rw-r--r--
eliminated old 'axioms';
wenzelm@35108
     1
(*  Title:      HOL/TLA/TLA.thy
wenzelm@35108
     2
    Author:     Stephan Merz
wenzelm@35108
     3
    Copyright:  1998 University of Munich
wenzelm@21624
     4
*)
wenzelm@3807
     5
wenzelm@21624
     6
header {* The temporal level of TLA *}
wenzelm@3807
     7
wenzelm@17309
     8
theory TLA
wenzelm@17309
     9
imports Init
wenzelm@17309
    10
begin
wenzelm@3807
    11
wenzelm@3807
    12
consts
wenzelm@6255
    13
  (** abstract syntax **)
wenzelm@17309
    14
  Box        :: "('w::world) form => temporal"
wenzelm@17309
    15
  Dmd        :: "('w::world) form => temporal"
wenzelm@17309
    16
  leadsto    :: "['w::world form, 'v::world form] => temporal"
wenzelm@17309
    17
  Stable     :: "stpred => temporal"
wenzelm@17309
    18
  WF         :: "[action, 'a stfun] => temporal"
wenzelm@17309
    19
  SF         :: "[action, 'a stfun] => temporal"
wenzelm@3807
    20
wenzelm@3807
    21
  (* Quantification over (flexible) state variables *)
wenzelm@17309
    22
  EEx        :: "('a stfun => temporal) => temporal"       (binder "Eex " 10)
wenzelm@17309
    23
  AAll       :: "('a stfun => temporal) => temporal"       (binder "Aall " 10)
wenzelm@6255
    24
wenzelm@6255
    25
  (** concrete syntax **)
wenzelm@6255
    26
syntax
wenzelm@17309
    27
  "_Box"     :: "lift => lift"                        ("([]_)" [40] 40)
wenzelm@17309
    28
  "_Dmd"     :: "lift => lift"                        ("(<>_)" [40] 40)
wenzelm@17309
    29
  "_leadsto" :: "[lift,lift] => lift"                 ("(_ ~> _)" [23,22] 22)
wenzelm@17309
    30
  "_stable"  :: "lift => lift"                        ("(stable/ _)")
wenzelm@17309
    31
  "_WF"      :: "[lift,lift] => lift"                 ("(WF'(_')'_(_))" [0,60] 55)
wenzelm@17309
    32
  "_SF"      :: "[lift,lift] => lift"                 ("(SF'(_')'_(_))" [0,60] 55)
wenzelm@6255
    33
wenzelm@17309
    34
  "_EEx"     :: "[idts, lift] => lift"                ("(3EEX _./ _)" [0,10] 10)
wenzelm@17309
    35
  "_AAll"    :: "[idts, lift] => lift"                ("(3AALL _./ _)" [0,10] 10)
wenzelm@3807
    36
wenzelm@3807
    37
translations
wenzelm@35068
    38
  "_Box"      ==   "CONST Box"
wenzelm@35068
    39
  "_Dmd"      ==   "CONST Dmd"
wenzelm@35068
    40
  "_leadsto"  ==   "CONST leadsto"
wenzelm@35068
    41
  "_stable"   ==   "CONST Stable"
wenzelm@35068
    42
  "_WF"       ==   "CONST WF"
wenzelm@35068
    43
  "_SF"       ==   "CONST SF"
wenzelm@6255
    44
  "_EEx v A"  ==   "Eex v. A"
wenzelm@6255
    45
  "_AAll v A" ==   "Aall v. A"
wenzelm@6255
    46
wenzelm@6255
    47
  "sigma |= []F"         <= "_Box F sigma"
wenzelm@6255
    48
  "sigma |= <>F"         <= "_Dmd F sigma"
wenzelm@6255
    49
  "sigma |= F ~> G"      <= "_leadsto F G sigma"
wenzelm@6255
    50
  "sigma |= stable P"    <= "_stable P sigma"
wenzelm@6255
    51
  "sigma |= WF(A)_v"     <= "_WF A v sigma"
wenzelm@6255
    52
  "sigma |= SF(A)_v"     <= "_SF A v sigma"
wenzelm@6255
    53
  "sigma |= EEX x. F"    <= "_EEx x F sigma"
wenzelm@6255
    54
  "sigma |= AALL x. F"    <= "_AAll x F sigma"
wenzelm@3807
    55
wenzelm@12114
    56
syntax (xsymbols)
wenzelm@17309
    57
  "_Box"     :: "lift => lift"                        ("(\<box>_)" [40] 40)
wenzelm@17309
    58
  "_Dmd"     :: "lift => lift"                        ("(\<diamond>_)" [40] 40)
wenzelm@17309
    59
  "_leadsto" :: "[lift,lift] => lift"                 ("(_ \<leadsto> _)" [23,22] 22)
wenzelm@17309
    60
  "_EEx"     :: "[idts, lift] => lift"                ("(3\<exists>\<exists> _./ _)" [0,10] 10)
wenzelm@17309
    61
  "_AAll"    :: "[idts, lift] => lift"                ("(3\<forall>\<forall> _./ _)" [0,10] 10)
wenzelm@3808
    62
kleing@14565
    63
syntax (HTML output)
wenzelm@17309
    64
  "_EEx"     :: "[idts, lift] => lift"                ("(3\<exists>\<exists> _./ _)" [0,10] 10)
wenzelm@17309
    65
  "_AAll"    :: "[idts, lift] => lift"                ("(3\<forall>\<forall> _./ _)" [0,10] 10)
kleing@14565
    66
wenzelm@47968
    67
axiomatization where
wenzelm@6255
    68
  (* Definitions of derived operators *)
wenzelm@47968
    69
  dmd_def:      "\<And>F. TEMP <>F  ==  TEMP ~[]~F"
wenzelm@47968
    70
wenzelm@47968
    71
axiomatization where
wenzelm@47968
    72
  boxInit:      "\<And>F. TEMP []F  ==  TEMP []Init F" and
wenzelm@47968
    73
  leadsto_def:  "\<And>F G. TEMP F ~> G  ==  TEMP [](Init F --> <>G)" and
wenzelm@47968
    74
  stable_def:   "\<And>P. TEMP stable P  ==  TEMP []($P --> P$)" and
wenzelm@47968
    75
  WF_def:       "TEMP WF(A)_v  ==  TEMP <>[] Enabled(<A>_v) --> []<><A>_v" and
wenzelm@47968
    76
  SF_def:       "TEMP SF(A)_v  ==  TEMP []<> Enabled(<A>_v) --> []<><A>_v" and
wenzelm@17309
    77
  aall_def:     "TEMP (AALL x. F x)  ==  TEMP ~ (EEX x. ~ F x)"
wenzelm@3807
    78
wenzelm@47968
    79
axiomatization where
wenzelm@6255
    80
(* Base axioms for raw TLA. *)
wenzelm@47968
    81
  normalT:    "\<And>F G. |- [](F --> G) --> ([]F --> []G)" and    (* polymorphic *)
wenzelm@47968
    82
  reflT:      "\<And>F. |- []F --> F" and         (* F::temporal *)
wenzelm@47968
    83
  transT:     "\<And>F. |- []F --> [][]F" and     (* polymorphic *)
wenzelm@47968
    84
  linT:       "\<And>F G. |- <>F & <>G --> (<>(F & <>G)) | (<>(G & <>F))" and
wenzelm@47968
    85
  discT:      "\<And>F. |- [](F --> <>(~F & <>F)) --> (F --> []<>F)" and
wenzelm@47968
    86
  primeI:     "\<And>P. |- []P --> Init P`" and
wenzelm@47968
    87
  primeE:     "\<And>P F. |- [](Init P --> []F) --> Init P` --> (F --> []F)" and
wenzelm@47968
    88
  indT:       "\<And>P F. |- [](Init P & ~[]F --> Init P` & F) --> Init P --> []F" and
wenzelm@47968
    89
  allT:       "\<And>F. |- (ALL x. [](F x)) = ([](ALL x. F x))"
wenzelm@3807
    90
wenzelm@47968
    91
axiomatization where
wenzelm@47968
    92
  necT:       "\<And>F. |- F ==> |- []F"      (* polymorphic *)
wenzelm@3807
    93
wenzelm@47968
    94
axiomatization where
wenzelm@3807
    95
(* Flexible quantification: refinement mappings, history variables *)
wenzelm@47968
    96
  eexI:       "|- F x --> (EEX x. F x)" and
wenzelm@17309
    97
  eexE:       "[| sigma |= (EEX x. F x); basevars vs;
wenzelm@17309
    98
                 (!!x. [| basevars (x, vs); sigma |= F x |] ==> (G sigma)::bool)
wenzelm@47968
    99
              |] ==> G sigma" and
wenzelm@17309
   100
  history:    "|- EEX h. Init(h = ha) & [](!x. $h = #x --> h` = hb x)"
wenzelm@17309
   101
wenzelm@21624
   102
wenzelm@21624
   103
(* Specialize intensional introduction/elimination rules for temporal formulas *)
wenzelm@21624
   104
wenzelm@21624
   105
lemma tempI: "(!!sigma. sigma |= (F::temporal)) ==> |- F"
wenzelm@21624
   106
  apply (rule intI)
wenzelm@21624
   107
  apply (erule meta_spec)
wenzelm@21624
   108
  done
wenzelm@21624
   109
wenzelm@21624
   110
lemma tempD: "|- (F::temporal) ==> sigma |= F"
wenzelm@21624
   111
  by (erule intD)
wenzelm@21624
   112
wenzelm@21624
   113
wenzelm@21624
   114
(* ======== Functions to "unlift" temporal theorems ====== *)
wenzelm@21624
   115
wenzelm@21624
   116
ML {*
wenzelm@21624
   117
(* The following functions are specialized versions of the corresponding
wenzelm@21624
   118
   functions defined in theory Intensional in that they introduce a
wenzelm@21624
   119
   "world" parameter of type "behavior".
wenzelm@21624
   120
*)
wenzelm@21624
   121
fun temp_unlift th =
wenzelm@26305
   122
  (rewrite_rule @{thms action_rews} (th RS @{thm tempD})) handle THM _ => action_unlift th;
wenzelm@21624
   123
wenzelm@21624
   124
(* Turn  |- F = G  into meta-level rewrite rule  F == G *)
wenzelm@21624
   125
val temp_rewrite = int_rewrite
wenzelm@21624
   126
wenzelm@21624
   127
fun temp_use th =
wenzelm@21624
   128
  case (concl_of th) of
wenzelm@26305
   129
    Const _ $ (Const (@{const_name Intensional.Valid}, _) $ _) =>
wenzelm@21624
   130
            ((flatten (temp_unlift th)) handle THM _ => th)
wenzelm@21624
   131
  | _ => th;
wenzelm@21624
   132
wenzelm@21624
   133
fun try_rewrite th = temp_rewrite th handle THM _ => temp_use th;
wenzelm@21624
   134
*}
wenzelm@21624
   135
wenzelm@42814
   136
attribute_setup temp_unlift = {* Scan.succeed (Thm.rule_attribute (K temp_unlift)) *}
wenzelm@42814
   137
attribute_setup temp_rewrite = {* Scan.succeed (Thm.rule_attribute (K temp_rewrite)) *}
wenzelm@42814
   138
attribute_setup temp_use = {* Scan.succeed (Thm.rule_attribute (K temp_use)) *}
wenzelm@42814
   139
attribute_setup try_rewrite = {* Scan.succeed (Thm.rule_attribute (K try_rewrite)) *}
wenzelm@30528
   140
wenzelm@21624
   141
wenzelm@21624
   142
(* Update classical reasoner---will be updated once more below! *)
wenzelm@21624
   143
wenzelm@21624
   144
declare tempI [intro!]
wenzelm@21624
   145
declare tempD [dest]
wenzelm@21624
   146
wenzelm@21624
   147
(* Modify the functions that add rules to simpsets, classical sets,
wenzelm@21624
   148
   and clasimpsets in order to accept "lifted" theorems
wenzelm@21624
   149
*)
wenzelm@21624
   150
wenzelm@21624
   151
(* ------------------------------------------------------------------------- *)
wenzelm@21624
   152
(***           "Simple temporal logic": only [] and <>                     ***)
wenzelm@21624
   153
(* ------------------------------------------------------------------------- *)
wenzelm@21624
   154
section "Simple temporal logic"
wenzelm@21624
   155
wenzelm@21624
   156
(* []~F == []~Init F *)
wenzelm@45605
   157
lemmas boxNotInit = boxInit [of "LIFT ~F", unfolded Init_simps] for F
wenzelm@21624
   158
wenzelm@21624
   159
lemma dmdInit: "TEMP <>F == TEMP <> Init F"
wenzelm@21624
   160
  apply (unfold dmd_def)
wenzelm@21624
   161
  apply (unfold boxInit [of "LIFT ~F"])
wenzelm@21624
   162
  apply (simp (no_asm) add: Init_simps)
wenzelm@21624
   163
  done
wenzelm@21624
   164
wenzelm@45605
   165
lemmas dmdNotInit = dmdInit [of "LIFT ~F", unfolded Init_simps] for F
wenzelm@21624
   166
wenzelm@21624
   167
(* boxInit and dmdInit cannot be used as rewrites, because they loop.
wenzelm@21624
   168
   Non-looping instances for state predicates and actions are occasionally useful.
wenzelm@21624
   169
*)
wenzelm@45605
   170
lemmas boxInit_stp = boxInit [where 'a = state]
wenzelm@45605
   171
lemmas boxInit_act = boxInit [where 'a = "state * state"]
wenzelm@45605
   172
lemmas dmdInit_stp = dmdInit [where 'a = state]
wenzelm@45605
   173
lemmas dmdInit_act = dmdInit [where 'a = "state * state"]
wenzelm@21624
   174
wenzelm@21624
   175
(* The symmetric equations can be used to get rid of Init *)
wenzelm@21624
   176
lemmas boxInitD = boxInit [symmetric]
wenzelm@21624
   177
lemmas dmdInitD = dmdInit [symmetric]
wenzelm@21624
   178
lemmas boxNotInitD = boxNotInit [symmetric]
wenzelm@21624
   179
lemmas dmdNotInitD = dmdNotInit [symmetric]
wenzelm@21624
   180
wenzelm@21624
   181
lemmas Init_simps = Init_simps boxInitD dmdInitD boxNotInitD dmdNotInitD
wenzelm@21624
   182
wenzelm@21624
   183
(* ------------------------ STL2 ------------------------------------------- *)
wenzelm@21624
   184
lemmas STL2 = reflT
wenzelm@21624
   185
wenzelm@21624
   186
(* The "polymorphic" (generic) variant *)
wenzelm@21624
   187
lemma STL2_gen: "|- []F --> Init F"
wenzelm@21624
   188
  apply (unfold boxInit [of F])
wenzelm@21624
   189
  apply (rule STL2)
wenzelm@21624
   190
  done
wenzelm@21624
   191
wenzelm@21624
   192
(* see also STL2_pr below: "|- []P --> Init P & Init (P`)" *)
wenzelm@21624
   193
wenzelm@21624
   194
wenzelm@21624
   195
(* Dual versions for <> *)
wenzelm@21624
   196
lemma InitDmd: "|- F --> <> F"
wenzelm@21624
   197
  apply (unfold dmd_def)
wenzelm@21624
   198
  apply (auto dest!: STL2 [temp_use])
wenzelm@21624
   199
  done
wenzelm@21624
   200
wenzelm@21624
   201
lemma InitDmd_gen: "|- Init F --> <>F"
wenzelm@21624
   202
  apply clarsimp
wenzelm@21624
   203
  apply (drule InitDmd [temp_use])
wenzelm@21624
   204
  apply (simp add: dmdInitD)
wenzelm@21624
   205
  done
wenzelm@21624
   206
wenzelm@21624
   207
wenzelm@21624
   208
(* ------------------------ STL3 ------------------------------------------- *)
wenzelm@21624
   209
lemma STL3: "|- ([][]F) = ([]F)"
wenzelm@21624
   210
  by (auto elim: transT [temp_use] STL2 [temp_use])
wenzelm@21624
   211
wenzelm@21624
   212
(* corresponding elimination rule introduces double boxes:
wenzelm@21624
   213
   [| (sigma |= []F); (sigma |= [][]F) ==> PROP W |] ==> PROP W
wenzelm@21624
   214
*)
wenzelm@21624
   215
lemmas dup_boxE = STL3 [temp_unlift, THEN iffD2, elim_format]
wenzelm@45605
   216
lemmas dup_boxD = STL3 [temp_unlift, THEN iffD1]
wenzelm@21624
   217
wenzelm@21624
   218
(* dual versions for <> *)
wenzelm@21624
   219
lemma DmdDmd: "|- (<><>F) = (<>F)"
wenzelm@21624
   220
  by (auto simp add: dmd_def [try_rewrite] STL3 [try_rewrite])
wenzelm@21624
   221
wenzelm@21624
   222
lemmas dup_dmdE = DmdDmd [temp_unlift, THEN iffD2, elim_format]
wenzelm@45605
   223
lemmas dup_dmdD = DmdDmd [temp_unlift, THEN iffD1]
wenzelm@21624
   224
wenzelm@21624
   225
wenzelm@21624
   226
(* ------------------------ STL4 ------------------------------------------- *)
wenzelm@21624
   227
lemma STL4:
wenzelm@21624
   228
  assumes "|- F --> G"
wenzelm@21624
   229
  shows "|- []F --> []G"
wenzelm@21624
   230
  apply clarsimp
wenzelm@21624
   231
  apply (rule normalT [temp_use])
wenzelm@21624
   232
   apply (rule assms [THEN necT, temp_use])
wenzelm@21624
   233
  apply assumption
wenzelm@21624
   234
  done
wenzelm@21624
   235
wenzelm@21624
   236
(* Unlifted version as an elimination rule *)
wenzelm@21624
   237
lemma STL4E: "[| sigma |= []F; |- F --> G |] ==> sigma |= []G"
wenzelm@21624
   238
  by (erule (1) STL4 [temp_use])
wenzelm@21624
   239
wenzelm@21624
   240
lemma STL4_gen: "|- Init F --> Init G ==> |- []F --> []G"
wenzelm@21624
   241
  apply (drule STL4)
wenzelm@21624
   242
  apply (simp add: boxInitD)
wenzelm@21624
   243
  done
wenzelm@21624
   244
wenzelm@21624
   245
lemma STL4E_gen: "[| sigma |= []F; |- Init F --> Init G |] ==> sigma |= []G"
wenzelm@21624
   246
  by (erule (1) STL4_gen [temp_use])
wenzelm@21624
   247
wenzelm@21624
   248
(* see also STL4Edup below, which allows an auxiliary boxed formula:
wenzelm@21624
   249
       []A /\ F => G
wenzelm@21624
   250
     -----------------
wenzelm@21624
   251
     []A /\ []F => []G
wenzelm@21624
   252
*)
wenzelm@21624
   253
wenzelm@21624
   254
(* The dual versions for <> *)
wenzelm@21624
   255
lemma DmdImpl:
wenzelm@21624
   256
  assumes prem: "|- F --> G"
wenzelm@21624
   257
  shows "|- <>F --> <>G"
wenzelm@21624
   258
  apply (unfold dmd_def)
nipkow@44890
   259
  apply (fastforce intro!: prem [temp_use] elim!: STL4E [temp_use])
wenzelm@21624
   260
  done
wenzelm@21624
   261
wenzelm@21624
   262
lemma DmdImplE: "[| sigma |= <>F; |- F --> G |] ==> sigma |= <>G"
wenzelm@21624
   263
  by (erule (1) DmdImpl [temp_use])
wenzelm@21624
   264
wenzelm@21624
   265
(* ------------------------ STL5 ------------------------------------------- *)
wenzelm@21624
   266
lemma STL5: "|- ([]F & []G) = ([](F & G))"
wenzelm@21624
   267
  apply auto
wenzelm@21624
   268
  apply (subgoal_tac "sigma |= [] (G --> (F & G))")
wenzelm@21624
   269
     apply (erule normalT [temp_use])
nipkow@44890
   270
     apply (fastforce elim!: STL4E [temp_use])+
wenzelm@21624
   271
  done
wenzelm@21624
   272
wenzelm@21624
   273
(* rewrite rule to split conjunctions under boxes *)
wenzelm@45605
   274
lemmas split_box_conj = STL5 [temp_unlift, symmetric]
wenzelm@21624
   275
wenzelm@21624
   276
wenzelm@21624
   277
(* the corresponding elimination rule allows to combine boxes in the hypotheses
wenzelm@21624
   278
   (NB: F and G must have the same type, i.e., both actions or temporals.)
wenzelm@21624
   279
   Use "addSE2" etc. if you want to add this to a claset, otherwise it will loop!
wenzelm@21624
   280
*)
wenzelm@21624
   281
lemma box_conjE:
wenzelm@21624
   282
  assumes "sigma |= []F"
wenzelm@21624
   283
     and "sigma |= []G"
wenzelm@21624
   284
  and "sigma |= [](F&G) ==> PROP R"
wenzelm@21624
   285
  shows "PROP R"
wenzelm@21624
   286
  by (rule assms STL5 [temp_unlift, THEN iffD1] conjI)+
wenzelm@21624
   287
wenzelm@21624
   288
(* Instances of box_conjE for state predicates, actions, and temporals
wenzelm@21624
   289
   in case the general rule is "too polymorphic".
wenzelm@21624
   290
*)
wenzelm@45605
   291
lemmas box_conjE_temp = box_conjE [where 'a = behavior]
wenzelm@45605
   292
lemmas box_conjE_stp = box_conjE [where 'a = state]
wenzelm@45605
   293
lemmas box_conjE_act = box_conjE [where 'a = "state * state"]
wenzelm@21624
   294
wenzelm@21624
   295
(* Define a tactic that tries to merge all boxes in an antecedent. The definition is
wenzelm@21624
   296
   a bit kludgy in order to simulate "double elim-resolution".
wenzelm@21624
   297
*)
wenzelm@21624
   298
wenzelm@21624
   299
lemma box_thin: "[| sigma |= []F; PROP W |] ==> PROP W" .
wenzelm@21624
   300
wenzelm@21624
   301
ML {*
wenzelm@21624
   302
fun merge_box_tac i =
wenzelm@26305
   303
   REPEAT_DETERM (EVERY [etac @{thm box_conjE} i, atac i, etac @{thm box_thin} i])
wenzelm@21624
   304
wenzelm@27208
   305
fun merge_temp_box_tac ctxt i =
wenzelm@26305
   306
   REPEAT_DETERM (EVERY [etac @{thm box_conjE_temp} i, atac i,
wenzelm@27239
   307
                         eres_inst_tac ctxt [(("'a", 0), "behavior")] @{thm box_thin} i])
wenzelm@21624
   308
wenzelm@27208
   309
fun merge_stp_box_tac ctxt i =
wenzelm@26305
   310
   REPEAT_DETERM (EVERY [etac @{thm box_conjE_stp} i, atac i,
wenzelm@27239
   311
                         eres_inst_tac ctxt [(("'a", 0), "state")] @{thm box_thin} i])
wenzelm@21624
   312
wenzelm@27208
   313
fun merge_act_box_tac ctxt i =
wenzelm@26305
   314
   REPEAT_DETERM (EVERY [etac @{thm box_conjE_act} i, atac i,
wenzelm@27239
   315
                         eres_inst_tac ctxt [(("'a", 0), "state * state")] @{thm box_thin} i])
wenzelm@21624
   316
*}
wenzelm@21624
   317
wenzelm@42814
   318
method_setup merge_box = {* Scan.succeed (K (SIMPLE_METHOD' merge_box_tac)) *}
wenzelm@42814
   319
method_setup merge_temp_box = {* Scan.succeed (SIMPLE_METHOD' o merge_temp_box_tac) *}
wenzelm@42814
   320
method_setup merge_stp_box = {* Scan.succeed (SIMPLE_METHOD' o merge_stp_box_tac) *}
wenzelm@42814
   321
method_setup merge_act_box = {* Scan.succeed (SIMPLE_METHOD' o merge_act_box_tac) *}
wenzelm@42787
   322
wenzelm@21624
   323
(* rewrite rule to push universal quantification through box:
wenzelm@21624
   324
      (sigma |= [](! x. F x)) = (! x. (sigma |= []F x))
wenzelm@21624
   325
*)
wenzelm@45605
   326
lemmas all_box = allT [temp_unlift, symmetric]
wenzelm@21624
   327
wenzelm@21624
   328
lemma DmdOr: "|- (<>(F | G)) = (<>F | <>G)"
wenzelm@21624
   329
  apply (auto simp add: dmd_def split_box_conj [try_rewrite])
nipkow@44890
   330
  apply (erule contrapos_np, merge_box, fastforce elim!: STL4E [temp_use])+
wenzelm@21624
   331
  done
wenzelm@21624
   332
wenzelm@21624
   333
lemma exT: "|- (EX x. <>(F x)) = (<>(EX x. F x))"
wenzelm@21624
   334
  by (auto simp: dmd_def Not_Rex [try_rewrite] all_box [try_rewrite])
wenzelm@21624
   335
wenzelm@45605
   336
lemmas ex_dmd = exT [temp_unlift, symmetric]
wenzelm@21624
   337
wenzelm@21624
   338
lemma STL4Edup: "!!sigma. [| sigma |= []A; sigma |= []F; |- F & []A --> G |] ==> sigma |= []G"
wenzelm@21624
   339
  apply (erule dup_boxE)
wenzelm@42787
   340
  apply merge_box
wenzelm@21624
   341
  apply (erule STL4E)
wenzelm@21624
   342
  apply assumption
wenzelm@21624
   343
  done
wenzelm@21624
   344
wenzelm@21624
   345
lemma DmdImpl2: 
wenzelm@21624
   346
    "!!sigma. [| sigma |= <>F; sigma |= [](F --> G) |] ==> sigma |= <>G"
wenzelm@21624
   347
  apply (unfold dmd_def)
wenzelm@21624
   348
  apply auto
wenzelm@21624
   349
  apply (erule notE)
wenzelm@42787
   350
  apply merge_box
nipkow@44890
   351
  apply (fastforce elim!: STL4E [temp_use])
wenzelm@21624
   352
  done
wenzelm@21624
   353
wenzelm@21624
   354
lemma InfImpl:
wenzelm@21624
   355
  assumes 1: "sigma |= []<>F"
wenzelm@21624
   356
    and 2: "sigma |= []G"
wenzelm@21624
   357
    and 3: "|- F & G --> H"
wenzelm@21624
   358
  shows "sigma |= []<>H"
wenzelm@21624
   359
  apply (insert 1 2)
wenzelm@21624
   360
  apply (erule_tac F = G in dup_boxE)
wenzelm@42787
   361
  apply merge_box
nipkow@44890
   362
  apply (fastforce elim!: STL4E [temp_use] DmdImpl2 [temp_use] intro!: 3 [temp_use])
wenzelm@21624
   363
  done
wenzelm@21624
   364
wenzelm@21624
   365
(* ------------------------ STL6 ------------------------------------------- *)
wenzelm@21624
   366
(* Used in the proof of STL6, but useful in itself. *)
wenzelm@21624
   367
lemma BoxDmd: "|- []F & <>G --> <>([]F & G)"
wenzelm@21624
   368
  apply (unfold dmd_def)
wenzelm@21624
   369
  apply clarsimp
wenzelm@21624
   370
  apply (erule dup_boxE)
wenzelm@42787
   371
  apply merge_box
wenzelm@21624
   372
  apply (erule contrapos_np)
nipkow@44890
   373
  apply (fastforce elim!: STL4E [temp_use])
wenzelm@21624
   374
  done
wenzelm@21624
   375
wenzelm@21624
   376
(* weaker than BoxDmd, but more polymorphic (and often just right) *)
wenzelm@21624
   377
lemma BoxDmd_simple: "|- []F & <>G --> <>(F & G)"
wenzelm@21624
   378
  apply (unfold dmd_def)
wenzelm@21624
   379
  apply clarsimp
wenzelm@42787
   380
  apply merge_box
nipkow@44890
   381
  apply (fastforce elim!: notE STL4E [temp_use])
wenzelm@21624
   382
  done
wenzelm@21624
   383
wenzelm@21624
   384
lemma BoxDmd2_simple: "|- []F & <>G --> <>(G & F)"
wenzelm@21624
   385
  apply (unfold dmd_def)
wenzelm@21624
   386
  apply clarsimp
wenzelm@42787
   387
  apply merge_box
nipkow@44890
   388
  apply (fastforce elim!: notE STL4E [temp_use])
wenzelm@21624
   389
  done
wenzelm@21624
   390
wenzelm@21624
   391
lemma DmdImpldup:
wenzelm@21624
   392
  assumes 1: "sigma |= []A"
wenzelm@21624
   393
    and 2: "sigma |= <>F"
wenzelm@21624
   394
    and 3: "|- []A & F --> G"
wenzelm@21624
   395
  shows "sigma |= <>G"
wenzelm@21624
   396
  apply (rule 2 [THEN 1 [THEN BoxDmd [temp_use]], THEN DmdImplE])
wenzelm@21624
   397
  apply (rule 3)
wenzelm@21624
   398
  done
wenzelm@21624
   399
wenzelm@21624
   400
lemma STL6: "|- <>[]F & <>[]G --> <>[](F & G)"
wenzelm@21624
   401
  apply (auto simp: STL5 [temp_rewrite, symmetric])
wenzelm@21624
   402
  apply (drule linT [temp_use])
wenzelm@21624
   403
   apply assumption
wenzelm@21624
   404
  apply (erule thin_rl)
wenzelm@21624
   405
  apply (rule DmdDmd [temp_unlift, THEN iffD1])
wenzelm@21624
   406
  apply (erule disjE)
wenzelm@21624
   407
   apply (erule DmdImplE)
wenzelm@21624
   408
   apply (rule BoxDmd)
wenzelm@21624
   409
  apply (erule DmdImplE)
wenzelm@21624
   410
  apply auto
wenzelm@21624
   411
  apply (drule BoxDmd [temp_use])
wenzelm@21624
   412
   apply assumption
wenzelm@21624
   413
  apply (erule thin_rl)
nipkow@44890
   414
  apply (fastforce elim!: DmdImplE [temp_use])
wenzelm@21624
   415
  done
wenzelm@21624
   416
wenzelm@21624
   417
wenzelm@21624
   418
(* ------------------------ True / False ----------------------------------------- *)
wenzelm@21624
   419
section "Simplification of constants"
wenzelm@21624
   420
wenzelm@21624
   421
lemma BoxConst: "|- ([]#P) = #P"
wenzelm@21624
   422
  apply (rule tempI)
wenzelm@21624
   423
  apply (cases P)
wenzelm@21624
   424
   apply (auto intro!: necT [temp_use] dest: STL2_gen [temp_use] simp: Init_simps)
wenzelm@21624
   425
  done
wenzelm@21624
   426
wenzelm@21624
   427
lemma DmdConst: "|- (<>#P) = #P"
wenzelm@21624
   428
  apply (unfold dmd_def)
wenzelm@21624
   429
  apply (cases P)
wenzelm@21624
   430
  apply (simp_all add: BoxConst [try_rewrite])
wenzelm@21624
   431
  done
wenzelm@21624
   432
wenzelm@21624
   433
lemmas temp_simps [temp_rewrite, simp] = BoxConst DmdConst
wenzelm@21624
   434
wenzelm@21624
   435
wenzelm@21624
   436
(* ------------------------ Further rewrites ----------------------------------------- *)
wenzelm@21624
   437
section "Further rewrites"
wenzelm@21624
   438
wenzelm@21624
   439
lemma NotBox: "|- (~[]F) = (<>~F)"
wenzelm@21624
   440
  by (simp add: dmd_def)
wenzelm@21624
   441
wenzelm@21624
   442
lemma NotDmd: "|- (~<>F) = ([]~F)"
wenzelm@21624
   443
  by (simp add: dmd_def)
wenzelm@21624
   444
wenzelm@21624
   445
(* These are not declared by default, because they could be harmful,
wenzelm@21624
   446
   e.g. []F & ~[]F becomes []F & <>~F !! *)
wenzelm@26305
   447
lemmas more_temp_simps1 =
wenzelm@21624
   448
  STL3 [temp_rewrite] DmdDmd [temp_rewrite] NotBox [temp_rewrite] NotDmd [temp_rewrite]
wenzelm@21624
   449
  NotBox [temp_unlift, THEN eq_reflection]
wenzelm@21624
   450
  NotDmd [temp_unlift, THEN eq_reflection]
wenzelm@21624
   451
wenzelm@21624
   452
lemma BoxDmdBox: "|- ([]<>[]F) = (<>[]F)"
wenzelm@21624
   453
  apply (auto dest!: STL2 [temp_use])
wenzelm@21624
   454
  apply (rule ccontr)
wenzelm@21624
   455
  apply (subgoal_tac "sigma |= <>[][]F & <>[]~[]F")
wenzelm@21624
   456
   apply (erule thin_rl)
wenzelm@21624
   457
   apply auto
wenzelm@21624
   458
    apply (drule STL6 [temp_use])
wenzelm@21624
   459
     apply assumption
wenzelm@21624
   460
    apply simp
wenzelm@26305
   461
   apply (simp_all add: more_temp_simps1)
wenzelm@21624
   462
  done
wenzelm@21624
   463
wenzelm@21624
   464
lemma DmdBoxDmd: "|- (<>[]<>F) = ([]<>F)"
wenzelm@21624
   465
  apply (unfold dmd_def)
wenzelm@21624
   466
  apply (auto simp: BoxDmdBox [unfolded dmd_def, try_rewrite])
wenzelm@21624
   467
  done
wenzelm@21624
   468
wenzelm@26305
   469
lemmas more_temp_simps2 = more_temp_simps1 BoxDmdBox [temp_rewrite] DmdBoxDmd [temp_rewrite]
wenzelm@21624
   470
wenzelm@21624
   471
wenzelm@21624
   472
(* ------------------------ Miscellaneous ----------------------------------- *)
wenzelm@21624
   473
wenzelm@21624
   474
lemma BoxOr: "!!sigma. [| sigma |= []F | []G |] ==> sigma |= [](F | G)"
nipkow@44890
   475
  by (fastforce elim!: STL4E [temp_use])
wenzelm@21624
   476
wenzelm@21624
   477
(* "persistently implies infinitely often" *)
wenzelm@21624
   478
lemma DBImplBD: "|- <>[]F --> []<>F"
wenzelm@21624
   479
  apply clarsimp
wenzelm@21624
   480
  apply (rule ccontr)
wenzelm@26305
   481
  apply (simp add: more_temp_simps2)
wenzelm@21624
   482
  apply (drule STL6 [temp_use])
wenzelm@21624
   483
   apply assumption
wenzelm@21624
   484
  apply simp
wenzelm@21624
   485
  done
wenzelm@21624
   486
wenzelm@21624
   487
lemma BoxDmdDmdBox: "|- []<>F & <>[]G --> []<>(F & G)"
wenzelm@21624
   488
  apply clarsimp
wenzelm@21624
   489
  apply (rule ccontr)
wenzelm@26305
   490
  apply (unfold more_temp_simps2)
wenzelm@21624
   491
  apply (drule STL6 [temp_use])
wenzelm@21624
   492
   apply assumption
wenzelm@21624
   493
  apply (subgoal_tac "sigma |= <>[]~F")
wenzelm@21624
   494
   apply (force simp: dmd_def)
nipkow@44890
   495
  apply (fastforce elim: DmdImplE [temp_use] STL4E [temp_use])
wenzelm@21624
   496
  done
wenzelm@21624
   497
wenzelm@21624
   498
wenzelm@21624
   499
(* ------------------------------------------------------------------------- *)
wenzelm@21624
   500
(***          TLA-specific theorems: primed formulas                       ***)
wenzelm@21624
   501
(* ------------------------------------------------------------------------- *)
wenzelm@21624
   502
section "priming"
wenzelm@21624
   503
wenzelm@21624
   504
(* ------------------------ TLA2 ------------------------------------------- *)
wenzelm@21624
   505
lemma STL2_pr: "|- []P --> Init P & Init P`"
nipkow@44890
   506
  by (fastforce intro!: STL2_gen [temp_use] primeI [temp_use])
wenzelm@21624
   507
wenzelm@21624
   508
(* Auxiliary lemma allows priming of boxed actions *)
wenzelm@21624
   509
lemma BoxPrime: "|- []P --> []($P & P$)"
wenzelm@21624
   510
  apply clarsimp
wenzelm@21624
   511
  apply (erule dup_boxE)
wenzelm@21624
   512
  apply (unfold boxInit_act)
wenzelm@21624
   513
  apply (erule STL4E)
wenzelm@21624
   514
  apply (auto simp: Init_simps dest!: STL2_pr [temp_use])
wenzelm@21624
   515
  done
wenzelm@21624
   516
wenzelm@21624
   517
lemma TLA2:
wenzelm@21624
   518
  assumes "|- $P & P$ --> A"
wenzelm@21624
   519
  shows "|- []P --> []A"
wenzelm@21624
   520
  apply clarsimp
wenzelm@21624
   521
  apply (drule BoxPrime [temp_use])
wenzelm@41529
   522
  apply (auto simp: Init_stp_act_rev [try_rewrite] intro!: assms [temp_use]
wenzelm@21624
   523
    elim!: STL4E [temp_use])
wenzelm@21624
   524
  done
wenzelm@21624
   525
wenzelm@21624
   526
lemma TLA2E: "[| sigma |= []P; |- $P & P$ --> A |] ==> sigma |= []A"
wenzelm@21624
   527
  by (erule (1) TLA2 [temp_use])
wenzelm@21624
   528
wenzelm@21624
   529
lemma DmdPrime: "|- (<>P`) --> (<>P)"
wenzelm@21624
   530
  apply (unfold dmd_def)
nipkow@44890
   531
  apply (fastforce elim!: TLA2E [temp_use])
wenzelm@21624
   532
  done
wenzelm@21624
   533
wenzelm@45605
   534
lemmas PrimeDmd = InitDmd_gen [temp_use, THEN DmdPrime [temp_use]]
wenzelm@21624
   535
wenzelm@21624
   536
(* ------------------------ INV1, stable --------------------------------------- *)
wenzelm@21624
   537
section "stable, invariant"
wenzelm@21624
   538
wenzelm@21624
   539
lemma ind_rule:
wenzelm@21624
   540
   "[| sigma |= []H; sigma |= Init P; |- H --> (Init P & ~[]F --> Init(P`) & F) |]  
wenzelm@21624
   541
    ==> sigma |= []F"
wenzelm@21624
   542
  apply (rule indT [temp_use])
wenzelm@21624
   543
   apply (erule (2) STL4E)
wenzelm@21624
   544
  done
wenzelm@21624
   545
wenzelm@21624
   546
lemma box_stp_act: "|- ([]$P) = ([]P)"
wenzelm@21624
   547
  by (simp add: boxInit_act Init_simps)
wenzelm@21624
   548
wenzelm@45605
   549
lemmas box_stp_actI = box_stp_act [temp_use, THEN iffD2]
wenzelm@45605
   550
lemmas box_stp_actD = box_stp_act [temp_use, THEN iffD1]
wenzelm@21624
   551
wenzelm@26305
   552
lemmas more_temp_simps3 = box_stp_act [temp_rewrite] more_temp_simps2
wenzelm@21624
   553
wenzelm@21624
   554
lemma INV1: 
wenzelm@21624
   555
  "|- (Init P) --> (stable P) --> []P"
wenzelm@21624
   556
  apply (unfold stable_def boxInit_stp boxInit_act)
wenzelm@21624
   557
  apply clarsimp
wenzelm@21624
   558
  apply (erule ind_rule)
wenzelm@21624
   559
   apply (auto simp: Init_simps elim: ind_rule)
wenzelm@21624
   560
  done
wenzelm@21624
   561
wenzelm@21624
   562
lemma StableT: 
wenzelm@21624
   563
    "!!P. |- $P & A --> P` ==> |- []A --> stable P"
wenzelm@21624
   564
  apply (unfold stable_def)
nipkow@44890
   565
  apply (fastforce elim!: STL4E [temp_use])
wenzelm@21624
   566
  done
wenzelm@21624
   567
wenzelm@21624
   568
lemma Stable: "[| sigma |= []A; |- $P & A --> P` |] ==> sigma |= stable P"
wenzelm@21624
   569
  by (erule (1) StableT [temp_use])
wenzelm@21624
   570
wenzelm@21624
   571
(* Generalization of INV1 *)
wenzelm@21624
   572
lemma StableBox: "|- (stable P) --> [](Init P --> []P)"
wenzelm@21624
   573
  apply (unfold stable_def)
wenzelm@21624
   574
  apply clarsimp
wenzelm@21624
   575
  apply (erule dup_boxE)
wenzelm@21624
   576
  apply (force simp: stable_def elim: STL4E [temp_use] INV1 [temp_use])
wenzelm@21624
   577
  done
wenzelm@21624
   578
wenzelm@21624
   579
lemma DmdStable: "|- (stable P) & <>P --> <>[]P"
wenzelm@21624
   580
  apply clarsimp
wenzelm@21624
   581
  apply (rule DmdImpl2)
wenzelm@21624
   582
   prefer 2
wenzelm@21624
   583
   apply (erule StableBox [temp_use])
wenzelm@21624
   584
  apply (simp add: dmdInitD)
wenzelm@21624
   585
  done
wenzelm@21624
   586
wenzelm@21624
   587
(* ---------------- (Semi-)automatic invariant tactics ---------------------- *)
wenzelm@21624
   588
wenzelm@21624
   589
ML {*
wenzelm@21624
   590
(* inv_tac reduces goals of the form ... ==> sigma |= []P *)
wenzelm@42793
   591
fun inv_tac ctxt =
wenzelm@42793
   592
  SELECT_GOAL
wenzelm@42793
   593
    (EVERY
wenzelm@42793
   594
     [auto_tac ctxt,
wenzelm@42793
   595
      TRY (merge_box_tac 1),
wenzelm@42793
   596
      rtac (temp_use @{thm INV1}) 1, (* fail if the goal is not a box *)
wenzelm@42793
   597
      TRYALL (etac @{thm Stable})]);
wenzelm@21624
   598
wenzelm@21624
   599
(* auto_inv_tac applies inv_tac and then tries to attack the subgoals
wenzelm@21624
   600
   in simple cases it may be able to handle goals like |- MyProg --> []Inv.
wenzelm@21624
   601
   In these simple cases the simplifier seems to be more useful than the
wenzelm@21624
   602
   auto-tactic, which applies too much propositional logic and simplifies
wenzelm@21624
   603
   too late.
wenzelm@21624
   604
*)
wenzelm@42803
   605
fun auto_inv_tac ctxt =
wenzelm@42793
   606
  SELECT_GOAL
wenzelm@42803
   607
    (inv_tac ctxt 1 THEN
wenzelm@42793
   608
      (TRYALL (action_simp_tac
wenzelm@42803
   609
        (simpset_of ctxt addsimps [@{thm Init_stp}, @{thm Init_act}]) [] [@{thm squareE}])));
wenzelm@21624
   610
*}
wenzelm@21624
   611
wenzelm@42769
   612
method_setup invariant = {*
wenzelm@42793
   613
  Method.sections Clasimp.clasimp_modifiers >> (K (SIMPLE_METHOD' o inv_tac))
wenzelm@42814
   614
*}
wenzelm@42769
   615
wenzelm@42769
   616
method_setup auto_invariant = {*
wenzelm@42803
   617
  Method.sections Clasimp.clasimp_modifiers >> (K (SIMPLE_METHOD' o auto_inv_tac))
wenzelm@42814
   618
*}
wenzelm@42769
   619
wenzelm@21624
   620
lemma unless: "|- []($P --> P` | Q`) --> (stable P) | <>Q"
wenzelm@21624
   621
  apply (unfold dmd_def)
wenzelm@21624
   622
  apply (clarsimp dest!: BoxPrime [temp_use])
wenzelm@42787
   623
  apply merge_box
wenzelm@21624
   624
  apply (erule contrapos_np)
nipkow@44890
   625
  apply (fastforce elim!: Stable [temp_use])
wenzelm@21624
   626
  done
wenzelm@21624
   627
wenzelm@21624
   628
wenzelm@21624
   629
(* --------------------- Recursive expansions --------------------------------------- *)
wenzelm@21624
   630
section "recursive expansions"
wenzelm@21624
   631
wenzelm@21624
   632
(* Recursive expansions of [] and <> for state predicates *)
wenzelm@21624
   633
lemma BoxRec: "|- ([]P) = (Init P & []P`)"
wenzelm@21624
   634
  apply (auto intro!: STL2_gen [temp_use])
nipkow@44890
   635
   apply (fastforce elim!: TLA2E [temp_use])
wenzelm@21624
   636
  apply (auto simp: stable_def elim!: INV1 [temp_use] STL4E [temp_use])
wenzelm@21624
   637
  done
wenzelm@21624
   638
wenzelm@21624
   639
lemma DmdRec: "|- (<>P) = (Init P | <>P`)"
wenzelm@21624
   640
  apply (unfold dmd_def BoxRec [temp_rewrite])
wenzelm@21624
   641
  apply (auto simp: Init_simps)
wenzelm@21624
   642
  done
wenzelm@21624
   643
wenzelm@21624
   644
lemma DmdRec2: "!!sigma. [| sigma |= <>P; sigma |= []~P` |] ==> sigma |= Init P"
wenzelm@21624
   645
  apply (force simp: DmdRec [temp_rewrite] dmd_def)
wenzelm@21624
   646
  done
wenzelm@21624
   647
wenzelm@21624
   648
lemma InfinitePrime: "|- ([]<>P) = ([]<>P`)"
wenzelm@21624
   649
  apply auto
wenzelm@21624
   650
   apply (rule classical)
wenzelm@21624
   651
   apply (rule DBImplBD [temp_use])
wenzelm@21624
   652
   apply (subgoal_tac "sigma |= <>[]P")
nipkow@44890
   653
    apply (fastforce elim!: DmdImplE [temp_use] TLA2E [temp_use])
wenzelm@21624
   654
   apply (subgoal_tac "sigma |= <>[] (<>P & []~P`)")
wenzelm@21624
   655
    apply (force simp: boxInit_stp [temp_use]
wenzelm@21624
   656
      elim!: DmdImplE [temp_use] STL4E [temp_use] DmdRec2 [temp_use])
wenzelm@26305
   657
   apply (force intro!: STL6 [temp_use] simp: more_temp_simps3)
nipkow@44890
   658
  apply (fastforce intro: DmdPrime [temp_use] elim!: STL4E [temp_use])
wenzelm@21624
   659
  done
wenzelm@21624
   660
wenzelm@21624
   661
lemma InfiniteEnsures:
wenzelm@21624
   662
  "[| sigma |= []N; sigma |= []<>A; |- A & N --> P` |] ==> sigma |= []<>P"
wenzelm@21624
   663
  apply (unfold InfinitePrime [temp_rewrite])
wenzelm@21624
   664
  apply (rule InfImpl)
wenzelm@21624
   665
    apply assumption+
wenzelm@21624
   666
  done
wenzelm@21624
   667
wenzelm@21624
   668
(* ------------------------ fairness ------------------------------------------- *)
wenzelm@21624
   669
section "fairness"
wenzelm@21624
   670
wenzelm@21624
   671
(* alternative definitions of fairness *)
wenzelm@21624
   672
lemma WF_alt: "|- WF(A)_v = ([]<>~Enabled(<A>_v) | []<><A>_v)"
wenzelm@21624
   673
  apply (unfold WF_def dmd_def)
nipkow@44890
   674
  apply fastforce
wenzelm@21624
   675
  done
wenzelm@21624
   676
wenzelm@21624
   677
lemma SF_alt: "|- SF(A)_v = (<>[]~Enabled(<A>_v) | []<><A>_v)"
wenzelm@21624
   678
  apply (unfold SF_def dmd_def)
nipkow@44890
   679
  apply fastforce
wenzelm@21624
   680
  done
wenzelm@21624
   681
wenzelm@21624
   682
(* theorems to "box" fairness conditions *)
wenzelm@21624
   683
lemma BoxWFI: "|- WF(A)_v --> []WF(A)_v"
wenzelm@26305
   684
  by (auto simp: WF_alt [try_rewrite] more_temp_simps3 intro!: BoxOr [temp_use])
wenzelm@21624
   685
wenzelm@21624
   686
lemma WF_Box: "|- ([]WF(A)_v) = WF(A)_v"
nipkow@44890
   687
  by (fastforce intro!: BoxWFI [temp_use] dest!: STL2 [temp_use])
wenzelm@21624
   688
wenzelm@21624
   689
lemma BoxSFI: "|- SF(A)_v --> []SF(A)_v"
wenzelm@26305
   690
  by (auto simp: SF_alt [try_rewrite] more_temp_simps3 intro!: BoxOr [temp_use])
wenzelm@21624
   691
wenzelm@21624
   692
lemma SF_Box: "|- ([]SF(A)_v) = SF(A)_v"
nipkow@44890
   693
  by (fastforce intro!: BoxSFI [temp_use] dest!: STL2 [temp_use])
wenzelm@21624
   694
wenzelm@26305
   695
lemmas more_temp_simps = more_temp_simps3 WF_Box [temp_rewrite] SF_Box [temp_rewrite]
wenzelm@21624
   696
wenzelm@21624
   697
lemma SFImplWF: "|- SF(A)_v --> WF(A)_v"
wenzelm@21624
   698
  apply (unfold SF_def WF_def)
nipkow@44890
   699
  apply (fastforce dest!: DBImplBD [temp_use])
wenzelm@21624
   700
  done
wenzelm@21624
   701
wenzelm@21624
   702
(* A tactic that "boxes" all fairness conditions. Apply more_temp_simps to "unbox". *)
wenzelm@21624
   703
ML {*
wenzelm@26305
   704
val box_fair_tac = SELECT_GOAL (REPEAT (dresolve_tac [@{thm BoxWFI}, @{thm BoxSFI}] 1))
wenzelm@21624
   705
*}
wenzelm@21624
   706
wenzelm@21624
   707
wenzelm@21624
   708
(* ------------------------------ leads-to ------------------------------ *)
wenzelm@21624
   709
wenzelm@21624
   710
section "~>"
wenzelm@21624
   711
wenzelm@21624
   712
lemma leadsto_init: "|- (Init F) & (F ~> G) --> <>G"
wenzelm@21624
   713
  apply (unfold leadsto_def)
wenzelm@21624
   714
  apply (auto dest!: STL2 [temp_use])
wenzelm@21624
   715
  done
wenzelm@21624
   716
wenzelm@21624
   717
(* |- F & (F ~> G) --> <>G *)
wenzelm@45605
   718
lemmas leadsto_init_temp = leadsto_init [where 'a = behavior, unfolded Init_simps]
wenzelm@21624
   719
wenzelm@21624
   720
lemma streett_leadsto: "|- ([]<>Init F --> []<>G) = (<>(F ~> G))"
wenzelm@21624
   721
  apply (unfold leadsto_def)
wenzelm@21624
   722
  apply auto
wenzelm@21624
   723
    apply (simp add: more_temp_simps)
nipkow@44890
   724
    apply (fastforce elim!: DmdImplE [temp_use] STL4E [temp_use])
nipkow@44890
   725
   apply (fastforce intro!: InitDmd [temp_use] elim!: STL4E [temp_use])
wenzelm@21624
   726
  apply (subgoal_tac "sigma |= []<><>G")
wenzelm@21624
   727
   apply (simp add: more_temp_simps)
wenzelm@21624
   728
  apply (drule BoxDmdDmdBox [temp_use])
wenzelm@21624
   729
   apply assumption
nipkow@44890
   730
  apply (fastforce elim!: DmdImplE [temp_use] STL4E [temp_use])
wenzelm@21624
   731
  done
wenzelm@21624
   732
wenzelm@21624
   733
lemma leadsto_infinite: "|- []<>F & (F ~> G) --> []<>G"
wenzelm@21624
   734
  apply clarsimp
wenzelm@21624
   735
  apply (erule InitDmd [temp_use, THEN streett_leadsto [temp_unlift, THEN iffD2, THEN mp]])
wenzelm@21624
   736
  apply (simp add: dmdInitD)
wenzelm@21624
   737
  done
wenzelm@21624
   738
wenzelm@21624
   739
(* In particular, strong fairness is a Streett condition. The following
wenzelm@21624
   740
   rules are sometimes easier to use than WF2 or SF2 below.
wenzelm@21624
   741
*)
wenzelm@21624
   742
lemma leadsto_SF: "|- (Enabled(<A>_v) ~> <A>_v) --> SF(A)_v"
wenzelm@21624
   743
  apply (unfold SF_def)
wenzelm@21624
   744
  apply (clarsimp elim!: leadsto_infinite [temp_use])
wenzelm@21624
   745
  done
wenzelm@21624
   746
wenzelm@21624
   747
lemma leadsto_WF: "|- (Enabled(<A>_v) ~> <A>_v) --> WF(A)_v"
wenzelm@21624
   748
  by (clarsimp intro!: SFImplWF [temp_use] leadsto_SF [temp_use])
wenzelm@21624
   749
wenzelm@21624
   750
(* introduce an invariant into the proof of a leadsto assertion.
wenzelm@21624
   751
   []I --> ((P ~> Q)  =  (P /\ I ~> Q))
wenzelm@21624
   752
*)
wenzelm@21624
   753
lemma INV_leadsto: "|- []I & (P & I ~> Q) --> (P ~> Q)"
wenzelm@21624
   754
  apply (unfold leadsto_def)
wenzelm@21624
   755
  apply clarsimp
wenzelm@21624
   756
  apply (erule STL4Edup)
wenzelm@21624
   757
   apply assumption
wenzelm@21624
   758
  apply (auto simp: Init_simps dest!: STL2_gen [temp_use])
wenzelm@21624
   759
  done
wenzelm@21624
   760
wenzelm@21624
   761
lemma leadsto_classical: "|- (Init F & []~G ~> G) --> (F ~> G)"
wenzelm@21624
   762
  apply (unfold leadsto_def dmd_def)
wenzelm@21624
   763
  apply (force simp: Init_simps elim!: STL4E [temp_use])
wenzelm@21624
   764
  done
wenzelm@21624
   765
wenzelm@21624
   766
lemma leadsto_false: "|- (F ~> #False) = ([]~F)"
wenzelm@21624
   767
  apply (unfold leadsto_def)
wenzelm@21624
   768
  apply (simp add: boxNotInitD)
wenzelm@21624
   769
  done
wenzelm@21624
   770
wenzelm@21624
   771
lemma leadsto_exists: "|- ((EX x. F x) ~> G) = (ALL x. (F x ~> G))"
wenzelm@21624
   772
  apply (unfold leadsto_def)
wenzelm@21624
   773
  apply (auto simp: allT [try_rewrite] Init_simps elim!: STL4E [temp_use])
wenzelm@21624
   774
  done
wenzelm@21624
   775
wenzelm@21624
   776
(* basic leadsto properties, cf. Unity *)
wenzelm@21624
   777
wenzelm@21624
   778
lemma ImplLeadsto_gen: "|- [](Init F --> Init G) --> (F ~> G)"
wenzelm@21624
   779
  apply (unfold leadsto_def)
wenzelm@21624
   780
  apply (auto intro!: InitDmd_gen [temp_use]
wenzelm@21624
   781
    elim!: STL4E_gen [temp_use] simp: Init_simps)
wenzelm@21624
   782
  done
wenzelm@21624
   783
wenzelm@45605
   784
lemmas ImplLeadsto =
wenzelm@45605
   785
  ImplLeadsto_gen [where 'a = behavior and 'b = behavior, unfolded Init_simps]
wenzelm@21624
   786
wenzelm@21624
   787
lemma ImplLeadsto_simple: "!!F G. |- F --> G ==> |- F ~> G"
wenzelm@21624
   788
  by (auto simp: Init_def intro!: ImplLeadsto_gen [temp_use] necT [temp_use])
wenzelm@21624
   789
wenzelm@21624
   790
lemma EnsuresLeadsto:
wenzelm@21624
   791
  assumes "|- A & $P --> Q`"
wenzelm@21624
   792
  shows "|- []A --> (P ~> Q)"
wenzelm@21624
   793
  apply (unfold leadsto_def)
wenzelm@21624
   794
  apply (clarsimp elim!: INV_leadsto [temp_use])
wenzelm@21624
   795
  apply (erule STL4E_gen)
wenzelm@21624
   796
  apply (auto simp: Init_defs intro!: PrimeDmd [temp_use] assms [temp_use])
wenzelm@21624
   797
  done
wenzelm@21624
   798
wenzelm@21624
   799
lemma EnsuresLeadsto2: "|- []($P --> Q`) --> (P ~> Q)"
wenzelm@21624
   800
  apply (unfold leadsto_def)
wenzelm@21624
   801
  apply clarsimp
wenzelm@21624
   802
  apply (erule STL4E_gen)
wenzelm@21624
   803
  apply (auto simp: Init_simps intro!: PrimeDmd [temp_use])
wenzelm@21624
   804
  done
wenzelm@21624
   805
wenzelm@21624
   806
lemma ensures:
wenzelm@21624
   807
  assumes 1: "|- $P & N --> P` | Q`"
wenzelm@21624
   808
    and 2: "|- ($P & N) & A --> Q`"
wenzelm@21624
   809
  shows "|- []N & []([]P --> <>A) --> (P ~> Q)"
wenzelm@21624
   810
  apply (unfold leadsto_def)
wenzelm@21624
   811
  apply clarsimp
wenzelm@21624
   812
  apply (erule STL4Edup)
wenzelm@21624
   813
   apply assumption
wenzelm@21624
   814
  apply clarsimp
wenzelm@21624
   815
  apply (subgoal_tac "sigmaa |= [] ($P --> P` | Q`) ")
wenzelm@21624
   816
   apply (drule unless [temp_use])
wenzelm@21624
   817
   apply (clarsimp dest!: INV1 [temp_use])
wenzelm@21624
   818
  apply (rule 2 [THEN DmdImpl, temp_use, THEN DmdPrime [temp_use]])
wenzelm@21624
   819
   apply (force intro!: BoxDmd_simple [temp_use]
wenzelm@21624
   820
     simp: split_box_conj [try_rewrite] box_stp_act [try_rewrite])
wenzelm@21624
   821
  apply (force elim: STL4E [temp_use] dest: 1 [temp_use])
wenzelm@21624
   822
  done
wenzelm@21624
   823
wenzelm@21624
   824
lemma ensures_simple:
wenzelm@21624
   825
  "[| |- $P & N --> P` | Q`;  
wenzelm@21624
   826
      |- ($P & N) & A --> Q`  
wenzelm@21624
   827
   |] ==> |- []N & []<>A --> (P ~> Q)"
wenzelm@21624
   828
  apply clarsimp
wenzelm@21624
   829
  apply (erule (2) ensures [temp_use])
wenzelm@21624
   830
  apply (force elim!: STL4E [temp_use])
wenzelm@21624
   831
  done
wenzelm@21624
   832
wenzelm@21624
   833
lemma EnsuresInfinite:
wenzelm@21624
   834
    "[| sigma |= []<>P; sigma |= []A; |- A & $P --> Q` |] ==> sigma |= []<>Q"
wenzelm@21624
   835
  apply (erule leadsto_infinite [temp_use])
wenzelm@21624
   836
  apply (erule EnsuresLeadsto [temp_use])
wenzelm@21624
   837
  apply assumption
wenzelm@21624
   838
  done
wenzelm@21624
   839
wenzelm@21624
   840
wenzelm@21624
   841
(*** Gronning's lattice rules (taken from TLP) ***)
wenzelm@21624
   842
section "Lattice rules"
wenzelm@21624
   843
wenzelm@21624
   844
lemma LatticeReflexivity: "|- F ~> F"
wenzelm@21624
   845
  apply (unfold leadsto_def)
wenzelm@21624
   846
  apply (rule necT InitDmd_gen)+
wenzelm@21624
   847
  done
wenzelm@21624
   848
wenzelm@21624
   849
lemma LatticeTransitivity: "|- (G ~> H) & (F ~> G) --> (F ~> H)"
wenzelm@21624
   850
  apply (unfold leadsto_def)
wenzelm@21624
   851
  apply clarsimp
wenzelm@21624
   852
  apply (erule dup_boxE) (* [][] (Init G --> H) *)
wenzelm@42787
   853
  apply merge_box
wenzelm@21624
   854
  apply (clarsimp elim!: STL4E [temp_use])
wenzelm@21624
   855
  apply (rule dup_dmdD)
wenzelm@21624
   856
  apply (subgoal_tac "sigmaa |= <>Init G")
wenzelm@21624
   857
   apply (erule DmdImpl2)
wenzelm@21624
   858
   apply assumption
wenzelm@21624
   859
  apply (simp add: dmdInitD)
wenzelm@21624
   860
  done
wenzelm@21624
   861
wenzelm@21624
   862
lemma LatticeDisjunctionElim1: "|- (F | G ~> H) --> (F ~> H)"
wenzelm@21624
   863
  apply (unfold leadsto_def)
wenzelm@21624
   864
  apply (auto simp: Init_simps elim!: STL4E [temp_use])
wenzelm@21624
   865
  done
wenzelm@21624
   866
wenzelm@21624
   867
lemma LatticeDisjunctionElim2: "|- (F | G ~> H) --> (G ~> H)"
wenzelm@21624
   868
  apply (unfold leadsto_def)
wenzelm@21624
   869
  apply (auto simp: Init_simps elim!: STL4E [temp_use])
wenzelm@21624
   870
  done
wenzelm@21624
   871
wenzelm@21624
   872
lemma LatticeDisjunctionIntro: "|- (F ~> H) & (G ~> H) --> (F | G ~> H)"
wenzelm@21624
   873
  apply (unfold leadsto_def)
wenzelm@21624
   874
  apply clarsimp
wenzelm@42787
   875
  apply merge_box
wenzelm@21624
   876
  apply (auto simp: Init_simps elim!: STL4E [temp_use])
wenzelm@21624
   877
  done
wenzelm@21624
   878
wenzelm@21624
   879
lemma LatticeDisjunction: "|- (F | G ~> H) = ((F ~> H) & (G ~> H))"
wenzelm@21624
   880
  by (auto intro: LatticeDisjunctionIntro [temp_use]
wenzelm@21624
   881
    LatticeDisjunctionElim1 [temp_use]
wenzelm@21624
   882
    LatticeDisjunctionElim2 [temp_use])
wenzelm@21624
   883
wenzelm@21624
   884
lemma LatticeDiamond: "|- (A ~> B | C) & (B ~> D) & (C ~> D) --> (A ~> D)"
wenzelm@21624
   885
  apply clarsimp
wenzelm@21624
   886
  apply (subgoal_tac "sigma |= (B | C) ~> D")
wenzelm@21624
   887
  apply (erule_tac G = "LIFT (B | C)" in LatticeTransitivity [temp_use])
nipkow@44890
   888
   apply (fastforce intro!: LatticeDisjunctionIntro [temp_use])+
wenzelm@21624
   889
  done
wenzelm@21624
   890
wenzelm@21624
   891
lemma LatticeTriangle: "|- (A ~> D | B) & (B ~> D) --> (A ~> D)"
wenzelm@21624
   892
  apply clarsimp
wenzelm@21624
   893
  apply (subgoal_tac "sigma |= (D | B) ~> D")
wenzelm@21624
   894
   apply (erule_tac G = "LIFT (D | B)" in LatticeTransitivity [temp_use])
wenzelm@21624
   895
  apply assumption
wenzelm@21624
   896
  apply (auto intro: LatticeDisjunctionIntro [temp_use] LatticeReflexivity [temp_use])
wenzelm@21624
   897
  done
wenzelm@21624
   898
wenzelm@21624
   899
lemma LatticeTriangle2: "|- (A ~> B | D) & (B ~> D) --> (A ~> D)"
wenzelm@21624
   900
  apply clarsimp
wenzelm@21624
   901
  apply (subgoal_tac "sigma |= B | D ~> D")
wenzelm@21624
   902
   apply (erule_tac G = "LIFT (B | D)" in LatticeTransitivity [temp_use])
wenzelm@21624
   903
   apply assumption
wenzelm@21624
   904
  apply (auto intro: LatticeDisjunctionIntro [temp_use] LatticeReflexivity [temp_use])
wenzelm@21624
   905
  done
wenzelm@21624
   906
wenzelm@21624
   907
(*** Lamport's fairness rules ***)
wenzelm@21624
   908
section "Fairness rules"
wenzelm@21624
   909
wenzelm@21624
   910
lemma WF1:
wenzelm@21624
   911
  "[| |- $P & N  --> P` | Q`;    
wenzelm@21624
   912
      |- ($P & N) & <A>_v --> Q`;    
wenzelm@21624
   913
      |- $P & N --> $(Enabled(<A>_v)) |]    
wenzelm@21624
   914
  ==> |- []N & WF(A)_v --> (P ~> Q)"
wenzelm@21624
   915
  apply (clarsimp dest!: BoxWFI [temp_use])
wenzelm@21624
   916
  apply (erule (2) ensures [temp_use])
wenzelm@21624
   917
  apply (erule (1) STL4Edup)
wenzelm@21624
   918
  apply (clarsimp simp: WF_def)
wenzelm@21624
   919
  apply (rule STL2 [temp_use])
wenzelm@21624
   920
  apply (clarsimp elim!: mp intro!: InitDmd [temp_use])
wenzelm@21624
   921
  apply (erule STL4 [temp_use, THEN box_stp_actD [temp_use]])
wenzelm@21624
   922
  apply (simp add: split_box_conj box_stp_actI)
wenzelm@21624
   923
  done
wenzelm@21624
   924
wenzelm@21624
   925
(* Sometimes easier to use; designed for action B rather than state predicate Q *)
wenzelm@21624
   926
lemma WF_leadsto:
wenzelm@21624
   927
  assumes 1: "|- N & $P --> $Enabled (<A>_v)"
wenzelm@21624
   928
    and 2: "|- N & <A>_v --> B"
wenzelm@21624
   929
    and 3: "|- [](N & [~A]_v) --> stable P"
wenzelm@21624
   930
  shows "|- []N & WF(A)_v --> (P ~> B)"
wenzelm@21624
   931
  apply (unfold leadsto_def)
wenzelm@21624
   932
  apply (clarsimp dest!: BoxWFI [temp_use])
wenzelm@21624
   933
  apply (erule (1) STL4Edup)
wenzelm@21624
   934
  apply clarsimp
wenzelm@21624
   935
  apply (rule 2 [THEN DmdImpl, temp_use])
wenzelm@21624
   936
  apply (rule BoxDmd_simple [temp_use])
wenzelm@21624
   937
   apply assumption
wenzelm@21624
   938
  apply (rule classical)
wenzelm@21624
   939
  apply (rule STL2 [temp_use])
wenzelm@21624
   940
  apply (clarsimp simp: WF_def elim!: mp intro!: InitDmd [temp_use])
wenzelm@21624
   941
  apply (rule 1 [THEN STL4, temp_use, THEN box_stp_actD])
wenzelm@21624
   942
  apply (simp (no_asm_simp) add: split_box_conj [try_rewrite] box_stp_act [try_rewrite])
wenzelm@21624
   943
  apply (erule INV1 [temp_use])
wenzelm@21624
   944
  apply (rule 3 [temp_use])
wenzelm@21624
   945
  apply (simp add: split_box_conj [try_rewrite] NotDmd [temp_use] not_angle [try_rewrite])
wenzelm@21624
   946
  done
wenzelm@21624
   947
wenzelm@21624
   948
lemma SF1:
wenzelm@21624
   949
  "[| |- $P & N  --> P` | Q`;    
wenzelm@21624
   950
      |- ($P & N) & <A>_v --> Q`;    
wenzelm@21624
   951
      |- []P & []N & []F --> <>Enabled(<A>_v) |]    
wenzelm@21624
   952
  ==> |- []N & SF(A)_v & []F --> (P ~> Q)"
wenzelm@21624
   953
  apply (clarsimp dest!: BoxSFI [temp_use])
wenzelm@21624
   954
  apply (erule (2) ensures [temp_use])
wenzelm@21624
   955
  apply (erule_tac F = F in dup_boxE)
wenzelm@42787
   956
  apply merge_temp_box
wenzelm@21624
   957
  apply (erule STL4Edup)
wenzelm@21624
   958
  apply assumption
wenzelm@21624
   959
  apply (clarsimp simp: SF_def)
wenzelm@21624
   960
  apply (rule STL2 [temp_use])
wenzelm@21624
   961
  apply (erule mp)
wenzelm@21624
   962
  apply (erule STL4 [temp_use])
wenzelm@21624
   963
  apply (simp add: split_box_conj [try_rewrite] STL3 [try_rewrite])
wenzelm@21624
   964
  done
wenzelm@21624
   965
wenzelm@21624
   966
lemma WF2:
wenzelm@21624
   967
  assumes 1: "|- N & <B>_f --> <M>_g"
wenzelm@21624
   968
    and 2: "|- $P & P` & <N & A>_f --> B"
wenzelm@21624
   969
    and 3: "|- P & Enabled(<M>_g) --> Enabled(<A>_f)"
wenzelm@21624
   970
    and 4: "|- [](N & [~B]_f) & WF(A)_f & []F & <>[]Enabled(<M>_g) --> <>[]P"
wenzelm@21624
   971
  shows "|- []N & WF(A)_f & []F --> WF(M)_g"
wenzelm@21624
   972
  apply (clarsimp dest!: BoxWFI [temp_use] BoxDmdBox [temp_use, THEN iffD2]
wenzelm@21624
   973
    simp: WF_def [where A = M])
wenzelm@21624
   974
  apply (erule_tac F = F in dup_boxE)
wenzelm@42787
   975
  apply merge_temp_box
wenzelm@21624
   976
  apply (erule STL4Edup)
wenzelm@21624
   977
   apply assumption
wenzelm@21624
   978
  apply (clarsimp intro!: BoxDmd_simple [temp_use, THEN 1 [THEN DmdImpl, temp_use]])
wenzelm@21624
   979
  apply (rule classical)
wenzelm@21624
   980
  apply (subgoal_tac "sigmaa |= <> (($P & P` & N) & <A>_f)")
wenzelm@21624
   981
   apply (force simp: angle_def intro!: 2 [temp_use] elim!: DmdImplE [temp_use])
wenzelm@21624
   982
  apply (rule BoxDmd_simple [THEN DmdImpl, unfolded DmdDmd [temp_rewrite], temp_use])
wenzelm@21624
   983
  apply (simp add: NotDmd [temp_use] not_angle [try_rewrite])
wenzelm@42787
   984
  apply merge_act_box
wenzelm@21624
   985
  apply (frule 4 [temp_use])
wenzelm@21624
   986
     apply assumption+
wenzelm@21624
   987
  apply (drule STL6 [temp_use])
wenzelm@21624
   988
   apply assumption
wenzelm@21624
   989
  apply (erule_tac V = "sigmaa |= <>[]P" in thin_rl)
wenzelm@21624
   990
  apply (erule_tac V = "sigmaa |= []F" in thin_rl)
wenzelm@21624
   991
  apply (drule BoxWFI [temp_use])
wenzelm@21624
   992
  apply (erule_tac F = "ACT N & [~B]_f" in dup_boxE)
wenzelm@42787
   993
  apply merge_temp_box
wenzelm@21624
   994
  apply (erule DmdImpldup)
wenzelm@21624
   995
   apply assumption
wenzelm@21624
   996
  apply (auto simp: split_box_conj [try_rewrite] STL3 [try_rewrite]
wenzelm@21624
   997
    WF_Box [try_rewrite] box_stp_act [try_rewrite])
wenzelm@21624
   998
   apply (force elim!: TLA2E [where P = P, temp_use])
wenzelm@21624
   999
  apply (rule STL2 [temp_use])
wenzelm@21624
  1000
  apply (force simp: WF_def split_box_conj [try_rewrite]
wenzelm@21624
  1001
    elim!: mp intro!: InitDmd [temp_use] 3 [THEN STL4, temp_use])
wenzelm@21624
  1002
  done
wenzelm@21624
  1003
wenzelm@21624
  1004
lemma SF2:
wenzelm@21624
  1005
  assumes 1: "|- N & <B>_f --> <M>_g"
wenzelm@21624
  1006
    and 2: "|- $P & P` & <N & A>_f --> B"
wenzelm@21624
  1007
    and 3: "|- P & Enabled(<M>_g) --> Enabled(<A>_f)"
wenzelm@21624
  1008
    and 4: "|- [](N & [~B]_f) & SF(A)_f & []F & []<>Enabled(<M>_g) --> <>[]P"
wenzelm@21624
  1009
  shows "|- []N & SF(A)_f & []F --> SF(M)_g"
wenzelm@21624
  1010
  apply (clarsimp dest!: BoxSFI [temp_use] simp: 2 [try_rewrite] SF_def [where A = M])
wenzelm@21624
  1011
  apply (erule_tac F = F in dup_boxE)
wenzelm@21624
  1012
  apply (erule_tac F = "TEMP <>Enabled (<M>_g) " in dup_boxE)
wenzelm@42787
  1013
  apply merge_temp_box
wenzelm@21624
  1014
  apply (erule STL4Edup)
wenzelm@21624
  1015
   apply assumption
wenzelm@21624
  1016
  apply (clarsimp intro!: BoxDmd_simple [temp_use, THEN 1 [THEN DmdImpl, temp_use]])
wenzelm@21624
  1017
  apply (rule classical)
wenzelm@21624
  1018
  apply (subgoal_tac "sigmaa |= <> (($P & P` & N) & <A>_f)")
wenzelm@21624
  1019
   apply (force simp: angle_def intro!: 2 [temp_use] elim!: DmdImplE [temp_use])
wenzelm@21624
  1020
  apply (rule BoxDmd_simple [THEN DmdImpl, unfolded DmdDmd [temp_rewrite], temp_use])
wenzelm@21624
  1021
  apply (simp add: NotDmd [temp_use] not_angle [try_rewrite])
wenzelm@42787
  1022
  apply merge_act_box
wenzelm@21624
  1023
  apply (frule 4 [temp_use])
wenzelm@21624
  1024
     apply assumption+
wenzelm@21624
  1025
  apply (erule_tac V = "sigmaa |= []F" in thin_rl)
wenzelm@21624
  1026
  apply (drule BoxSFI [temp_use])
wenzelm@21624
  1027
  apply (erule_tac F = "TEMP <>Enabled (<M>_g)" in dup_boxE)
wenzelm@21624
  1028
  apply (erule_tac F = "ACT N & [~B]_f" in dup_boxE)
wenzelm@42787
  1029
  apply merge_temp_box
wenzelm@21624
  1030
  apply (erule DmdImpldup)
wenzelm@21624
  1031
   apply assumption
wenzelm@21624
  1032
  apply (auto simp: split_box_conj [try_rewrite] STL3 [try_rewrite]
wenzelm@21624
  1033
    SF_Box [try_rewrite] box_stp_act [try_rewrite])
wenzelm@21624
  1034
   apply (force elim!: TLA2E [where P = P, temp_use])
wenzelm@21624
  1035
  apply (rule STL2 [temp_use])
wenzelm@21624
  1036
  apply (force simp: SF_def split_box_conj [try_rewrite]
wenzelm@21624
  1037
    elim!: mp InfImpl [temp_use] intro!: 3 [temp_use])
wenzelm@21624
  1038
  done
wenzelm@21624
  1039
wenzelm@21624
  1040
(* ------------------------------------------------------------------------- *)
wenzelm@21624
  1041
(***           Liveness proofs by well-founded orderings                   ***)
wenzelm@21624
  1042
(* ------------------------------------------------------------------------- *)
wenzelm@21624
  1043
section "Well-founded orderings"
wenzelm@21624
  1044
wenzelm@21624
  1045
lemma wf_leadsto:
wenzelm@21624
  1046
  assumes 1: "wf r"
wenzelm@21624
  1047
    and 2: "!!x. sigma |= F x ~> (G | (EX y. #((y,x):r) & F y))    "
wenzelm@21624
  1048
  shows "sigma |= F x ~> G"
wenzelm@21624
  1049
  apply (rule 1 [THEN wf_induct])
wenzelm@21624
  1050
  apply (rule LatticeTriangle [temp_use])
wenzelm@21624
  1051
   apply (rule 2)
wenzelm@21624
  1052
  apply (auto simp: leadsto_exists [try_rewrite])
wenzelm@21624
  1053
  apply (case_tac "(y,x) :r")
wenzelm@21624
  1054
   apply force
wenzelm@21624
  1055
  apply (force simp: leadsto_def Init_simps intro!: necT [temp_use])
wenzelm@21624
  1056
  done
wenzelm@21624
  1057
wenzelm@21624
  1058
(* If r is well-founded, state function v cannot decrease forever *)
wenzelm@21624
  1059
lemma wf_not_box_decrease: "!!r. wf r ==> |- [][ (v`, $v) : #r ]_v --> <>[][#False]_v"
wenzelm@21624
  1060
  apply clarsimp
wenzelm@21624
  1061
  apply (rule ccontr)
wenzelm@21624
  1062
  apply (subgoal_tac "sigma |= (EX x. v=#x) ~> #False")
wenzelm@21624
  1063
   apply (drule leadsto_false [temp_use, THEN iffD1, THEN STL2_gen [temp_use]])
wenzelm@21624
  1064
   apply (force simp: Init_defs)
wenzelm@21624
  1065
  apply (clarsimp simp: leadsto_exists [try_rewrite] not_square [try_rewrite] more_temp_simps)
wenzelm@21624
  1066
  apply (erule wf_leadsto)
wenzelm@21624
  1067
  apply (rule ensures_simple [temp_use])
wenzelm@21624
  1068
   apply (auto simp: square_def angle_def)
wenzelm@21624
  1069
  done
wenzelm@21624
  1070
wenzelm@21624
  1071
(* "wf r  ==>  |- <>[][ (v`, $v) : #r ]_v --> <>[][#False]_v" *)
wenzelm@21624
  1072
lemmas wf_not_dmd_box_decrease =
wenzelm@45605
  1073
  wf_not_box_decrease [THEN DmdImpl, unfolded more_temp_simps]
wenzelm@21624
  1074
wenzelm@21624
  1075
(* If there are infinitely many steps where v decreases, then there
wenzelm@21624
  1076
   have to be infinitely many non-stuttering steps where v doesn't decrease.
wenzelm@21624
  1077
*)
wenzelm@21624
  1078
lemma wf_box_dmd_decrease:
wenzelm@21624
  1079
  assumes 1: "wf r"
wenzelm@21624
  1080
  shows "|- []<>((v`, $v) : #r) --> []<><(v`, $v) ~: #r>_v"
wenzelm@21624
  1081
  apply clarsimp
wenzelm@21624
  1082
  apply (rule ccontr)
wenzelm@21624
  1083
  apply (simp add: not_angle [try_rewrite] more_temp_simps)
wenzelm@21624
  1084
  apply (drule 1 [THEN wf_not_dmd_box_decrease [temp_use]])
wenzelm@21624
  1085
  apply (drule BoxDmdDmdBox [temp_use])
wenzelm@21624
  1086
   apply assumption
wenzelm@21624
  1087
  apply (subgoal_tac "sigma |= []<> ((#False) ::action)")
wenzelm@21624
  1088
   apply force
wenzelm@21624
  1089
  apply (erule STL4E)
wenzelm@21624
  1090
  apply (rule DmdImpl)
wenzelm@21624
  1091
  apply (force intro: 1 [THEN wf_irrefl, temp_use])
wenzelm@21624
  1092
  done
wenzelm@21624
  1093
wenzelm@21624
  1094
(* In particular, for natural numbers, if n decreases infinitely often
wenzelm@21624
  1095
   then it has to increase infinitely often.
wenzelm@21624
  1096
*)
wenzelm@21624
  1097
lemma nat_box_dmd_decrease: "!!n::nat stfun. |- []<>(n` < $n) --> []<>($n < n`)"
wenzelm@21624
  1098
  apply clarsimp
wenzelm@21624
  1099
  apply (subgoal_tac "sigma |= []<><~ ((n`,$n) : #less_than) >_n")
wenzelm@21624
  1100
   apply (erule thin_rl)
wenzelm@21624
  1101
   apply (erule STL4E)
wenzelm@21624
  1102
   apply (rule DmdImpl)
wenzelm@21624
  1103
   apply (clarsimp simp: angle_def [try_rewrite])
wenzelm@21624
  1104
  apply (rule wf_box_dmd_decrease [temp_use])
wenzelm@21624
  1105
   apply (auto elim!: STL4E [temp_use] DmdImplE [temp_use])
wenzelm@21624
  1106
  done
wenzelm@21624
  1107
wenzelm@21624
  1108
wenzelm@21624
  1109
(* ------------------------------------------------------------------------- *)
wenzelm@21624
  1110
(***           Flexible quantification over state variables                ***)
wenzelm@21624
  1111
(* ------------------------------------------------------------------------- *)
wenzelm@21624
  1112
section "Flexible quantification"
wenzelm@21624
  1113
wenzelm@21624
  1114
lemma aallI:
wenzelm@21624
  1115
  assumes 1: "basevars vs"
wenzelm@21624
  1116
    and 2: "(!!x. basevars (x,vs) ==> sigma |= F x)"
wenzelm@21624
  1117
  shows "sigma |= (AALL x. F x)"
wenzelm@21624
  1118
  by (auto simp: aall_def elim!: eexE [temp_use] intro!: 1 dest!: 2 [temp_use])
wenzelm@21624
  1119
wenzelm@21624
  1120
lemma aallE: "|- (AALL x. F x) --> F x"
wenzelm@21624
  1121
  apply (unfold aall_def)
wenzelm@21624
  1122
  apply clarsimp
wenzelm@21624
  1123
  apply (erule contrapos_np)
wenzelm@21624
  1124
  apply (force intro!: eexI [temp_use])
wenzelm@21624
  1125
  done
wenzelm@21624
  1126
wenzelm@21624
  1127
(* monotonicity of quantification *)
wenzelm@21624
  1128
lemma eex_mono:
wenzelm@21624
  1129
  assumes 1: "sigma |= EEX x. F x"
wenzelm@21624
  1130
    and 2: "!!x. sigma |= F x --> G x"
wenzelm@21624
  1131
  shows "sigma |= EEX x. G x"
wenzelm@21624
  1132
  apply (rule unit_base [THEN 1 [THEN eexE]])
wenzelm@21624
  1133
  apply (rule eexI [temp_use])
wenzelm@21624
  1134
  apply (erule 2 [unfolded intensional_rews, THEN mp])
wenzelm@21624
  1135
  done
wenzelm@21624
  1136
wenzelm@21624
  1137
lemma aall_mono:
wenzelm@21624
  1138
  assumes 1: "sigma |= AALL x. F(x)"
wenzelm@21624
  1139
    and 2: "!!x. sigma |= F(x) --> G(x)"
wenzelm@21624
  1140
  shows "sigma |= AALL x. G(x)"
wenzelm@21624
  1141
  apply (rule unit_base [THEN aallI])
wenzelm@21624
  1142
  apply (rule 2 [unfolded intensional_rews, THEN mp])
wenzelm@21624
  1143
  apply (rule 1 [THEN aallE [temp_use]])
wenzelm@21624
  1144
  done
wenzelm@21624
  1145
wenzelm@21624
  1146
(* Derived history introduction rule *)
wenzelm@21624
  1147
lemma historyI:
wenzelm@21624
  1148
  assumes 1: "sigma |= Init I"
wenzelm@21624
  1149
    and 2: "sigma |= []N"
wenzelm@21624
  1150
    and 3: "basevars vs"
wenzelm@21624
  1151
    and 4: "!!h. basevars(h,vs) ==> |- I & h = ha --> HI h"
wenzelm@21624
  1152
    and 5: "!!h s t. [| basevars(h,vs); N (s,t); h t = hb (h s) (s,t) |] ==> HN h (s,t)"
wenzelm@21624
  1153
  shows "sigma |= EEX h. Init (HI h) & [](HN h)"
wenzelm@21624
  1154
  apply (rule history [temp_use, THEN eexE])
wenzelm@21624
  1155
  apply (rule 3)
wenzelm@21624
  1156
  apply (rule eexI [temp_use])
wenzelm@21624
  1157
  apply clarsimp
wenzelm@21624
  1158
  apply (rule conjI)
wenzelm@21624
  1159
   prefer 2
wenzelm@21624
  1160
   apply (insert 2)
wenzelm@42787
  1161
   apply merge_box
wenzelm@21624
  1162
   apply (force elim!: STL4E [temp_use] 5 [temp_use])
wenzelm@21624
  1163
  apply (insert 1)
wenzelm@21624
  1164
  apply (force simp: Init_defs elim!: 4 [temp_use])
wenzelm@21624
  1165
  done
wenzelm@21624
  1166
wenzelm@21624
  1167
(* ----------------------------------------------------------------------
wenzelm@21624
  1168
   example of a history variable: existence of a clock
wenzelm@21624
  1169
*)
wenzelm@21624
  1170
wenzelm@21624
  1171
lemma "|- EEX h. Init(h = #True) & [](h` = (~$h))"
wenzelm@21624
  1172
  apply (rule tempI)
wenzelm@21624
  1173
  apply (rule historyI)
wenzelm@21624
  1174
  apply (force simp: Init_defs intro!: unit_base [temp_use] necT [temp_use])+
wenzelm@21624
  1175
  done
wenzelm@21624
  1176
wenzelm@21624
  1177
end