diff options
author | 2019-08-13 18:11:24 -0400 | |
---|---|---|
committer | 2019-08-13 18:11:24 -0400 | |
commit | a64e889b0af396d79cd71daf46e171f67fc8b444 (patch) | |
tree | d8041b1a0483d235c29a2ebe81d219a0fdf42631 /Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql | |
parent | change exploration value function (diff) | |
download | VIATRA-Generator-a64e889b0af396d79cd71daf46e171f67fc8b444.tar.gz VIATRA-Generator-a64e889b0af396d79cd71daf46e171f67fc8b444.tar.zst VIATRA-Generator-a64e889b0af396d79cd71daf46e171f67fc8b444.zip |
comment out constraint for Synchronizations
Diffstat (limited to 'Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql')
-rw-r--r-- | Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql | 538 |
1 files changed, 269 insertions, 269 deletions
diff --git a/Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql b/Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql index 58f66fe2..cf3b9a42 100644 --- a/Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql +++ b/Domains/hu.bme.mit.inf.dslreasoner.domains.yakindu.sgraph/queries/hu/bme/mit/inf/dslreasoner/partialsnapshot_mavo/yakindu/mutated/mutated.vql | |||
@@ -1,270 +1,270 @@ | |||
1 | package hu.bme.mit.inf.dslreasoner.partialsnapshot_mavo.yakindu.mutated | 1 | package hu.bme.mit.inf.dslreasoner.partialsnapshot_mavo.yakindu.mutated |
2 | 2 | // | |
3 | import epackage "hu.bme.mit.inf.yakindumm" | 3 | //import epackage "hu.bme.mit.inf.yakindumm" |
4 | 4 | // | |
5 | ///////// | 5 | /////////// |
6 | // Entry | 6 | //// Entry |
7 | ///////// | 7 | /////////// |
8 | 8 | // | |
9 | pattern entryInRegion_M0(r1 : Region, e1 : Entry) { | 9 | //pattern entryInRegion_M0(r1 : Region, e1 : Entry) { |
10 | Region.vertices(r1, e1); | 10 | // Region.vertices(r1, e1); |
11 | } | 11 | //} |
12 | pattern entryInRegion_M1(r1 : Region, e1) { | 12 | //pattern entryInRegion_M1(r1 : Region, e1) { |
13 | Region.vertices(r1, e1); | 13 | // Region.vertices(r1, e1); |
14 | } | 14 | //} |
15 | pattern entryInRegion_M2(r1 : Region, e1: Entry) { | 15 | //pattern entryInRegion_M2(r1 : Region, e1: Entry) { |
16 | // For positive constraint | 16 | // // For positive constraint |
17 | Region(r1);Entry(e1); | 17 | // Region(r1);Entry(e1); |
18 | } | 18 | //} |
19 | 19 | // | |
20 | 20 | // | |
21 | //@Constraint(severity="error", message="error", key = {r1}) | 21 | ////@Constraint(severity="error", message="error", key = {r1}) |
22 | pattern noEntryInRegion_M0(r1 : Region) { | 22 | //pattern noEntryInRegion_M0(r1 : Region) { |
23 | neg find entryInRegion_M0(r1, _); | 23 | // neg find entryInRegion_M0(r1, _); |
24 | } | 24 | //} |
25 | pattern noEntryInRegion_M1(r1 : Region) { | 25 | //pattern noEntryInRegion_M1(r1 : Region) { |
26 | neg find entryInRegion_M1(r1, _); | 26 | // neg find entryInRegion_M1(r1, _); |
27 | } | 27 | //} |
28 | pattern noEntryInRegion_M2(r1 : Region) { | 28 | //pattern noEntryInRegion_M2(r1 : Region) { |
29 | neg find entryInRegion_M2(r1, _); | 29 | // neg find entryInRegion_M2(r1, _); |
30 | } | 30 | //} |
31 | pattern noEntryInRegion_M3(r1 : Region) { | 31 | //pattern noEntryInRegion_M3(r1 : Region) { |
32 | find entryInRegion_M0(r1, _); | 32 | // find entryInRegion_M0(r1, _); |
33 | } | 33 | //} |
34 | pattern noEntryInRegion_M4(r1 : Region) { | 34 | //pattern noEntryInRegion_M4(r1 : Region) { |
35 | find entryInRegion_M1(r1, _); | 35 | // find entryInRegion_M1(r1, _); |
36 | } | 36 | //} |
37 | pattern noEntryInRegion_M5(r1 : Region) { | 37 | //pattern noEntryInRegion_M5(r1 : Region) { |
38 | find entryInRegion_M2(r1, _); | 38 | // find entryInRegion_M2(r1, _); |
39 | } | 39 | //} |
40 | 40 | // | |
41 | //@Constraint(severity="error", message="error", key = {r}) | 41 | ////@Constraint(severity="error", message="error", key = {r}) |
42 | pattern multipleEntryInRegion_M0(r : Region) { | 42 | //pattern multipleEntryInRegion_M0(r : Region) { |
43 | find entryInRegion_M0(r, e1); | 43 | // find entryInRegion_M0(r, e1); |
44 | find entryInRegion_M0(r, e2); | 44 | // find entryInRegion_M0(r, e2); |
45 | e1 != e2; | 45 | // e1 != e2; |
46 | } | 46 | //} |
47 | pattern multipleEntryInRegion_M1(r : Region) { | 47 | //pattern multipleEntryInRegion_M1(r : Region) { |
48 | find entryInRegion_M1(r, e1); | 48 | // find entryInRegion_M1(r, e1); |
49 | find entryInRegion_M0(r, e2); | 49 | // find entryInRegion_M0(r, e2); |
50 | e1 != e2; | 50 | // e1 != e2; |
51 | } | 51 | //} |
52 | pattern multipleEntryInRegion_M2(r : Region) { | 52 | //pattern multipleEntryInRegion_M2(r : Region) { |
53 | find entryInRegion_M2(r, e1); | 53 | // find entryInRegion_M2(r, e1); |
54 | find entryInRegion_M0(r, e2); | 54 | // find entryInRegion_M0(r, e2); |
55 | e1 != e2; | 55 | // e1 != e2; |
56 | } | 56 | //} |
57 | pattern multipleEntryInRegion_M3(r : Region) { | 57 | //pattern multipleEntryInRegion_M3(r : Region) { |
58 | find entryInRegion_M0(r, e1); | 58 | // find entryInRegion_M0(r, e1); |
59 | find entryInRegion_M1(r, e2); | 59 | // find entryInRegion_M1(r, e2); |
60 | e1 != e2; | 60 | // e1 != e2; |
61 | } | 61 | //} |
62 | pattern multipleEntryInRegion_M4(r : Region) { | 62 | //pattern multipleEntryInRegion_M4(r : Region) { |
63 | find entryInRegion_M2(r, e1); | 63 | // find entryInRegion_M2(r, e1); |
64 | find entryInRegion_M2(r, e2); | 64 | // find entryInRegion_M2(r, e2); |
65 | e1 != e2; | 65 | // e1 != e2; |
66 | } | 66 | //} |
67 | pattern multipleEntryInRegion_M5(r : Region) { | 67 | //pattern multipleEntryInRegion_M5(r : Region) { |
68 | find entryInRegion_M0(r, e1); | 68 | // find entryInRegion_M0(r, e1); |
69 | find entryInRegion_M0(r, e2); | 69 | // find entryInRegion_M0(r, e2); |
70 | } | 70 | //} |
71 | 71 | // | |
72 | 72 | // | |
73 | pattern transition_M0(t : Transition, src : Vertex, trg : Vertex) { | 73 | //pattern transition_M0(t : Transition, src : Vertex, trg : Vertex) { |
74 | Transition.source(t, src); | 74 | // Transition.source(t, src); |
75 | Transition.target(t, trg); | 75 | // Transition.target(t, trg); |
76 | } | 76 | //} |
77 | pattern transition_M1(t : Transition, src : Vertex, trg : Vertex) { | 77 | //pattern transition_M1(t : Transition, src : Vertex, trg : Vertex) { |
78 | Transition.source(t, src); | 78 | // Transition.source(t, src); |
79 | Vertex(trg); | 79 | // Vertex(trg); |
80 | } | 80 | //} |
81 | pattern transition_M2(t : Transition, src : Vertex, trg : Vertex) { | 81 | //pattern transition_M2(t : Transition, src : Vertex, trg : Vertex) { |
82 | Vertex(src); | 82 | // Vertex(src); |
83 | Transition.target(t, trg); | 83 | // Transition.target(t, trg); |
84 | } | 84 | //} |
85 | pattern transition_M3(t : Transition, src : Vertex, trg : Vertex) { | 85 | //pattern transition_M3(t : Transition, src : Vertex, trg : Vertex) { |
86 | Transition.source(t_x, src); | 86 | // Transition.source(t_x, src); |
87 | Transition.target(t, trg); | 87 | // Transition.target(t, trg); |
88 | } | 88 | //} |
89 | pattern transition_M4(t : Transition, src : Vertex, trg : Vertex) { | 89 | //pattern transition_M4(t : Transition, src : Vertex, trg : Vertex) { |
90 | Transition.source(t, src); | 90 | // Transition.source(t, src); |
91 | Transition.target(t_x, trg); | 91 | // Transition.target(t_x, trg); |
92 | } | 92 | //} |
93 | 93 | // | |
94 | //@Constraint(severity="error", message="error", key = {e}) | 94 | ////@Constraint(severity="error", message="error", key = {e}) |
95 | pattern incomingToEntry_M0(t : Transition, e : Entry) { | 95 | //pattern incomingToEntry_M0(t : Transition, e : Entry) { |
96 | find transition_M0(t, _, e); | 96 | // find transition_M0(t, _, e); |
97 | } | 97 | //} |
98 | pattern incomingToEntry_1(t : Transition, e) { | 98 | //pattern incomingToEntry_1(t : Transition, e) { |
99 | find transition_M0(t, _, e); | 99 | // find transition_M0(t, _, e); |
100 | } | 100 | //} |
101 | pattern incomingToEntry_2(t : Transition, e : Entry) { | 101 | //pattern incomingToEntry_2(t : Transition, e : Entry) { |
102 | find transition_M1(t, _, e); | 102 | // find transition_M1(t, _, e); |
103 | } | 103 | //} |
104 | pattern incomingToEntry_3(t : Transition, e : Entry) { | 104 | //pattern incomingToEntry_3(t : Transition, e : Entry) { |
105 | find transition_M2(t, _, e); | 105 | // find transition_M2(t, _, e); |
106 | } | 106 | //} |
107 | pattern incomingToEntry_4(t : Transition, e : Entry) { | 107 | //pattern incomingToEntry_4(t : Transition, e : Entry) { |
108 | find transition_M3(t, _, e); | 108 | // find transition_M3(t, _, e); |
109 | } | 109 | //} |
110 | pattern incomingToEntry_5(t : Transition, e : Entry) { | 110 | //pattern incomingToEntry_5(t : Transition, e : Entry) { |
111 | find transition_M4(t, _, e); | 111 | // find transition_M4(t, _, e); |
112 | } | 112 | //} |
113 | 113 | // | |
114 | pattern noOutgoingTransitionFromEntry_M0(e : Entry) { | 114 | //pattern noOutgoingTransitionFromEntry_M0(e : Entry) { |
115 | neg find transition_M0(_, e, _); | 115 | // neg find transition_M0(_, e, _); |
116 | } | 116 | //} |
117 | 117 | // | |
118 | pattern noOutgoingTransitionFromEntry_M1(e) { | 118 | //pattern noOutgoingTransitionFromEntry_M1(e) { |
119 | Vertex(e); | 119 | // Vertex(e); |
120 | neg find transition_M0(_, e, _); | 120 | // neg find transition_M0(_, e, _); |
121 | } | 121 | //} |
122 | pattern noOutgoingTransitionFromEntry_M2(e : Entry) { | 122 | //pattern noOutgoingTransitionFromEntry_M2(e : Entry) { |
123 | neg find transition_M1(_, e, _); | 123 | // neg find transition_M1(_, e, _); |
124 | } | 124 | //} |
125 | pattern noOutgoingTransitionFromEntry_M3(e : Entry) { | 125 | //pattern noOutgoingTransitionFromEntry_M3(e : Entry) { |
126 | neg find transition_M2(_, e, _); | 126 | // neg find transition_M2(_, e, _); |
127 | } | 127 | //} |
128 | pattern noOutgoingTransitionFromEntry_M4(e : Entry) { | 128 | //pattern noOutgoingTransitionFromEntry_M4(e : Entry) { |
129 | neg find transition_M3(_, e, _); | 129 | // neg find transition_M3(_, e, _); |
130 | } | 130 | //} |
131 | pattern noOutgoingTransitionFromEntry_M5(e : Entry) { | 131 | //pattern noOutgoingTransitionFromEntry_M5(e : Entry) { |
132 | neg find transition_M4(_, e, _); | 132 | // neg find transition_M4(_, e, _); |
133 | } | 133 | //} |
134 | 134 | // | |
135 | 135 | // | |
136 | //@Constraint(severity="error", message="error", key = {e}) | 136 | ////@Constraint(severity="error", message="error", key = {e}) |
137 | pattern multipleTransitionFromEntry_M0(e : Entry, t1 : Transition, t2: Transition) { | 137 | //pattern multipleTransitionFromEntry_M0(e : Entry, t1 : Transition, t2: Transition) { |
138 | Entry.outgoingTransitions(e,t1); | 138 | // Entry.outgoingTransitions(e,t1); |
139 | Entry.outgoingTransitions(e,t2); | 139 | // Entry.outgoingTransitions(e,t2); |
140 | t1!=t2; | 140 | // t1!=t2; |
141 | } | 141 | //} |
142 | pattern multipleTransitionFromEntry_M1(e, t1 : Transition, t2: Transition) { | 142 | //pattern multipleTransitionFromEntry_M1(e, t1 : Transition, t2: Transition) { |
143 | Entry.outgoingTransitions(e,t1); | 143 | // Entry.outgoingTransitions(e,t1); |
144 | Entry.outgoingTransitions(e,t2); | 144 | // Entry.outgoingTransitions(e,t2); |
145 | t1!=t2; | 145 | // t1!=t2; |
146 | } | 146 | //} |
147 | pattern multipleTransitionFromEntry_M2(e : Entry, t1 : Transition, t2: Transition) { | 147 | //pattern multipleTransitionFromEntry_M2(e : Entry, t1 : Transition, t2: Transition) { |
148 | Transition(t1); | 148 | // Transition(t1); |
149 | Entry.outgoingTransitions(e,t2); | 149 | // Entry.outgoingTransitions(e,t2); |
150 | t1!=t2; | 150 | // t1!=t2; |
151 | } | 151 | //} |
152 | pattern multipleTransitionFromEntry_M3(e : Entry, t1 : Transition, t2: Transition) { | 152 | //pattern multipleTransitionFromEntry_M3(e : Entry, t1 : Transition, t2: Transition) { |
153 | Entry.outgoingTransitions(e,t1); | 153 | // Entry.outgoingTransitions(e,t1); |
154 | Transition(t2); | 154 | // Transition(t2); |
155 | t1!=t2; | 155 | // t1!=t2; |
156 | } | 156 | //} |
157 | pattern multipleTransitionFromEntry_M4(e : Entry, t1 : Transition, t2: Transition) { | 157 | //pattern multipleTransitionFromEntry_M4(e : Entry, t1 : Transition, t2: Transition) { |
158 | Entry.outgoingTransitions(e,t1); | 158 | // Entry.outgoingTransitions(e,t1); |
159 | Entry.outgoingTransitions(e,t2); | 159 | // Entry.outgoingTransitions(e,t2); |
160 | } | 160 | //} |
161 | 161 | // | |
162 | ///////// | 162 | /////////// |
163 | // Exit | 163 | //// Exit |
164 | ///////// | 164 | /////////// |
165 | 165 | // | |
166 | //@Constraint(severity="error", message="error", key = {e}) | 166 | ////@Constraint(severity="error", message="error", key = {e}) |
167 | pattern outgoingFromExit_M0(t : Transition, e : Exit) { | 167 | //pattern outgoingFromExit_M0(t : Transition, e : Exit) { |
168 | Exit.outgoingTransitions(e,t); | 168 | // Exit.outgoingTransitions(e,t); |
169 | } | 169 | //} |
170 | pattern outgoingFromExit_M1(t : Transition, e) { | 170 | //pattern outgoingFromExit_M1(t : Transition, e) { |
171 | Vertex.outgoingTransitions(e,t); | 171 | // Vertex.outgoingTransitions(e,t); |
172 | } | 172 | //} |
173 | pattern outgoingFromExit_M2(t : Transition, e : Exit) { | 173 | //pattern outgoingFromExit_M2(t : Transition, e : Exit) { |
174 | Transition(t); | 174 | // Transition(t); |
175 | Exit(e); | 175 | // Exit(e); |
176 | } | 176 | //} |
177 | 177 | // | |
178 | ///////// | 178 | /////////// |
179 | // Final | 179 | //// Final |
180 | ///////// | 180 | /////////// |
181 | 181 | // | |
182 | //@Constraint(severity="error", message="error", key = {f}) | 182 | ////@Constraint(severity="error", message="error", key = {f}) |
183 | pattern outgoingFromFinal_M0(t : Transition, f : FinalState) { | 183 | //pattern outgoingFromFinal_M0(t : Transition, f : FinalState) { |
184 | FinalState.outgoingTransitions(f,t); | 184 | // FinalState.outgoingTransitions(f,t); |
185 | } | 185 | //} |
186 | pattern outgoingFromFinal_M1(t : Transition, f) { | 186 | //pattern outgoingFromFinal_M1(t : Transition, f) { |
187 | Vertex.outgoingTransitions(f,t); | 187 | // Vertex.outgoingTransitions(f,t); |
188 | } | 188 | //} |
189 | pattern outgoingFromFinal_M2(t : Transition, f : FinalState) { | 189 | //pattern outgoingFromFinal_M2(t : Transition, f : FinalState) { |
190 | Transition(t); | 190 | // Transition(t); |
191 | FinalState(f); | 191 | // FinalState(f); |
192 | } | 192 | //} |
193 | 193 | // | |
194 | ///////// | 194 | /////////// |
195 | // State vs Region | 195 | //// State vs Region |
196 | ///////// | 196 | /////////// |
197 | 197 | // | |
198 | //@Constraint(severity="error", message="error", key = {region}) | 198 | ////@Constraint(severity="error", message="error", key = {region}) |
199 | pattern noStateInRegion_M0(region: Region) { | 199 | //pattern noStateInRegion_M0(region: Region) { |
200 | neg find StateInRegion_M0(region,_); | 200 | // neg find StateInRegion_M0(region,_); |
201 | } | 201 | //} |
202 | pattern noStateInRegion_M1(region: Region) { | 202 | //pattern noStateInRegion_M1(region: Region) { |
203 | neg find StateInRegion_M1(region,_); | 203 | // neg find StateInRegion_M1(region,_); |
204 | } | 204 | //} |
205 | pattern noStateInRegion_M2(region: Region) { | 205 | //pattern noStateInRegion_M2(region: Region) { |
206 | neg find StateInRegion_M2(region,_); | 206 | // neg find StateInRegion_M2(region,_); |
207 | } | 207 | //} |
208 | pattern noStateInRegion_M3(region: Region) { | 208 | //pattern noStateInRegion_M3(region: Region) { |
209 | find StateInRegion_M0(region,_); | 209 | // find StateInRegion_M0(region,_); |
210 | } | 210 | //} |
211 | 211 | // | |
212 | pattern StateInRegion_M0(region: Region, state: State) { | 212 | //pattern StateInRegion_M0(region: Region, state: State) { |
213 | Region.vertices(region,state); | 213 | // Region.vertices(region,state); |
214 | } | 214 | //} |
215 | pattern StateInRegion_M1(region: Region, state) { | 215 | //pattern StateInRegion_M1(region: Region, state) { |
216 | Region.vertices(region,state); | 216 | // Region.vertices(region,state); |
217 | } | 217 | //} |
218 | pattern StateInRegion_M2(region: Region, state:State) { | 218 | //pattern StateInRegion_M2(region: Region, state:State) { |
219 | Region(region);State(state); | 219 | // Region(region);State(state); |
220 | } | 220 | //} |
221 | 221 | // | |
222 | ///////// | 222 | /////////// |
223 | // Choice | 223 | //// Choice |
224 | ///////// | 224 | /////////// |
225 | 225 | // | |
226 | @Constraint(severity="error", message="error", key = {c}) | 226 | //@Constraint(severity="error", message="error", key = {c}) |
227 | pattern choiceHasNoOutgoing_M0(c : Choice) { | 227 | //pattern choiceHasNoOutgoing_M0(c : Choice) { |
228 | neg find transition_M0(_, c, _); | 228 | // neg find transition_M0(_, c, _); |
229 | } | 229 | //} |
230 | pattern choiceHasNoOutgoing_M1(c:Vertex) { | 230 | //pattern choiceHasNoOutgoing_M1(c:Vertex) { |
231 | neg find transition_M0(_, c, _); | 231 | // neg find transition_M0(_, c, _); |
232 | } | 232 | //} |
233 | pattern choiceHasNoOutgoing_M2(c : Choice) { | 233 | //pattern choiceHasNoOutgoing_M2(c : Choice) { |
234 | neg find transition_M1(_, c, _); | 234 | // neg find transition_M1(_, c, _); |
235 | } | 235 | //} |
236 | pattern choiceHasNoOutgoing_M3(c : Choice) { | 236 | //pattern choiceHasNoOutgoing_M3(c : Choice) { |
237 | neg find transition_M2(_, c, _); | 237 | // neg find transition_M2(_, c, _); |
238 | } | 238 | //} |
239 | pattern choiceHasNoOutgoing_M4(c : Choice) { | 239 | //pattern choiceHasNoOutgoing_M4(c : Choice) { |
240 | neg find transition_M3(_, c, _); | 240 | // neg find transition_M3(_, c, _); |
241 | } | 241 | //} |
242 | pattern choiceHasNoOutgoing_M5(c : Choice) { | 242 | //pattern choiceHasNoOutgoing_M5(c : Choice) { |
243 | neg find transition_M4(_, c, _); | 243 | // neg find transition_M4(_, c, _); |
244 | } | 244 | //} |
245 | pattern choiceHasNoOutgoing_M6(c : Choice) { | 245 | //pattern choiceHasNoOutgoing_M6(c : Choice) { |
246 | find transition_M0(_, c, _); | 246 | // find transition_M0(_, c, _); |
247 | } | 247 | //} |
248 | 248 | // | |
249 | @Constraint(severity="error", message="error", key = {c}) | 249 | //@Constraint(severity="error", message="error", key = {c}) |
250 | pattern choiceHasNoIncoming_M0(c: Choice) { | 250 | //pattern choiceHasNoIncoming_M0(c: Choice) { |
251 | neg find transition_M0(_, _, c); | 251 | // neg find transition_M0(_, _, c); |
252 | } | 252 | //} |
253 | pattern choiceHasNoIncoming_M1(c:Vertex) { | 253 | //pattern choiceHasNoIncoming_M1(c:Vertex) { |
254 | neg find transition_M0(_, _, c); | 254 | // neg find transition_M0(_, _, c); |
255 | } | 255 | //} |
256 | pattern choiceHasNoIncoming_M2(c: Choice) { | 256 | //pattern choiceHasNoIncoming_M2(c: Choice) { |
257 | neg find transition_M1(_, _, c); | 257 | // neg find transition_M1(_, _, c); |
258 | } | 258 | //} |
259 | pattern choiceHasNoIncoming_M3(c: Choice) { | 259 | //pattern choiceHasNoIncoming_M3(c: Choice) { |
260 | neg find transition_M2(_, _, c); | 260 | // neg find transition_M2(_, _, c); |
261 | } | 261 | //} |
262 | pattern choiceHasNoIncoming_M4(c: Choice) { | 262 | //pattern choiceHasNoIncoming_M4(c: Choice) { |
263 | neg find transition_M3(_, _, c); | 263 | // neg find transition_M3(_, _, c); |
264 | } | 264 | //} |
265 | pattern choiceHasNoIncoming_M5(c: Choice) { | 265 | //pattern choiceHasNoIncoming_M5(c: Choice) { |
266 | neg find transition_M4(_, _, c); | 266 | // neg find transition_M4(_, _, c); |
267 | } | 267 | //} |
268 | pattern choiceHasNoIncoming_M6(c: Choice) { | 268 | //pattern choiceHasNoIncoming_M6(c: Choice) { |
269 | find transition_M0(_, _, c); | 269 | // find transition_M0(_, _, c); |
270 | } | 270 | //} |