4559
|
1 |
(* Title: HOLCF/IOA/meta_theory/TL.ML
|
|
2 |
ID: $Id$
|
|
3 |
Author: Olaf M"uller
|
|
4 |
Copyright 1997 TU Muenchen
|
|
5 |
|
|
6 |
Temporal Logic
|
|
7 |
*)
|
|
8 |
|
|
9 |
|
|
10 |
goal thy "[] <> (.~ P) = (.~ <> [] P)";
|
|
11 |
br ext 1;
|
|
12 |
by (simp_tac (simpset() addsimps [Diamond_def,NOT_def,Box_def])1);
|
|
13 |
auto();
|
|
14 |
qed"simple_try";
|
|
15 |
|
|
16 |
goal thy "nil |= [] P";
|
|
17 |
by (asm_full_simp_tac (simpset() addsimps [satisfies_def,
|
|
18 |
Box_def,tsuffix_def,suffix_def,nil_is_Conc])1);
|
|
19 |
qed"Boxnil";
|
|
20 |
|
|
21 |
goal thy "~(nil |= <> P)";
|
|
22 |
by (simp_tac (simpset() addsimps [Diamond_def,satisfies_def,NOT_def])1);
|
|
23 |
by (cut_inst_tac [] Boxnil 1);
|
|
24 |
by (asm_full_simp_tac (simpset() addsimps [satisfies_def])1);
|
|
25 |
qed"Diamondnil";
|
|
26 |
|
|
27 |
goal thy "(<> F) s = (? s2. tsuffix s2 s & F s2)";
|
|
28 |
by (simp_tac (simpset() addsimps [Diamond_def,NOT_def,Box_def])1);
|
|
29 |
qed"Diamond_def2";
|
|
30 |
|
|
31 |
|
|
32 |
|
|
33 |
section "TLA Axiomatization by Merz";
|
|
34 |
|
|
35 |
(* ---------------------------------------------------------------- *)
|
|
36 |
(* TLA Axiomatization by Merz *)
|
|
37 |
(* ---------------------------------------------------------------- *)
|
|
38 |
|
|
39 |
goal thy "suffix s s";
|
|
40 |
by (simp_tac (simpset() addsimps [suffix_def])1);
|
|
41 |
by (res_inst_tac [("x","nil")] exI 1);
|
|
42 |
auto();
|
|
43 |
qed"suffix_refl";
|
|
44 |
|
|
45 |
goal thy "s~=UU & s~=nil --> (s |= [] F .--> F)";
|
|
46 |
by (simp_tac (simpset() addsimps [satisfies_def,IMPLIES_def,Box_def])1);
|
|
47 |
by (REPEAT (rtac impI 1));
|
|
48 |
by (eres_inst_tac [("x","s")] allE 1);
|
|
49 |
by (asm_full_simp_tac (simpset() addsimps [tsuffix_def,suffix_refl])1);
|
|
50 |
qed"reflT";
|
|
51 |
|
|
52 |
|
|
53 |
goal thy "!!x. [| suffix y x ; suffix z y |] ==> suffix z x";
|
|
54 |
by (asm_full_simp_tac (simpset() addsimps [suffix_def])1);
|
|
55 |
auto();
|
|
56 |
by (res_inst_tac [("x","s1 @@ s1a")] exI 1);
|
|
57 |
auto();
|
|
58 |
by (simp_tac (simpset() addsimps [Conc_assoc]) 1);
|
|
59 |
qed"suffix_trans";
|
|
60 |
|
|
61 |
goal thy "s |= [] F .--> [] [] F";
|
|
62 |
by (simp_tac (simpset() addsimps [satisfies_def,IMPLIES_def,Box_def,tsuffix_def])1);
|
|
63 |
auto();
|
|
64 |
bd suffix_trans 1;
|
|
65 |
ba 1;
|
|
66 |
by (eres_inst_tac [("x","s2a")] allE 1);
|
|
67 |
auto();
|
|
68 |
qed"transT";
|
|
69 |
|
|
70 |
|
|
71 |
goal thy "s |= [] (F .--> G) .--> [] F .--> [] G";
|
|
72 |
by (simp_tac (simpset() addsimps [satisfies_def,IMPLIES_def,Box_def])1);
|
|
73 |
qed"normalT";
|
|
74 |
|
|
75 |
|
|
76 |
(*
|
|
77 |
goal thy "s |= <> F .& <> G .--> (<> (F .& <> G) .| <> (G .& <> F))";
|
|
78 |
by (simp_tac (simpset() addsimps [satisfies_def,IMPLIES_def,AND_def,OR_def,Diamond_def2])1);
|
|
79 |
br impI 1;
|
|
80 |
be conjE 1;
|
|
81 |
be exE 1;
|
|
82 |
be exE 1;
|
|
83 |
|
|
84 |
|
|
85 |
br disjI1 1;
|
|
86 |
|
|
87 |
goal thy "!!s. [| tsuffix s1 s ; tsuffix s2 s|] ==> tsuffix s2 s1 | tsuffix s1 s2";
|
|
88 |
by (asm_full_simp_tac (simpset() addsimps [tsuffix_def,suffix_def])1);
|
|
89 |
by (REPEAT (etac conjE 1));
|
|
90 |
by (REPEAT (etac exE 1));
|
|
91 |
by (REPEAT (etac conjE 1));
|
|
92 |
by (hyp_subst_tac 1);
|
|
93 |
|
|
94 |
*)
|
|
95 |
|
|
96 |
|
|
97 |
section "TLA Rules by Lamport";
|
|
98 |
|
|
99 |
(* ---------------------------------------------------------------- *)
|
|
100 |
(* TLA Rules by Lamport *)
|
|
101 |
(* ---------------------------------------------------------------- *)
|
|
102 |
|
|
103 |
goal thy "!! P. validT P ==> validT ([] P)";
|
|
104 |
by (asm_full_simp_tac (simpset() addsimps [validT_def,satisfies_def,Box_def,tsuffix_def])1);
|
|
105 |
qed"STL1a";
|
|
106 |
|
|
107 |
goal thy "!! P. valid P ==> validT (Init P)";
|
|
108 |
by (asm_full_simp_tac (simpset() addsimps [valid_def,validT_def,satisfies_def,Init_def])1);
|
|
109 |
qed"STL1b";
|
|
110 |
|
|
111 |
goal thy "!! P. valid P ==> validT ([] (Init P))";
|
|
112 |
br STL1a 1;
|
|
113 |
be STL1b 1;
|
|
114 |
qed"STL1";
|
|
115 |
|
|
116 |
(* Note that unlift and HD is not at all used !!! *)
|
|
117 |
goal thy "!! P. valid (P .--> Q) ==> validT ([] (Init P) .--> [] (Init Q))";
|
|
118 |
by (asm_full_simp_tac (simpset() addsimps [valid_def,validT_def,satisfies_def,IMPLIES_def,Box_def,Init_def])1);
|
|
119 |
qed"STL4";
|
|
120 |
|
|
121 |
|
|
122 |
section "LTL Axioms by Manna/Pnueli";
|
|
123 |
|
|
124 |
(* ---------------------------------------------------------------- *)
|
|
125 |
(* LTL Axioms by Manna/Pnueli *)
|
|
126 |
(* ---------------------------------------------------------------- *)
|
|
127 |
|
|
128 |
|
|
129 |
goalw thy [tsuffix_def,suffix_def]
|
|
130 |
"s~=UU & s~=nil --> tsuffix s2 (TL`s) --> tsuffix s2 s";
|
|
131 |
auto();
|
|
132 |
by (Seq_case_simp_tac "s" 1);
|
|
133 |
by (res_inst_tac [("x","a>>s1")] exI 1);
|
|
134 |
auto();
|
|
135 |
qed_spec_mp"tsuffix_TL";
|
|
136 |
|
|
137 |
val tsuffix_TL2 = conjI RS tsuffix_TL;
|
|
138 |
|
|
139 |
|
|
140 |
goalw thy [Next_def,satisfies_def,NOT_def,IMPLIES_def,AND_def,Box_def]
|
|
141 |
"s~=UU & s~=nil --> (s |= [] F .--> (F .& (Next ([] F))))";
|
|
142 |
auto();
|
|
143 |
(* []F .--> F *)
|
|
144 |
by (eres_inst_tac [("x","s")] allE 1);
|
|
145 |
by (asm_full_simp_tac (simpset() addsimps [tsuffix_def,suffix_refl])1);
|
|
146 |
(* []F .--> Next [] F *)
|
|
147 |
by (asm_full_simp_tac (simpset() setloop split_tac [expand_if]) 1);
|
|
148 |
auto();
|
|
149 |
bd tsuffix_TL2 1;
|
|
150 |
by (REPEAT (atac 1));
|
|
151 |
auto();
|
|
152 |
qed"LTL1";
|
|
153 |
|
|
154 |
|
|
155 |
goalw thy [Next_def,satisfies_def,NOT_def,IMPLIES_def]
|
|
156 |
"s |= .~ (Next F) .--> (Next (.~ F))";
|
|
157 |
by (asm_full_simp_tac (simpset() setloop split_tac [expand_if]) 1);
|
|
158 |
qed"LTL2a";
|
|
159 |
|
|
160 |
goalw thy [Next_def,satisfies_def,NOT_def,IMPLIES_def]
|
|
161 |
"s |= (Next (.~ F)) .--> (.~ (Next F))";
|
|
162 |
by (asm_full_simp_tac (simpset() setloop split_tac [expand_if]) 1);
|
|
163 |
qed"LTL2b";
|
|
164 |
|
|
165 |
goalw thy [Next_def,satisfies_def,NOT_def,IMPLIES_def]
|
|
166 |
"ex |= (Next (F .--> G)) .--> (Next F) .--> (Next G)";
|
|
167 |
by (asm_full_simp_tac (simpset() setloop split_tac [expand_if]) 1);
|
|
168 |
qed"LTL3";
|
|
169 |
|
|
170 |
goalw thy [Next_def,satisfies_def,Box_def,NOT_def,IMPLIES_def]
|
|
171 |
"s |= [] (F .--> Next F) .--> F .--> []F";
|
|
172 |
by (asm_full_simp_tac (simpset() setloop split_tac [expand_if]) 1);
|
|
173 |
auto();
|
|
174 |
|
|
175 |
|
|
176 |
by (asm_full_simp_tac (simpset() addsimps [tsuffix_def,suffix_def])1);
|
|
177 |
auto();
|
|
178 |
|
|
179 |
|