3071
|
1 |
(* Title: HOLCF/IOA/meta_theory/CompoScheds.thy
|
3275
|
2 |
ID: $Id$
|
3071
|
3 |
Author: Olaf M"uller
|
|
4 |
Copyright 1996 TU Muenchen
|
|
5 |
|
|
6 |
Compositionality on Schedule level.
|
|
7 |
*)
|
|
8 |
|
|
9 |
CompoScheds = CompoExecs +
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
consts
|
|
14 |
|
|
15 |
mkex ::"('a,'s)ioa => ('a,'t)ioa => 'a Seq =>
|
|
16 |
('a,'s)execution => ('a,'t)execution =>('a,'s*'t)execution"
|
|
17 |
mkex2 ::"('a,'s)ioa => ('a,'t)ioa => 'a Seq ->
|
|
18 |
('a,'s)pairs -> ('a,'t)pairs ->
|
|
19 |
('s => 't => ('a,'s*'t)pairs)"
|
3521
|
20 |
par_scheds ::"['a schedule_module,'a schedule_module] => 'a schedule_module"
|
|
21 |
|
3071
|
22 |
|
|
23 |
|
|
24 |
defs
|
|
25 |
|
|
26 |
mkex_def
|
|
27 |
"mkex A B sch exA exB ==
|
|
28 |
((fst exA,fst exB),
|
10835
|
29 |
(mkex2 A B$sch$(snd exA)$(snd exB)) (fst exA) (fst exB))"
|
3071
|
30 |
|
|
31 |
mkex2_def
|
10835
|
32 |
"mkex2 A B == (fix$(LAM h sch exA exB. (%s t. case sch of
|
3071
|
33 |
nil => nil
|
|
34 |
| x##xs =>
|
|
35 |
(case x of
|
|
36 |
Undef => UU
|
|
37 |
| Def y =>
|
|
38 |
(if y:act A then
|
|
39 |
(if y:act B then
|
10835
|
40 |
(case HD$exA of
|
3071
|
41 |
Undef => UU
|
10835
|
42 |
| Def a => (case HD$exB of
|
3071
|
43 |
Undef => UU
|
|
44 |
| Def b =>
|
|
45 |
(y,(snd a,snd b))>>
|
10835
|
46 |
(h$xs$(TL$exA)$(TL$exB)) (snd a) (snd b)))
|
3071
|
47 |
else
|
10835
|
48 |
(case HD$exA of
|
3071
|
49 |
Undef => UU
|
|
50 |
| Def a =>
|
10835
|
51 |
(y,(snd a,t))>>(h$xs$(TL$exA)$exB) (snd a) t)
|
3071
|
52 |
)
|
|
53 |
else
|
|
54 |
(if y:act B then
|
10835
|
55 |
(case HD$exB of
|
3071
|
56 |
Undef => UU
|
|
57 |
| Def b =>
|
10835
|
58 |
(y,(s,snd b))>>(h$xs$exA$(TL$exB)) s (snd b))
|
3071
|
59 |
else
|
|
60 |
UU
|
|
61 |
)
|
|
62 |
)
|
|
63 |
))))"
|
|
64 |
|
3521
|
65 |
par_scheds_def
|
|
66 |
"par_scheds SchedsA SchedsB ==
|
|
67 |
let schA = fst SchedsA; sigA = snd SchedsA;
|
|
68 |
schB = fst SchedsB; sigB = snd SchedsB
|
|
69 |
in
|
10835
|
70 |
( {sch. Filter (%a. a:actions sigA)$sch : schA}
|
|
71 |
Int {sch. Filter (%a. a:actions sigB)$sch : schB}
|
3521
|
72 |
Int {sch. Forall (%x. x:(actions sigA Un actions sigB)) sch},
|
|
73 |
asig_comp sigA sigB)"
|
|
74 |
|
|
75 |
end
|