@@ -18,95 +18,95 @@ val _ = set_trace "Goalstack.print_goal_at_top" 0;
18
18
19
19
(* The original open transition relation *)
20
20
Inductive TRANS :
21
- [TAU]
21
+ [TAU: ]
22
22
!P. TRANS (Tau P) (TauR P)
23
- [INPUT]
23
+ [INPUT: ]
24
24
!a x P. x <> a ==> TRANS (Input a x P) (InputS a x P)
25
- [OUTPUT]
25
+ [OUTPUT: ]
26
26
!a b P. TRANS (Output a b P) (FreeOutput a b P)
27
- [MATCH]
27
+ [MATCH: ]
28
28
!P Rs b. TRANS P Rs ==> TRANS (Match b b P) Rs
29
- [MISMACH]
29
+ [MISMACH: ]
30
30
!P Rs a b. TRANS P Rs /\ a <> b ==> TRANS (Mismatch a b P) Rs
31
31
32
- [OPEN]
32
+ [OPEN: ]
33
33
!P P' a b. TRANS P (FreeOutput a b P') /\ a <> b ==>
34
34
TRANS (Res b P) (BoundOutput a b P')
35
- [SUM1]
35
+ [SUM1: ]
36
36
!P Q Rs. TRANS P Rs ==> TRANS (Sum P Q) Rs
37
- [SUM2]
37
+ [SUM2: ]
38
38
!P Q Rs. TRANS Q Rs ==> TRANS (Sum P Q) Rs
39
39
40
- [PAR1_I]
40
+ [PAR1_I: ]
41
41
!P P' Q a x.
42
42
TRANS P (InputS a x P') /\ x # P /\ x # Q /\ x <> a ==>
43
43
TRANS (Par P Q) (InputS a x (Par P' Q))
44
- [PAR1_BO]
44
+ [PAR1_BO: ]
45
45
!P P' Q a x.
46
46
TRANS P (BoundOutput a x P') /\ x # P /\ x # Q /\ x <> a ==>
47
47
TRANS (Par P Q) (BoundOutput a x (Par P' Q))
48
- [PAR1_FO]
48
+ [PAR1_FO: ]
49
49
!P P' Q a b.
50
50
TRANS P (FreeOutput a b P') ==>
51
51
TRANS (Par P Q) (FreeOutput a b (Par P' Q))
52
- [PAR1_T]
52
+ [PAR1_T: ]
53
53
!P P' Q. TRANS P (TauR P') ==> TRANS (Par P Q) (TauR (Par P' Q))
54
54
55
- [PAR2_I]
55
+ [PAR2_I: ]
56
56
!P Q Q' a x.
57
57
TRANS Q (InputS a x Q') /\ x # Q /\ x # P /\ x <> a ==>
58
58
TRANS (Par P Q) (InputS a x (Par P Q'))
59
- [PAR2_BO]
59
+ [PAR2_BO: ]
60
60
!P Q Q' a x.
61
61
TRANS Q (BoundOutput a x Q') /\ x # Q /\ x # P /\ x <> a ==>
62
62
TRANS (Par P Q) (BoundOutput a x (Par P Q'))
63
- [PAR2_FO]
63
+ [PAR2_FO: ]
64
64
!P Q Q' a b.
65
65
TRANS Q (FreeOutput a b Q') ==>
66
66
TRANS (Par P Q) (FreeOutput a b (Par P Q'))
67
- [PAR2_T]
67
+ [PAR2_T: ]
68
68
!P Q Q'. TRANS Q (TauR Q') ==> TRANS (Par P Q) (TauR (Par P Q'))
69
69
70
- [COMM1] (* TODO: tpm should change to SUB *)
70
+ [COMM1: ] (* TODO: tpm should change to SUB *)
71
71
!P P' Q Q' a b x.
72
72
TRANS P (InputS a x P') /\ TRANS Q (FreeOutput a b Q') /\
73
73
x # P /\ x # Q /\ x <> a /\ x <> b /\ x # Q' ==>
74
74
TRANS (Par P Q) (TauR (Par (tpm [(x,b)] P') Q'))
75
- [COMM2] (* TODO: tpm should change to SUB *)
75
+ [COMM2: ] (* TODO: tpm should change to SUB *)
76
76
!P P' Q Q' a b x.
77
77
TRANS P (FreeOutput a b P') /\ TRANS Q (InputS a x Q') /\
78
78
x # Q /\ x # P /\ x <> a /\ x <> b /\ x # P' ==>
79
79
TRANS (Par P Q) (TauR (Par P' (tpm [(x,b)] Q')))
80
- [CLOSE1] (* TODO: tpm should change to SUB *)
80
+ [CLOSE1: ] (* TODO: tpm should change to SUB *)
81
81
!P P' Q Q' a x y.
82
82
TRANS P (InputS a x P') /\
83
83
TRANS Q (BoundOutput a y Q') /\
84
84
x # P /\ x # Q /\ y # P /\ y # Q /\
85
85
x <> a /\ x # Q' /\ y <> a /\ y # P' /\ x <> y ==>
86
86
TRANS (Par P Q) (TauR (Res y (Par (tpm [(x,y)] P') Q')))
87
- [CLOSE2] (* TODO: tpm should change to SUB *)
87
+ [CLOSE2: ] (* TODO: tpm should change to SUB *)
88
88
!P P' Q Q' a x y.
89
89
TRANS P (BoundOutput a y P') /\
90
90
TRANS Q (InputS a x Q') /\
91
91
x # P /\ x # Q /\ y # P /\ y # Q /\
92
92
x <> a /\ x # P' /\ y <> a /\ y # Q' /\ x <> y ==>
93
93
TRANS (Par P Q) (TauR (Res y (Par P' (tpm [(x,y)] Q'))))
94
- [RES_I]
94
+ [RES_I: ]
95
95
!P P' a x y.
96
96
TRANS P (InputS a x P') /\
97
97
y <> a /\ y <> x /\ x # P /\ x <> a ==>
98
98
TRANS (Res y P) (InputS a x (Res y P'))
99
- [RES_BO]
99
+ [RES_BO: ]
100
100
!P P' a x y.
101
101
TRANS P (BoundOutput a x P') /\
102
102
y <> a /\ y <> x /\ x # P /\ x <> a ==>
103
103
TRANS (Res y P) (BoundOutput a x (Res y P'))
104
- [RES_FO]
104
+ [RES_FO: ]
105
105
!P P' a b y.
106
106
TRANS P (FreeOutput a b P') /\
107
107
y <> a /\ y <> b ==>
108
108
TRANS (Res y P) (FreeOutput a b (Res y P'))
109
- [RES_T]
109
+ [RES_T: ]
110
110
!P P' y.
111
111
TRANS P (TauR P') ==> TRANS (Res y P) (TauR (Res y P'))
112
112
End
0 commit comments