mCRL2
Loading...
Searching...
No Matches
builder.h
Go to the documentation of this file.
1// Author(s): Wieger Wesselink
2// Copyright: see the accompanying file COPYING or copy at
3// https://github.com/mCRL2org/mCRL2/blob/master/COPYING
4//
5// Distributed under the Boost Software License, Version 1.0.
6// (See accompanying file LICENSE_1_0.txt or copy at
7// http://www.boost.org/LICENSE_1_0.txt)
8//
9/// \file mcrl2/process/builder.h
10/// \brief add your file description here.
11
12#ifndef MCRL2_PROCESS_BUILDER_H
13#define MCRL2_PROCESS_BUILDER_H
14
15#include "mcrl2/data/builder.h"
16#include "mcrl2/process/process_specification.h"
17#include "mcrl2/process/untyped_multi_action.h"
18
19namespace mcrl2::process
20{
21
22/// \brief Base builder class for processes.
23template <typename Derived>
24struct process_builder_base: public core::builder<Derived>
25{
26 using super = core::builder<Derived>;
27 using super::apply;
28
29 template <class T>
30 void apply(T& result, const data::untyped_data_parameter& x)
31 {
32 static_cast<Derived&>(*this).enter(x);
33 // skip
34 static_cast<Derived&>(*this).leave(x);
35 result = atermpp::down_cast<T>(x);
36 }
37};
38
39
40// Adds sort expression traversal to a builder
41//--- start generated add_sort_expressions code ---//
42template <template <class> class Builder, class Derived>
43struct add_sort_expressions: public Builder<Derived>
44{
45 using super = Builder<Derived>;
46 using super::enter;
47 using super::leave;
48 using super::update;
49 using super::apply;
50
51 template <class T>
52 void apply(T& result, const process::action_label& x)
53 {
54 static_cast<Derived&>(*this).enter(x);
55 process::make_action_label(result, x.name(), [&](data::sort_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.sorts()); });
56 static_cast<Derived&>(*this).leave(x);
57 }
58
60 {
61 static_cast<Derived&>(*this).enter(x);
62 process::action_label_list result_action_labels;
63 static_cast<Derived&>(*this).apply(result_action_labels, x.action_labels());
64 x.action_labels() = result_action_labels;
65 static_cast<Derived&>(*this).update(x.global_variables());
66 static_cast<Derived&>(*this).update(x.equations());
67 process_expression result_init;
68 static_cast<Derived&>(*this).apply(result_init, x.init());
69 x.init() = result_init;
70 static_cast<Derived&>(*this).leave(x);
71 }
72
73 template <class T>
74 void apply(T& result, const process::process_identifier& x)
75 {
76 static_cast<Derived&>(*this).enter(x);
77 process::make_process_identifier(result, x.name(), [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.variables()); });
78 static_cast<Derived&>(*this).leave(x);
79 }
80
81 template <class T>
82 void apply(T& result, const process::process_equation& x)
83 {
84 static_cast<Derived&>(*this).enter(x);
85 process::make_process_equation(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.formal_parameters()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.expression()); });
86 static_cast<Derived&>(*this).leave(x);
87 }
88
89 template <class T>
90 void apply(T& result, const process::untyped_multi_action& x)
91 {
92 static_cast<Derived&>(*this).enter(x);
93 process::make_untyped_multi_action(result, [&](data::untyped_data_parameter_list& result){ static_cast<Derived&>(*this).apply(result, x.actions()); });
94 static_cast<Derived&>(*this).leave(x);
95 }
96
97 template <class T>
98 void apply(T& result, const process::action& x)
99 {
100 static_cast<Derived&>(*this).enter(x);
101 process::make_action(result, [&](action_label& result){ static_cast<Derived&>(*this).apply(result, x.label()); }, [&](data::data_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.arguments()); });
102 static_cast<Derived&>(*this).leave(x);
103 }
104
105 template <class T>
106 void apply(T& result, const process::process_instance& x)
107 {
108 static_cast<Derived&>(*this).enter(x);
109 process::make_process_instance(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, [&](data::data_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.actual_parameters()); });
110 static_cast<Derived&>(*this).leave(x);
111 }
112
113 template <class T>
114 void apply(T& result, const process::process_instance_assignment& x)
115 {
116 static_cast<Derived&>(*this).enter(x);
117 process::make_process_instance_assignment(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, [&](data::assignment_list& result){ static_cast<Derived&>(*this).apply(result, x.assignments()); });
118 static_cast<Derived&>(*this).leave(x);
119 }
120
121 template <class T>
122 void apply(T& result, const process::delta& x)
123 {
124 static_cast<Derived&>(*this).enter(x);
125 // skip
126 static_cast<Derived&>(*this).leave(x);
127 result = atermpp::down_cast<T>(x);
128 }
129
130 template <class T>
131 void apply(T& result, const process::tau& x)
132 {
133 static_cast<Derived&>(*this).enter(x);
134 // skip
135 static_cast<Derived&>(*this).leave(x);
136 result = atermpp::down_cast<T>(x);
137 }
138
139 template <class T>
140 void apply(T& result, const process::sum& x)
141 {
142 static_cast<Derived&>(*this).enter(x);
143 process::make_sum(result, [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.variables()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
144 static_cast<Derived&>(*this).leave(x);
145 }
146
147 template <class T>
148 void apply(T& result, const process::block& x)
149 {
150 static_cast<Derived&>(*this).enter(x);
151 process::make_block(result, x.block_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
152 static_cast<Derived&>(*this).leave(x);
153 }
154
155 template <class T>
156 void apply(T& result, const process::hide& x)
157 {
158 static_cast<Derived&>(*this).enter(x);
159 process::make_hide(result, x.hide_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
160 static_cast<Derived&>(*this).leave(x);
161 }
162
163 template <class T>
164 void apply(T& result, const process::rename& x)
165 {
166 static_cast<Derived&>(*this).enter(x);
167 process::make_rename(result, x.rename_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
168 static_cast<Derived&>(*this).leave(x);
169 }
170
171 template <class T>
172 void apply(T& result, const process::comm& x)
173 {
174 static_cast<Derived&>(*this).enter(x);
175 process::make_comm(result, x.comm_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
176 static_cast<Derived&>(*this).leave(x);
177 }
178
179 template <class T>
180 void apply(T& result, const process::allow& x)
181 {
182 static_cast<Derived&>(*this).enter(x);
183 process::make_allow(result, x.allow_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
184 static_cast<Derived&>(*this).leave(x);
185 }
186
187 template <class T>
188 void apply(T& result, const process::sync& x)
189 {
190 static_cast<Derived&>(*this).enter(x);
191 process::make_sync(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
192 static_cast<Derived&>(*this).leave(x);
193 }
194
195 template <class T>
196 void apply(T& result, const process::at& x)
197 {
198 static_cast<Derived&>(*this).enter(x);
199 process::make_at(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); }, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.time_stamp()); });
200 static_cast<Derived&>(*this).leave(x);
201 }
202
203 template <class T>
204 void apply(T& result, const process::seq& x)
205 {
206 static_cast<Derived&>(*this).enter(x);
207 process::make_seq(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
208 static_cast<Derived&>(*this).leave(x);
209 }
210
211 template <class T>
212 void apply(T& result, const process::if_then& x)
213 {
214 static_cast<Derived&>(*this).enter(x);
215 process::make_if_then(result, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.condition()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); });
216 static_cast<Derived&>(*this).leave(x);
217 }
218
219 template <class T>
220 void apply(T& result, const process::if_then_else& x)
221 {
222 static_cast<Derived&>(*this).enter(x);
223 process::make_if_then_else(result, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.condition()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.else_case()); });
224 static_cast<Derived&>(*this).leave(x);
225 }
226
227 template <class T>
228 void apply(T& result, const process::bounded_init& x)
229 {
230 static_cast<Derived&>(*this).enter(x);
231 process::make_bounded_init(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
232 static_cast<Derived&>(*this).leave(x);
233 }
234
235 template <class T>
236 void apply(T& result, const process::merge& x)
237 {
238 static_cast<Derived&>(*this).enter(x);
239 process::make_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
240 static_cast<Derived&>(*this).leave(x);
241 }
242
243 template <class T>
244 void apply(T& result, const process::left_merge& x)
245 {
246 static_cast<Derived&>(*this).enter(x);
247 process::make_left_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
248 static_cast<Derived&>(*this).leave(x);
249 }
250
251 template <class T>
252 void apply(T& result, const process::choice& x)
253 {
254 static_cast<Derived&>(*this).enter(x);
255 process::make_choice(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
256 static_cast<Derived&>(*this).leave(x);
257 }
258
259 template <class T>
260 void apply(T& result, const process::stochastic_operator& x)
261 {
262 static_cast<Derived&>(*this).enter(x);
263 process::make_stochastic_operator(result, [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.variables()); }, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.distribution()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
264 static_cast<Derived&>(*this).leave(x);
265 }
266
267 template <class T>
268 void apply(T& result, const process::untyped_process_assignment& x)
269 {
270 static_cast<Derived&>(*this).enter(x);
271 process::make_untyped_process_assignment(result, x.name(), [&](data::untyped_identifier_assignment_list& result){ static_cast<Derived&>(*this).apply(result, x.assignments()); });
272 static_cast<Derived&>(*this).leave(x);
273 }
274
275 template <class T>
276 void apply(T& result, const process::process_expression& x)
277 {
278 static_cast<Derived&>(*this).enter(x);
280 {
281 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<data::untyped_data_parameter>(x));
282 }
283 else if (process::is_action(x))
284 {
285 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::action>(x));
286 }
288 {
289 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance>(x));
290 }
292 {
293 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance_assignment>(x));
294 }
295 else if (process::is_delta(x))
296 {
297 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::delta>(x));
298 }
299 else if (process::is_tau(x))
300 {
301 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::tau>(x));
302 }
303 else if (process::is_sum(x))
304 {
305 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sum>(x));
306 }
307 else if (process::is_block(x))
308 {
309 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::block>(x));
310 }
311 else if (process::is_hide(x))
312 {
313 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::hide>(x));
314 }
315 else if (process::is_rename(x))
316 {
317 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::rename>(x));
318 }
319 else if (process::is_comm(x))
320 {
321 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::comm>(x));
322 }
323 else if (process::is_allow(x))
324 {
325 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::allow>(x));
326 }
327 else if (process::is_sync(x))
328 {
329 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sync>(x));
330 }
331 else if (process::is_at(x))
332 {
333 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::at>(x));
334 }
335 else if (process::is_seq(x))
336 {
337 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::seq>(x));
338 }
339 else if (process::is_if_then(x))
340 {
341 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then>(x));
342 }
344 {
345 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then_else>(x));
346 }
348 {
349 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::bounded_init>(x));
350 }
351 else if (process::is_merge(x))
352 {
353 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::merge>(x));
354 }
355 else if (process::is_left_merge(x))
356 {
357 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::left_merge>(x));
358 }
359 else if (process::is_choice(x))
360 {
361 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::choice>(x));
362 }
364 {
365 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::stochastic_operator>(x));
366 }
368 {
369 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::untyped_process_assignment>(x));
370 }
371 static_cast<Derived&>(*this).leave(x);
372 }
373
374};
375
376/// \\brief Builder class
377template <typename Derived>
379{
380};
381//--- end generated add_sort_expressions code ---//
382
383// Adds data expression traversal to a builder
384//--- start generated add_data_expressions code ---//
385template <template <class> class Builder, class Derived>
386struct add_data_expressions: public Builder<Derived>
387{
388 using super = Builder<Derived>;
389 using super::enter;
390 using super::leave;
391 using super::update;
392 using super::apply;
393
395 {
396 static_cast<Derived&>(*this).enter(x);
397 static_cast<Derived&>(*this).update(x.equations());
398 process_expression result_init;
399 static_cast<Derived&>(*this).apply(result_init, x.init());
400 x.init() = result_init;
401 static_cast<Derived&>(*this).leave(x);
402 }
403
404 template <class T>
405 void apply(T& result, const process::process_equation& x)
406 {
407 static_cast<Derived&>(*this).enter(x);
408 process::make_process_equation(result, x.identifier(), x.formal_parameters(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.expression()); });
409 static_cast<Derived&>(*this).leave(x);
410 }
411
412 template <class T>
413 void apply(T& result, const process::untyped_multi_action& x)
414 {
415 static_cast<Derived&>(*this).enter(x);
416 process::make_untyped_multi_action(result, [&](data::untyped_data_parameter_list& result){ static_cast<Derived&>(*this).apply(result, x.actions()); });
417 static_cast<Derived&>(*this).leave(x);
418 }
419
420 template <class T>
421 void apply(T& result, const process::action& x)
422 {
423 static_cast<Derived&>(*this).enter(x);
424 process::make_action(result, x.label(), [&](data::data_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.arguments()); });
425 static_cast<Derived&>(*this).leave(x);
426 }
427
428 template <class T>
429 void apply(T& result, const process::process_instance& x)
430 {
431 static_cast<Derived&>(*this).enter(x);
432 process::make_process_instance(result, x.identifier(), [&](data::data_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.actual_parameters()); });
433 static_cast<Derived&>(*this).leave(x);
434 }
435
436 template <class T>
437 void apply(T& result, const process::process_instance_assignment& x)
438 {
439 static_cast<Derived&>(*this).enter(x);
440 process::make_process_instance_assignment(result, x.identifier(), [&](data::assignment_list& result){ static_cast<Derived&>(*this).apply(result, x.assignments()); });
441 static_cast<Derived&>(*this).leave(x);
442 }
443
444 template <class T>
445 void apply(T& result, const process::delta& x)
446 {
447 static_cast<Derived&>(*this).enter(x);
448 // skip
449 static_cast<Derived&>(*this).leave(x);
450 result = atermpp::down_cast<T>(x);
451 }
452
453 template <class T>
454 void apply(T& result, const process::tau& x)
455 {
456 static_cast<Derived&>(*this).enter(x);
457 // skip
458 static_cast<Derived&>(*this).leave(x);
459 result = atermpp::down_cast<T>(x);
460 }
461
462 template <class T>
463 void apply(T& result, const process::sum& x)
464 {
465 static_cast<Derived&>(*this).enter(x);
466 process::make_sum(result, x.variables(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
467 static_cast<Derived&>(*this).leave(x);
468 }
469
470 template <class T>
471 void apply(T& result, const process::block& x)
472 {
473 static_cast<Derived&>(*this).enter(x);
474 process::make_block(result, x.block_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
475 static_cast<Derived&>(*this).leave(x);
476 }
477
478 template <class T>
479 void apply(T& result, const process::hide& x)
480 {
481 static_cast<Derived&>(*this).enter(x);
482 process::make_hide(result, x.hide_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
483 static_cast<Derived&>(*this).leave(x);
484 }
485
486 template <class T>
487 void apply(T& result, const process::rename& x)
488 {
489 static_cast<Derived&>(*this).enter(x);
490 process::make_rename(result, x.rename_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
491 static_cast<Derived&>(*this).leave(x);
492 }
493
494 template <class T>
495 void apply(T& result, const process::comm& x)
496 {
497 static_cast<Derived&>(*this).enter(x);
498 process::make_comm(result, x.comm_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
499 static_cast<Derived&>(*this).leave(x);
500 }
501
502 template <class T>
503 void apply(T& result, const process::allow& x)
504 {
505 static_cast<Derived&>(*this).enter(x);
506 process::make_allow(result, x.allow_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
507 static_cast<Derived&>(*this).leave(x);
508 }
509
510 template <class T>
511 void apply(T& result, const process::sync& x)
512 {
513 static_cast<Derived&>(*this).enter(x);
514 process::make_sync(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
515 static_cast<Derived&>(*this).leave(x);
516 }
517
518 template <class T>
519 void apply(T& result, const process::at& x)
520 {
521 static_cast<Derived&>(*this).enter(x);
522 process::make_at(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); }, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.time_stamp()); });
523 static_cast<Derived&>(*this).leave(x);
524 }
525
526 template <class T>
527 void apply(T& result, const process::seq& x)
528 {
529 static_cast<Derived&>(*this).enter(x);
530 process::make_seq(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
531 static_cast<Derived&>(*this).leave(x);
532 }
533
534 template <class T>
535 void apply(T& result, const process::if_then& x)
536 {
537 static_cast<Derived&>(*this).enter(x);
538 process::make_if_then(result, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.condition()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); });
539 static_cast<Derived&>(*this).leave(x);
540 }
541
542 template <class T>
543 void apply(T& result, const process::if_then_else& x)
544 {
545 static_cast<Derived&>(*this).enter(x);
546 process::make_if_then_else(result, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.condition()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.else_case()); });
547 static_cast<Derived&>(*this).leave(x);
548 }
549
550 template <class T>
551 void apply(T& result, const process::bounded_init& x)
552 {
553 static_cast<Derived&>(*this).enter(x);
554 process::make_bounded_init(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
555 static_cast<Derived&>(*this).leave(x);
556 }
557
558 template <class T>
559 void apply(T& result, const process::merge& x)
560 {
561 static_cast<Derived&>(*this).enter(x);
562 process::make_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
563 static_cast<Derived&>(*this).leave(x);
564 }
565
566 template <class T>
567 void apply(T& result, const process::left_merge& x)
568 {
569 static_cast<Derived&>(*this).enter(x);
570 process::make_left_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
571 static_cast<Derived&>(*this).leave(x);
572 }
573
574 template <class T>
575 void apply(T& result, const process::choice& x)
576 {
577 static_cast<Derived&>(*this).enter(x);
578 process::make_choice(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
579 static_cast<Derived&>(*this).leave(x);
580 }
581
582 template <class T>
583 void apply(T& result, const process::stochastic_operator& x)
584 {
585 static_cast<Derived&>(*this).enter(x);
586 process::make_stochastic_operator(result, x.variables(), [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.distribution()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
587 static_cast<Derived&>(*this).leave(x);
588 }
589
590 template <class T>
591 void apply(T& result, const process::untyped_process_assignment& x)
592 {
593 static_cast<Derived&>(*this).enter(x);
594 process::make_untyped_process_assignment(result, x.name(), [&](data::untyped_identifier_assignment_list& result){ static_cast<Derived&>(*this).apply(result, x.assignments()); });
595 static_cast<Derived&>(*this).leave(x);
596 }
597
598 template <class T>
599 void apply(T& result, const process::process_expression& x)
600 {
601 static_cast<Derived&>(*this).enter(x);
603 {
604 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<data::untyped_data_parameter>(x));
605 }
606 else if (process::is_action(x))
607 {
608 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::action>(x));
609 }
611 {
612 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance>(x));
613 }
615 {
616 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance_assignment>(x));
617 }
618 else if (process::is_delta(x))
619 {
620 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::delta>(x));
621 }
622 else if (process::is_tau(x))
623 {
624 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::tau>(x));
625 }
626 else if (process::is_sum(x))
627 {
628 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sum>(x));
629 }
630 else if (process::is_block(x))
631 {
632 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::block>(x));
633 }
634 else if (process::is_hide(x))
635 {
636 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::hide>(x));
637 }
638 else if (process::is_rename(x))
639 {
640 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::rename>(x));
641 }
642 else if (process::is_comm(x))
643 {
644 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::comm>(x));
645 }
646 else if (process::is_allow(x))
647 {
648 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::allow>(x));
649 }
650 else if (process::is_sync(x))
651 {
652 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sync>(x));
653 }
654 else if (process::is_at(x))
655 {
656 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::at>(x));
657 }
658 else if (process::is_seq(x))
659 {
660 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::seq>(x));
661 }
662 else if (process::is_if_then(x))
663 {
664 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then>(x));
665 }
667 {
668 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then_else>(x));
669 }
671 {
672 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::bounded_init>(x));
673 }
674 else if (process::is_merge(x))
675 {
676 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::merge>(x));
677 }
678 else if (process::is_left_merge(x))
679 {
680 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::left_merge>(x));
681 }
682 else if (process::is_choice(x))
683 {
684 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::choice>(x));
685 }
687 {
688 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::stochastic_operator>(x));
689 }
691 {
692 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::untyped_process_assignment>(x));
693 }
694 static_cast<Derived&>(*this).leave(x);
695 }
696
697};
698
699/// \\brief Builder class
700template <typename Derived>
702{
703};
704//--- end generated add_data_expressions code ---//
705
706//--- start generated add_variables code ---//
707template <template <class> class Builder, class Derived>
708struct add_variables: public Builder<Derived>
709{
710 using super = Builder<Derived>;
711 using super::enter;
712 using super::leave;
713 using super::update;
714 using super::apply;
715
717 {
718 static_cast<Derived&>(*this).enter(x);
719 static_cast<Derived&>(*this).update(x.global_variables());
720 static_cast<Derived&>(*this).update(x.equations());
721 process_expression result_init;
722 static_cast<Derived&>(*this).apply(result_init, x.init());
723 x.init() = result_init;
724 static_cast<Derived&>(*this).leave(x);
725 }
726
727 template <class T>
728 void apply(T& result, const process::process_identifier& x)
729 {
730 static_cast<Derived&>(*this).enter(x);
731 process::make_process_identifier(result, x.name(), [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.variables()); });
732 static_cast<Derived&>(*this).leave(x);
733 }
734
735 template <class T>
736 void apply(T& result, const process::process_equation& x)
737 {
738 static_cast<Derived&>(*this).enter(x);
739 process::make_process_equation(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.formal_parameters()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.expression()); });
740 static_cast<Derived&>(*this).leave(x);
741 }
742
743 template <class T>
744 void apply(T& result, const process::untyped_multi_action& x)
745 {
746 static_cast<Derived&>(*this).enter(x);
747 process::make_untyped_multi_action(result, [&](data::untyped_data_parameter_list& result){ static_cast<Derived&>(*this).apply(result, x.actions()); });
748 static_cast<Derived&>(*this).leave(x);
749 }
750
751 template <class T>
752 void apply(T& result, const process::action& x)
753 {
754 static_cast<Derived&>(*this).enter(x);
755 process::make_action(result, x.label(), [&](data::data_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.arguments()); });
756 static_cast<Derived&>(*this).leave(x);
757 }
758
759 template <class T>
760 void apply(T& result, const process::process_instance& x)
761 {
762 static_cast<Derived&>(*this).enter(x);
763 process::make_process_instance(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, [&](data::data_expression_list& result){ static_cast<Derived&>(*this).apply(result, x.actual_parameters()); });
764 static_cast<Derived&>(*this).leave(x);
765 }
766
767 template <class T>
768 void apply(T& result, const process::process_instance_assignment& x)
769 {
770 static_cast<Derived&>(*this).enter(x);
771 process::make_process_instance_assignment(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, [&](data::assignment_list& result){ static_cast<Derived&>(*this).apply(result, x.assignments()); });
772 static_cast<Derived&>(*this).leave(x);
773 }
774
775 template <class T>
776 void apply(T& result, const process::delta& x)
777 {
778 static_cast<Derived&>(*this).enter(x);
779 // skip
780 static_cast<Derived&>(*this).leave(x);
781 result = atermpp::down_cast<T>(x);
782 }
783
784 template <class T>
785 void apply(T& result, const process::tau& x)
786 {
787 static_cast<Derived&>(*this).enter(x);
788 // skip
789 static_cast<Derived&>(*this).leave(x);
790 result = atermpp::down_cast<T>(x);
791 }
792
793 template <class T>
794 void apply(T& result, const process::sum& x)
795 {
796 static_cast<Derived&>(*this).enter(x);
797 process::make_sum(result, [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.variables()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
798 static_cast<Derived&>(*this).leave(x);
799 }
800
801 template <class T>
802 void apply(T& result, const process::block& x)
803 {
804 static_cast<Derived&>(*this).enter(x);
805 process::make_block(result, x.block_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
806 static_cast<Derived&>(*this).leave(x);
807 }
808
809 template <class T>
810 void apply(T& result, const process::hide& x)
811 {
812 static_cast<Derived&>(*this).enter(x);
813 process::make_hide(result, x.hide_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
814 static_cast<Derived&>(*this).leave(x);
815 }
816
817 template <class T>
818 void apply(T& result, const process::rename& x)
819 {
820 static_cast<Derived&>(*this).enter(x);
821 process::make_rename(result, x.rename_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
822 static_cast<Derived&>(*this).leave(x);
823 }
824
825 template <class T>
826 void apply(T& result, const process::comm& x)
827 {
828 static_cast<Derived&>(*this).enter(x);
829 process::make_comm(result, x.comm_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
830 static_cast<Derived&>(*this).leave(x);
831 }
832
833 template <class T>
834 void apply(T& result, const process::allow& x)
835 {
836 static_cast<Derived&>(*this).enter(x);
837 process::make_allow(result, x.allow_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
838 static_cast<Derived&>(*this).leave(x);
839 }
840
841 template <class T>
842 void apply(T& result, const process::sync& x)
843 {
844 static_cast<Derived&>(*this).enter(x);
845 process::make_sync(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
846 static_cast<Derived&>(*this).leave(x);
847 }
848
849 template <class T>
850 void apply(T& result, const process::at& x)
851 {
852 static_cast<Derived&>(*this).enter(x);
853 process::make_at(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); }, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.time_stamp()); });
854 static_cast<Derived&>(*this).leave(x);
855 }
856
857 template <class T>
858 void apply(T& result, const process::seq& x)
859 {
860 static_cast<Derived&>(*this).enter(x);
861 process::make_seq(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
862 static_cast<Derived&>(*this).leave(x);
863 }
864
865 template <class T>
866 void apply(T& result, const process::if_then& x)
867 {
868 static_cast<Derived&>(*this).enter(x);
869 process::make_if_then(result, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.condition()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); });
870 static_cast<Derived&>(*this).leave(x);
871 }
872
873 template <class T>
874 void apply(T& result, const process::if_then_else& x)
875 {
876 static_cast<Derived&>(*this).enter(x);
877 process::make_if_then_else(result, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.condition()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.else_case()); });
878 static_cast<Derived&>(*this).leave(x);
879 }
880
881 template <class T>
882 void apply(T& result, const process::bounded_init& x)
883 {
884 static_cast<Derived&>(*this).enter(x);
885 process::make_bounded_init(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
886 static_cast<Derived&>(*this).leave(x);
887 }
888
889 template <class T>
890 void apply(T& result, const process::merge& x)
891 {
892 static_cast<Derived&>(*this).enter(x);
893 process::make_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
894 static_cast<Derived&>(*this).leave(x);
895 }
896
897 template <class T>
898 void apply(T& result, const process::left_merge& x)
899 {
900 static_cast<Derived&>(*this).enter(x);
901 process::make_left_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
902 static_cast<Derived&>(*this).leave(x);
903 }
904
905 template <class T>
906 void apply(T& result, const process::choice& x)
907 {
908 static_cast<Derived&>(*this).enter(x);
909 process::make_choice(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
910 static_cast<Derived&>(*this).leave(x);
911 }
912
913 template <class T>
914 void apply(T& result, const process::stochastic_operator& x)
915 {
916 static_cast<Derived&>(*this).enter(x);
917 process::make_stochastic_operator(result, [&](data::variable_list& result){ static_cast<Derived&>(*this).apply(result, x.variables()); }, [&](data::data_expression& result){ static_cast<Derived&>(*this).apply(result, x.distribution()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
918 static_cast<Derived&>(*this).leave(x);
919 }
920
921 template <class T>
922 void apply(T& result, const process::untyped_process_assignment& x)
923 {
924 static_cast<Derived&>(*this).enter(x);
925 process::make_untyped_process_assignment(result, x.name(), [&](data::untyped_identifier_assignment_list& result){ static_cast<Derived&>(*this).apply(result, x.assignments()); });
926 static_cast<Derived&>(*this).leave(x);
927 }
928
929 template <class T>
930 void apply(T& result, const process::process_expression& x)
931 {
932 static_cast<Derived&>(*this).enter(x);
934 {
935 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<data::untyped_data_parameter>(x));
936 }
937 else if (process::is_action(x))
938 {
939 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::action>(x));
940 }
942 {
943 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance>(x));
944 }
946 {
947 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance_assignment>(x));
948 }
949 else if (process::is_delta(x))
950 {
951 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::delta>(x));
952 }
953 else if (process::is_tau(x))
954 {
955 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::tau>(x));
956 }
957 else if (process::is_sum(x))
958 {
959 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sum>(x));
960 }
961 else if (process::is_block(x))
962 {
963 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::block>(x));
964 }
965 else if (process::is_hide(x))
966 {
967 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::hide>(x));
968 }
969 else if (process::is_rename(x))
970 {
971 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::rename>(x));
972 }
973 else if (process::is_comm(x))
974 {
975 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::comm>(x));
976 }
977 else if (process::is_allow(x))
978 {
979 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::allow>(x));
980 }
981 else if (process::is_sync(x))
982 {
983 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sync>(x));
984 }
985 else if (process::is_at(x))
986 {
987 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::at>(x));
988 }
989 else if (process::is_seq(x))
990 {
991 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::seq>(x));
992 }
993 else if (process::is_if_then(x))
994 {
995 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then>(x));
996 }
998 {
999 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then_else>(x));
1000 }
1002 {
1003 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::bounded_init>(x));
1004 }
1005 else if (process::is_merge(x))
1006 {
1007 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::merge>(x));
1008 }
1009 else if (process::is_left_merge(x))
1010 {
1011 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::left_merge>(x));
1012 }
1013 else if (process::is_choice(x))
1014 {
1015 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::choice>(x));
1016 }
1018 {
1019 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::stochastic_operator>(x));
1020 }
1022 {
1023 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::untyped_process_assignment>(x));
1024 }
1025 static_cast<Derived&>(*this).leave(x);
1026 }
1027
1028};
1029
1030/// \\brief Builder class
1031template <typename Derived>
1033{
1034};
1035//--- end generated add_variables code ---//
1036
1037// Adds process expression traversal to a builder
1038//--- start generated add_process_expressions code ---//
1039template <template <class> class Builder, class Derived>
1040struct add_process_expressions: public Builder<Derived>
1041{
1042 using super = Builder<Derived>;
1043 using super::enter;
1044 using super::leave;
1045 using super::update;
1046 using super::apply;
1047
1049 {
1050 static_cast<Derived&>(*this).enter(x);
1051 static_cast<Derived&>(*this).update(x.equations());
1052 process_expression result_init;
1053 static_cast<Derived&>(*this).apply(result_init, x.init());
1054 x.init() = result_init;
1055 static_cast<Derived&>(*this).leave(x);
1056 }
1057
1058 template <class T>
1059 void apply(T& result, const process::process_equation& x)
1060 {
1061 static_cast<Derived&>(*this).enter(x);
1062 process::make_process_equation(result, x.identifier(), x.formal_parameters(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.expression()); });
1063 static_cast<Derived&>(*this).leave(x);
1064 }
1065
1066 template <class T>
1067 void apply(T& result, const process::action& x)
1068 {
1069 static_cast<Derived&>(*this).enter(x);
1070 // skip
1071 static_cast<Derived&>(*this).leave(x);
1072 result = atermpp::down_cast<T>(x);
1073 }
1074
1075 template <class T>
1076 void apply(T& result, const process::process_instance& x)
1077 {
1078 static_cast<Derived&>(*this).enter(x);
1079 // skip
1080 static_cast<Derived&>(*this).leave(x);
1081 result = atermpp::down_cast<T>(x);
1082 }
1083
1084 template <class T>
1085 void apply(T& result, const process::process_instance_assignment& x)
1086 {
1087 static_cast<Derived&>(*this).enter(x);
1088 // skip
1089 static_cast<Derived&>(*this).leave(x);
1090 result = atermpp::down_cast<T>(x);
1091 }
1092
1093 template <class T>
1094 void apply(T& result, const process::delta& x)
1095 {
1096 static_cast<Derived&>(*this).enter(x);
1097 // skip
1098 static_cast<Derived&>(*this).leave(x);
1099 result = atermpp::down_cast<T>(x);
1100 }
1101
1102 template <class T>
1103 void apply(T& result, const process::tau& x)
1104 {
1105 static_cast<Derived&>(*this).enter(x);
1106 // skip
1107 static_cast<Derived&>(*this).leave(x);
1108 result = atermpp::down_cast<T>(x);
1109 }
1110
1111 template <class T>
1112 void apply(T& result, const process::sum& x)
1113 {
1114 static_cast<Derived&>(*this).enter(x);
1115 process::make_sum(result, x.variables(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1116 static_cast<Derived&>(*this).leave(x);
1117 }
1118
1119 template <class T>
1120 void apply(T& result, const process::block& x)
1121 {
1122 static_cast<Derived&>(*this).enter(x);
1123 process::make_block(result, x.block_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1124 static_cast<Derived&>(*this).leave(x);
1125 }
1126
1127 template <class T>
1128 void apply(T& result, const process::hide& x)
1129 {
1130 static_cast<Derived&>(*this).enter(x);
1131 process::make_hide(result, x.hide_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1132 static_cast<Derived&>(*this).leave(x);
1133 }
1134
1135 template <class T>
1136 void apply(T& result, const process::rename& x)
1137 {
1138 static_cast<Derived&>(*this).enter(x);
1139 process::make_rename(result, x.rename_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1140 static_cast<Derived&>(*this).leave(x);
1141 }
1142
1143 template <class T>
1144 void apply(T& result, const process::comm& x)
1145 {
1146 static_cast<Derived&>(*this).enter(x);
1147 process::make_comm(result, x.comm_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1148 static_cast<Derived&>(*this).leave(x);
1149 }
1150
1151 template <class T>
1152 void apply(T& result, const process::allow& x)
1153 {
1154 static_cast<Derived&>(*this).enter(x);
1155 process::make_allow(result, x.allow_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1156 static_cast<Derived&>(*this).leave(x);
1157 }
1158
1159 template <class T>
1160 void apply(T& result, const process::sync& x)
1161 {
1162 static_cast<Derived&>(*this).enter(x);
1163 process::make_sync(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1164 static_cast<Derived&>(*this).leave(x);
1165 }
1166
1167 template <class T>
1168 void apply(T& result, const process::at& x)
1169 {
1170 static_cast<Derived&>(*this).enter(x);
1171 process::make_at(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); }, x.time_stamp());
1172 static_cast<Derived&>(*this).leave(x);
1173 }
1174
1175 template <class T>
1176 void apply(T& result, const process::seq& x)
1177 {
1178 static_cast<Derived&>(*this).enter(x);
1179 process::make_seq(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1180 static_cast<Derived&>(*this).leave(x);
1181 }
1182
1183 template <class T>
1184 void apply(T& result, const process::if_then& x)
1185 {
1186 static_cast<Derived&>(*this).enter(x);
1187 process::make_if_then(result, x.condition(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); });
1188 static_cast<Derived&>(*this).leave(x);
1189 }
1190
1191 template <class T>
1192 void apply(T& result, const process::if_then_else& x)
1193 {
1194 static_cast<Derived&>(*this).enter(x);
1195 process::make_if_then_else(result, x.condition(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.else_case()); });
1196 static_cast<Derived&>(*this).leave(x);
1197 }
1198
1199 template <class T>
1200 void apply(T& result, const process::bounded_init& x)
1201 {
1202 static_cast<Derived&>(*this).enter(x);
1203 process::make_bounded_init(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1204 static_cast<Derived&>(*this).leave(x);
1205 }
1206
1207 template <class T>
1208 void apply(T& result, const process::merge& x)
1209 {
1210 static_cast<Derived&>(*this).enter(x);
1211 process::make_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1212 static_cast<Derived&>(*this).leave(x);
1213 }
1214
1215 template <class T>
1216 void apply(T& result, const process::left_merge& x)
1217 {
1218 static_cast<Derived&>(*this).enter(x);
1219 process::make_left_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1220 static_cast<Derived&>(*this).leave(x);
1221 }
1222
1223 template <class T>
1224 void apply(T& result, const process::choice& x)
1225 {
1226 static_cast<Derived&>(*this).enter(x);
1227 process::make_choice(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1228 static_cast<Derived&>(*this).leave(x);
1229 }
1230
1231 template <class T>
1232 void apply(T& result, const process::stochastic_operator& x)
1233 {
1234 static_cast<Derived&>(*this).enter(x);
1235 process::make_stochastic_operator(result, x.variables(), x.distribution(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1236 static_cast<Derived&>(*this).leave(x);
1237 }
1238
1239 template <class T>
1240 void apply(T& result, const process::untyped_process_assignment& x)
1241 {
1242 static_cast<Derived&>(*this).enter(x);
1243 // skip
1244 static_cast<Derived&>(*this).leave(x);
1245 result = atermpp::down_cast<T>(x);
1246 }
1247
1248 template <class T>
1249 void apply(T& result, const process::process_expression& x)
1250 {
1251 static_cast<Derived&>(*this).enter(x);
1253 {
1254 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<data::untyped_data_parameter>(x));
1255 }
1256 else if (process::is_action(x))
1257 {
1258 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::action>(x));
1259 }
1261 {
1262 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance>(x));
1263 }
1265 {
1266 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance_assignment>(x));
1267 }
1268 else if (process::is_delta(x))
1269 {
1270 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::delta>(x));
1271 }
1272 else if (process::is_tau(x))
1273 {
1274 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::tau>(x));
1275 }
1276 else if (process::is_sum(x))
1277 {
1278 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sum>(x));
1279 }
1280 else if (process::is_block(x))
1281 {
1282 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::block>(x));
1283 }
1284 else if (process::is_hide(x))
1285 {
1286 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::hide>(x));
1287 }
1288 else if (process::is_rename(x))
1289 {
1290 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::rename>(x));
1291 }
1292 else if (process::is_comm(x))
1293 {
1294 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::comm>(x));
1295 }
1296 else if (process::is_allow(x))
1297 {
1298 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::allow>(x));
1299 }
1300 else if (process::is_sync(x))
1301 {
1302 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sync>(x));
1303 }
1304 else if (process::is_at(x))
1305 {
1306 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::at>(x));
1307 }
1308 else if (process::is_seq(x))
1309 {
1310 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::seq>(x));
1311 }
1312 else if (process::is_if_then(x))
1313 {
1314 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then>(x));
1315 }
1317 {
1318 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then_else>(x));
1319 }
1321 {
1322 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::bounded_init>(x));
1323 }
1324 else if (process::is_merge(x))
1325 {
1326 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::merge>(x));
1327 }
1328 else if (process::is_left_merge(x))
1329 {
1330 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::left_merge>(x));
1331 }
1332 else if (process::is_choice(x))
1333 {
1334 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::choice>(x));
1335 }
1337 {
1338 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::stochastic_operator>(x));
1339 }
1341 {
1342 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::untyped_process_assignment>(x));
1343 }
1344 static_cast<Derived&>(*this).leave(x);
1345 }
1346
1347};
1348
1349/// \\brief Builder class
1350template <typename Derived>
1352{
1353};
1354//--- end generated add_process_expressions code ---//
1355
1356//--- start generated add_process_identifiers code ---//
1357template <template <class> class Builder, class Derived>
1358struct add_process_identifiers: public Builder<Derived>
1359{
1360 using super = Builder<Derived>;
1361 using super::enter;
1362 using super::leave;
1363 using super::update;
1364 using super::apply;
1365
1367 {
1368 static_cast<Derived&>(*this).enter(x);
1369 static_cast<Derived&>(*this).update(x.equations());
1370 process_expression result_init;
1371 static_cast<Derived&>(*this).apply(result_init, x.init());
1372 x.init() = result_init;
1373 static_cast<Derived&>(*this).leave(x);
1374 }
1375
1376 template <class T>
1377 void apply(T& result, const process::process_identifier& x)
1378 {
1379 static_cast<Derived&>(*this).enter(x);
1380 // skip
1381 static_cast<Derived&>(*this).leave(x);
1382 result = atermpp::down_cast<T>(x);
1383 }
1384
1385 template <class T>
1386 void apply(T& result, const process::process_equation& x)
1387 {
1388 static_cast<Derived&>(*this).enter(x);
1389 process::make_process_equation(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, x.formal_parameters(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.expression()); });
1390 static_cast<Derived&>(*this).leave(x);
1391 }
1392
1393 template <class T>
1394 void apply(T& result, const process::action& x)
1395 {
1396 static_cast<Derived&>(*this).enter(x);
1397 // skip
1398 static_cast<Derived&>(*this).leave(x);
1399 result = atermpp::down_cast<T>(x);
1400 }
1401
1402 template <class T>
1403 void apply(T& result, const process::process_instance& x)
1404 {
1405 static_cast<Derived&>(*this).enter(x);
1406 process::make_process_instance(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, x.actual_parameters());
1407 static_cast<Derived&>(*this).leave(x);
1408 }
1409
1410 template <class T>
1411 void apply(T& result, const process::process_instance_assignment& x)
1412 {
1413 static_cast<Derived&>(*this).enter(x);
1414 process::make_process_instance_assignment(result, [&](process_identifier& result){ static_cast<Derived&>(*this).apply(result, x.identifier()); }, x.assignments());
1415 static_cast<Derived&>(*this).leave(x);
1416 }
1417
1418 template <class T>
1419 void apply(T& result, const process::delta& x)
1420 {
1421 static_cast<Derived&>(*this).enter(x);
1422 // skip
1423 static_cast<Derived&>(*this).leave(x);
1424 result = atermpp::down_cast<T>(x);
1425 }
1426
1427 template <class T>
1428 void apply(T& result, const process::tau& x)
1429 {
1430 static_cast<Derived&>(*this).enter(x);
1431 // skip
1432 static_cast<Derived&>(*this).leave(x);
1433 result = atermpp::down_cast<T>(x);
1434 }
1435
1436 template <class T>
1437 void apply(T& result, const process::sum& x)
1438 {
1439 static_cast<Derived&>(*this).enter(x);
1440 process::make_sum(result, x.variables(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1441 static_cast<Derived&>(*this).leave(x);
1442 }
1443
1444 template <class T>
1445 void apply(T& result, const process::block& x)
1446 {
1447 static_cast<Derived&>(*this).enter(x);
1448 process::make_block(result, x.block_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1449 static_cast<Derived&>(*this).leave(x);
1450 }
1451
1452 template <class T>
1453 void apply(T& result, const process::hide& x)
1454 {
1455 static_cast<Derived&>(*this).enter(x);
1456 process::make_hide(result, x.hide_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1457 static_cast<Derived&>(*this).leave(x);
1458 }
1459
1460 template <class T>
1461 void apply(T& result, const process::rename& x)
1462 {
1463 static_cast<Derived&>(*this).enter(x);
1464 process::make_rename(result, x.rename_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1465 static_cast<Derived&>(*this).leave(x);
1466 }
1467
1468 template <class T>
1469 void apply(T& result, const process::comm& x)
1470 {
1471 static_cast<Derived&>(*this).enter(x);
1472 process::make_comm(result, x.comm_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1473 static_cast<Derived&>(*this).leave(x);
1474 }
1475
1476 template <class T>
1477 void apply(T& result, const process::allow& x)
1478 {
1479 static_cast<Derived&>(*this).enter(x);
1480 process::make_allow(result, x.allow_set(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1481 static_cast<Derived&>(*this).leave(x);
1482 }
1483
1484 template <class T>
1485 void apply(T& result, const process::sync& x)
1486 {
1487 static_cast<Derived&>(*this).enter(x);
1488 process::make_sync(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1489 static_cast<Derived&>(*this).leave(x);
1490 }
1491
1492 template <class T>
1493 void apply(T& result, const process::at& x)
1494 {
1495 static_cast<Derived&>(*this).enter(x);
1496 process::make_at(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); }, x.time_stamp());
1497 static_cast<Derived&>(*this).leave(x);
1498 }
1499
1500 template <class T>
1501 void apply(T& result, const process::seq& x)
1502 {
1503 static_cast<Derived&>(*this).enter(x);
1504 process::make_seq(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1505 static_cast<Derived&>(*this).leave(x);
1506 }
1507
1508 template <class T>
1509 void apply(T& result, const process::if_then& x)
1510 {
1511 static_cast<Derived&>(*this).enter(x);
1512 process::make_if_then(result, x.condition(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); });
1513 static_cast<Derived&>(*this).leave(x);
1514 }
1515
1516 template <class T>
1517 void apply(T& result, const process::if_then_else& x)
1518 {
1519 static_cast<Derived&>(*this).enter(x);
1520 process::make_if_then_else(result, x.condition(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.then_case()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.else_case()); });
1521 static_cast<Derived&>(*this).leave(x);
1522 }
1523
1524 template <class T>
1525 void apply(T& result, const process::bounded_init& x)
1526 {
1527 static_cast<Derived&>(*this).enter(x);
1528 process::make_bounded_init(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1529 static_cast<Derived&>(*this).leave(x);
1530 }
1531
1532 template <class T>
1533 void apply(T& result, const process::merge& x)
1534 {
1535 static_cast<Derived&>(*this).enter(x);
1536 process::make_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1537 static_cast<Derived&>(*this).leave(x);
1538 }
1539
1540 template <class T>
1541 void apply(T& result, const process::left_merge& x)
1542 {
1543 static_cast<Derived&>(*this).enter(x);
1544 process::make_left_merge(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1545 static_cast<Derived&>(*this).leave(x);
1546 }
1547
1548 template <class T>
1549 void apply(T& result, const process::choice& x)
1550 {
1551 static_cast<Derived&>(*this).enter(x);
1552 process::make_choice(result, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.left()); }, [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.right()); });
1553 static_cast<Derived&>(*this).leave(x);
1554 }
1555
1556 template <class T>
1557 void apply(T& result, const process::stochastic_operator& x)
1558 {
1559 static_cast<Derived&>(*this).enter(x);
1560 process::make_stochastic_operator(result, x.variables(), x.distribution(), [&](process_expression& result){ static_cast<Derived&>(*this).apply(result, x.operand()); });
1561 static_cast<Derived&>(*this).leave(x);
1562 }
1563
1564 template <class T>
1565 void apply(T& result, const process::untyped_process_assignment& x)
1566 {
1567 static_cast<Derived&>(*this).enter(x);
1568 // skip
1569 static_cast<Derived&>(*this).leave(x);
1570 result = atermpp::down_cast<T>(x);
1571 }
1572
1573 template <class T>
1574 void apply(T& result, const process::process_expression& x)
1575 {
1576 static_cast<Derived&>(*this).enter(x);
1578 {
1579 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<data::untyped_data_parameter>(x));
1580 }
1581 else if (process::is_action(x))
1582 {
1583 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::action>(x));
1584 }
1586 {
1587 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance>(x));
1588 }
1590 {
1591 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::process_instance_assignment>(x));
1592 }
1593 else if (process::is_delta(x))
1594 {
1595 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::delta>(x));
1596 }
1597 else if (process::is_tau(x))
1598 {
1599 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::tau>(x));
1600 }
1601 else if (process::is_sum(x))
1602 {
1603 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sum>(x));
1604 }
1605 else if (process::is_block(x))
1606 {
1607 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::block>(x));
1608 }
1609 else if (process::is_hide(x))
1610 {
1611 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::hide>(x));
1612 }
1613 else if (process::is_rename(x))
1614 {
1615 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::rename>(x));
1616 }
1617 else if (process::is_comm(x))
1618 {
1619 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::comm>(x));
1620 }
1621 else if (process::is_allow(x))
1622 {
1623 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::allow>(x));
1624 }
1625 else if (process::is_sync(x))
1626 {
1627 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::sync>(x));
1628 }
1629 else if (process::is_at(x))
1630 {
1631 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::at>(x));
1632 }
1633 else if (process::is_seq(x))
1634 {
1635 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::seq>(x));
1636 }
1637 else if (process::is_if_then(x))
1638 {
1639 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then>(x));
1640 }
1642 {
1643 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::if_then_else>(x));
1644 }
1646 {
1647 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::bounded_init>(x));
1648 }
1649 else if (process::is_merge(x))
1650 {
1651 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::merge>(x));
1652 }
1653 else if (process::is_left_merge(x))
1654 {
1655 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::left_merge>(x));
1656 }
1657 else if (process::is_choice(x))
1658 {
1659 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::choice>(x));
1660 }
1662 {
1663 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::stochastic_operator>(x));
1664 }
1666 {
1667 static_cast<Derived&>(*this).apply(result, atermpp::down_cast<process::untyped_process_assignment>(x));
1668 }
1669 static_cast<Derived&>(*this).leave(x);
1670 }
1671
1672};
1673
1674/// \\brief Builder class
1675template <typename Derived>
1677{
1678};
1679//--- end generated add_process_identifiers code ---//
1680
1681} // namespace mcrl2::process
1682
1683#endif // MCRL2_PROCESS_BUILDER_H
aterm_string & operator=(const aterm_string &t) noexcept=default
aterm(const aterm &other) noexcept=default
This class has user-declared copy constructor so declare default copy and move operators.
A list of aterm objects.
Definition aterm_list.h:26
A unordered_map class in which aterms can be stored.
An abstraction expression.
Definition abstraction.h:23
const variable_list & variables() const
Definition abstraction.h:60
const data_expression & body() const
Definition abstraction.h:65
const binder_type & binding_operator() const
Definition abstraction.h:55
\brief A sort alias
Definition alias.h:23
alias(const basic_sort &name, const sort_expression &reference)
\brief Constructor Z12.
Definition alias.h:39
\brief Assignment of a data expression to a variable
Definition assignment.h:88
const data_expression & rhs() const
Definition assignment.h:119
const variable & lhs() const
Definition assignment.h:114
\brief A basic sort
Definition basic_sort.h:25
data_expression & operator=(const data_expression &) noexcept=default
data_expression()
\brief Default constructor X3.
data_expression & operator=(data_expression &&) noexcept=default
sort_expression sort() const
Returns the sort of the data expression.
Definition data.cpp:107
data_expression(const data_expression &) noexcept=default
Move semantics.
void add_consistent_inequality_set(const std::vector< linear_inequality > &inequalities_in_)
inequality_consistency_cache & operator=(const inequality_consistency_cache &)=delete
inequality_consistency_cache(const inequality_consistency_cache &)=delete
bool is_consistent(const std::vector< linear_inequality > &inequalities_in_) const
std::unique_ptr< inequality_inconsistency_cache_base > m_cache
inequality_inconsistency_cache_base & operator=(const inequality_inconsistency_cache_base &)=delete
std::unique_ptr< inequality_inconsistency_cache_base > m_present_branch
std::unique_ptr< inequality_inconsistency_cache_base > m_non_present_branch
inequality_inconsistency_cache_base(const node_type node, const linear_inequality &inequality, std::unique_ptr< inequality_inconsistency_cache_base > present_branch, std::unique_ptr< inequality_inconsistency_cache_base > non_present_branch)
inequality_inconsistency_cache_base(const inequality_inconsistency_cache_base &)=delete
bool is_inconsistent(const std::vector< linear_inequality > &inequalities_in_) const
inequality_inconsistency_cache & operator=(const inequality_consistency_cache &)=delete
inequality_inconsistency_cache(const inequality_inconsistency_cache &)=delete
void add_inconsistent_inequality_set(const std::vector< linear_inequality > &inequalities_in_)
std::unique_ptr< inequality_inconsistency_cache_base > m_cache
lhs_t(const aterm &t)
Constructor from an aterm.
const data_expression & operator[](const variable &v) const
Give the factor of variable v.
data_expression transform_to_data_expression() const
lhs_t erase(const variable &v) const
Erase a variable and its factor.
std::size_t count(const variable &v) const
Give the factor of variable v.
lhs_t(const ITERATOR begin, const ITERATOR end, TRANSFORMER f)
Constructor.
data_expression evaluate(const SubstitutionFunction &beta, const rewriter &r) const
Evaluate the variables in this lhs_t according to the subsitution function.
lhs_t::const_iterator find(const variable &v) const
Give an iterator of the factor/variable pair for v, or end() if v does not occur.
lhs_t(const ITERATOR begin, const ITERATOR end)
Constructor.
variable_with_a_rational_factor(const variable &v, const data_expression &f)
\brief A function sort
\brief A function symbol
function_symbol & operator=(function_symbol &&) noexcept=default
function_symbol()
Default constructor.
const detail::lhs_t & lhs() const
linear_inequality invert(const rewriter &r)
bool typical_pair(data_expression &lhs_expression, data_expression &rhs_expression, detail::comparison_t &comparison_operator, const rewriter &r) const
Return this inequality as a typical pair of terms of the form <x1+c2 x2+...+cn xn,...
linear_inequality()
Constructor yielding an inconsistent inequality.
bool is_true(const rewriter &r) const
void add_variables(std::set< variable > &variable_set) const
bool is_false(const rewriter &r) const
linear_inequality(const data_expression &e, const rewriter &r)
Constructor that constructs a linear inequality out of a data expression.
linear_inequality(const data_expression &lhs, const data_expression &rhs, const detail::comparison_t comparison, const rewriter &r, const bool negate=false)
constructor.
data_expression transform_to_data_expression() const
static void parse_and_store_expression(const data_expression &e, detail::map_based_lhs_t &new_lhs, data_expression &new_rhs, const rewriter &r, const bool negate=false, const data_expression &factor=real_one())
linear_inequality(const detail::lhs_t &lhs, const data_expression &r, detail::comparison_t t)
Basic constructor.
detail::lhs_t::const_iterator lhs_begin() const
detail::lhs_t::const_iterator lhs_end() const
linear_inequality(const detail::lhs_t &lhs, const data_expression &rhs, detail::comparison_t comparison, const rewriter &r)
constructor.
const data_expression & rhs() const
data_expression get_factor_for_a_variable(const variable &x)
detail::comparison_t comparison() const
Wrapper clas s for internal storage and substitution updates using operator()
assignment(const variable_type &v, Substitution &sigma, std::multiset< variable_type > &variables_in_rhs, std::set< variable_type > &scratch_set)
Constructor.
assignment & operator=(const expression_type &e)
Actual assignment.
Wrapper that extends any substitution to a substitution maintaining the vars in its rhs.
bool variable_occurs_in_a_rhs(const variable_type &v)
Indicates whether a variable occurs in some rhs of this substitution.
assignment operator[](variable_type const &v)
Assigment operator.
const std::multiset< variable > & variables_in_rhs()
Provides a set of variables that occur in the right hand sides of the assignments.
maintain_variables_in_rhs()=default
Default constructor.
std::multiset< variable_type > m_variables_in_rhs
Components for generating an arbitrary element of a sort.
data_expression operator()(const sort_expression &sort)
Returns a representative of a sort.
Rewriter that operates on data expressions.
Definition rewriter.h:84
data_expression operator()(const data_expression &d) const
Rewrites a data expression.
Definition rewriter.h:161
Identifier generator that stores the identifiers of the context in a set. Using the operator()() and ...
\brief A sort expression
sort_expression & operator=(const sort_expression &) noexcept=default
\brief A constructor for a structured sort
function_symbol constructor_function(const sort_expression &s) const
Returns the constructor function for this constructor, assuming it is internally represented with sor...
function_symbol recogniser_function(const sort_expression &s) const
Returns the function corresponding to the recogniser of this constructor, such that it is usable in t...
\brief A data variable
Definition variable.h:25
const core::identifier_string & name() const
Definition variable.h:35
variable & operator=(variable &&) noexcept=default
const sort_expression & sort() const
Definition variable.h:40
\brief A where expression
where_clause(const atermpp::aterm &term)
LPS summand containing a multi-action.
lps::multi_action m_multi_action
The summation variables of the summand.
action_summand(const action_summand &) noexcept=default
Move semantics.
data::assignment_list & assignments()
Returns the sequence of assignments.
void swap(action_summand &other) noexcept
Swaps the contents.
action_summand()=default
Constructor.
data::data_expression_list next_state(const data::variable_list &process_parameters) const
Returns the next state corresponding to this summand.
Definition lps.cpp:71
action_summand(const data::variable_list &summation_variables, const data::data_expression &condition, const lps::multi_action &action, const data::assignment_list &assignments)
Constructor.
bool has_time() const
Returns true if time is available.
bool is_tau() const
Returns true if the multi-action corresponding to this summand is equal to tau.
action_summand & operator=(const action_summand &) noexcept=default
action_summand & operator=(action_summand &&) noexcept=default
action_summand(action_summand &&) noexcept=default
const data::assignment_list & assignments() const
Returns the sequence of assignments.
data::assignment_list m_assignments
The assignments of the next state.
Algorithm class for elimination of constant parameters.
Definition constelm.h:23
void LOG_PARAMETER_CHANGE(const data::data_expression &d_j, const data::data_expression &Rd_j, const data::data_expression &Rg_ij, const data::mutable_map_substitution<> &sigma, const std::string &msg="")
Definition constelm.h:61
bool is_constant(const data::data_expression &x, const std::set< data::variable > &global_variables) const
Definition constelm.h:96
void remove_parameters(data::mutable_map_substitution<> &sigma)
Applies the substitution computed by compute_constant_parameters.
Definition constelm.h:232
const DataRewriter & R
The rewriter used by the constelm algorithm.
Definition constelm.h:38
void LOG_CONSTANT_PARAMETERS(const data::mutable_map_substitution<> &sigma, const std::string &constant_removed_msg="", const std::string &nothing_removed_msg="")
Definition constelm.h:40
bool m_ignore_conditions
If true, conditions are not evaluated and assumed to be true.
Definition constelm.h:32
constelm_algorithm(Specification &spec, const DataRewriter &R_)
Constructor.
Definition constelm.h:113
void LOG_CONDITION(const data::data_expression &cond, const data::data_expression &c_i, const data::mutable_map_substitution<> &sigma, const std::string &msg="")
Definition constelm.h:78
void run(bool instantiate_global_variables=false, bool ignore_conditions=false)
Runs the constelm algorithm.
Definition constelm.h:257
std::map< data::variable, std::size_t > m_index_of
Maps process parameters to their index.
Definition constelm.h:35
data::mutable_map_substitution compute_constant_parameters(bool instantiate_global_variables=false, bool ignore_conditions=false)
Computes constant parameters.
Definition constelm.h:123
bool m_instantiate_global_variables
If true, then the algorithm is allowed to instantiate free variables as a side effect.
Definition constelm.h:29
LPS summand containing a deadlock.
deadlock_summand()=default
Constructor.
deadlock_summand & operator=(const deadlock_summand &) noexcept=default
lps::deadlock m_deadlock
The deadlock of the summand.
deadlock_summand(deadlock_summand &&) noexcept=default
deadlock_summand & operator=(deadlock_summand &&) noexcept=default
void swap(deadlock_summand &other) noexcept
Swaps the contents.
deadlock_summand(const deadlock_summand &) noexcept=default
Move semantics.
deadlock_summand(const data::variable_list &summation_variables, const data::data_expression &condition, const lps::deadlock &delta)
Constructor.
bool has_time() const
Returns true if time is available.
Represents a deadlock.
Definition deadlock.h:23
bool operator!=(const deadlock &other) const
Comparison operator.
Definition deadlock.h:71
data::data_expression m_time
The time of the deadlock. If m_time == data::undefined_real() the multi action has no time.
Definition deadlock.h:29
deadlock(data::data_expression time=data::undefined_real())
Constructor.
Definition deadlock.h:33
bool has_time() const
Returns true if time is available.
Definition deadlock.h:39
std::string to_string() const
Returns a string representation of the deadlock.
Definition deadlock.h:59
const data::data_expression & time() const
Returns the time.
Definition deadlock.h:46
void swap(deadlock &other) noexcept
Swaps the contents.
Definition deadlock.h:77
data::data_expression & time()
Returns the time.
Definition deadlock.h:53
bool operator==(const deadlock &other) const
Comparison operator.
Definition deadlock.h:65
Algorithm class for algorithms on linear process specifications. It can be instantiated with lps::spe...
void remove_parameters(const std::set< data::variable > &to_be_removed)
Removes formal parameters from the specification.
void remove_unused_summand_variables()
Removes unused summand variables.
void sumelm_find_variables(const action_summand &s, std::set< data::variable > &result) const
void summand_remove_unused_summand_variables(SummandType &summand_)
void sumelm_find_variables(const deadlock_summand &s, std::set< data::variable > &result) const
data::data_expression next_state(const action_summand &s, const data::variable &v) const
Applies the next state substitution to the variable v.
bool verbose() const
Flag for verbose output.
void remove_singleton_sorts()
Removes parameters with a singleton sort.
void remove_trivial_summands()
Removes summands with condition equal to false.
void instantiate_free_variables()
Attempts to eliminate the free variables of the specification, by substituting a constant value for t...
lps_algorithm(Specification &spec)
Constructor.
Specification & m_spec
The specification that is processed by the algorithm.
data_expression & constraint()
Obtain a reference to the constraint.
deadlock_summand_vector & deadlock_summands()
Returns the sequence of deadlock summands.
const std::vector< ActionSummand > & action_summands() const
Returns the sequence of action summands.
deadlock_summand_vector m_deadlock_summands
The deadlock summands of the process.
linear_process_base()=default
Constructor.
data::variable_list m_process_parameters
The process parameters of the process.
linear_process_base(const data::variable_list &process_parameters, const deadlock_summand_vector &deadlock_summands, const std::vector< ActionSummand > &action_summands)
Constructor.
bool has_time() const
Returns true if time is available in at least one of the summands.
data::variable_list & process_parameters()
Returns the sequence of process parameters.
std::vector< ActionSummand > m_action_summands
The action summands of the process.
linear_process_base(const atermpp::aterm &lps, bool stochastic_distributions_allowed=true)
Constructor.
const deadlock_summand_vector & deadlock_summands() const
Returns the sequence of deadlock summands.
std::vector< ActionSummand > & action_summands()
Returns the sequence of action summands.
std::size_t summand_count() const
Returns the number of LPS summands.
const data::variable_list & process_parameters() const
Returns the sequence of process parameters.
linear_process(const data::variable_list &process_parameters, const deadlock_summand_vector &deadlock_summands, const action_summand_vector &action_summands)
Constructor.
linear_process(const atermpp::aterm &lps, bool=false)
Constructor.
linear_process()=default
Constructor.
\brief A timed multi-action
multi_action(const multi_action &) noexcept=default
Move semantics.
multi_action(const atermpp::aterm &term)
Constructor.
bool has_time() const
Returns true if time is available.
const process::action_list & actions() const
multi_action(const process::action &l)
Constructor.
multi_action operator+(const multi_action &other) const
Joins the actions of both multi actions.
multi_action & operator=(multi_action &&) noexcept=default
const data::data_expression & time() const
multi_action & operator=(const multi_action &) noexcept=default
multi_action(multi_action &&) noexcept=default
multi_action(const process::action_list &actions=process::action_list(), data::data_expression time=data::undefined_real())
Constructor. Actions are sorted to establish the sorted-storage invariant.
process_initializer & operator=(process_initializer &&) noexcept=default
process_initializer(process_initializer &&) noexcept=default
process_initializer(const process_initializer &) noexcept=default
Move semantics.
process_initializer(const data::data_expression_list &expressions)
Constructor.
process_initializer(const atermpp::aterm &term, bool check_distribution=true)
Constructor.
data::data_expression_list expressions() const
process_initializer & operator=(const process_initializer &) noexcept=default
process_initializer()
Default constructor.
const std::set< data::variable > & global_variables() const
Returns the declared free variables of the LPS.
LinearProcess & process()
Returns a reference to the linear process of the specification.
process::action_label_list m_action_labels
The action specification of the specification.
specification_base(const data::data_specification &data, const process::action_label_list &action_labels, const std::set< data::variable > &global_variables, const LinearProcess &lps, const InitialProcessExpression &initial_process)
Constructor.
const process::action_label_list & action_labels() const
Returns a sequence of action labels. This sequence contains all action labels occurring in the specif...
const InitialProcessExpression & initial_process() const
Returns the initial process.
const LinearProcess & process() const
Returns the linear process of the specification.
process::action_label_list & action_labels()
Returns a sequence of action labels. This sequence contains all action labels occurring in the specif...
std::set< data::variable > m_global_variables
The set of global variables.
InitialProcessExpression & initial_process()
Returns a reference to the initial process.
specification_base()=default
Constructor.
LinearProcess m_process
The linear process of the specification.
std::set< data::variable > & global_variables()
Returns the declared free variables of the LPS.
data::data_specification m_data
The data specification of the specification.
InitialProcessExpression m_initial_process
The initial state of the specification.
Linear process specification.
specification()=default
Constructor.
specification(const data::data_specification &data, const process::action_label_list &action_labels, const std::set< data::variable > &global_variables, const linear_process &lps, const process_initializer &initial_process)
Constructor.
LPS summand containing a multi-action.
stochastic_distribution m_distribution
The distribution of the summand.
stochastic_action_summand & operator=(const stochastic_action_summand &) noexcept=default
stochastic_action_summand()=default
Constructor.
stochastic_action_summand(stochastic_action_summand &&) noexcept=default
const stochastic_distribution & distribution() const
Returns the distribution of this summand.
stochastic_action_summand(const action_summand &s)
Constructor.
stochastic_action_summand & operator=(stochastic_action_summand &&) noexcept=default
void swap(stochastic_action_summand &other) noexcept
Swaps the contents.
stochastic_action_summand(const data::variable_list &summation_variables, const data::data_expression &condition, const lps::multi_action &action, const data::assignment_list &assignments, const stochastic_distribution &distribution)
Constructor.
stochastic_action_summand(const stochastic_action_summand &) noexcept=default
Move semantics.
stochastic_distribution & distribution()
Returns the distribution of this summand.
\brief A stochastic distribution
stochastic_distribution & operator=(stochastic_distribution &&) noexcept=default
stochastic_distribution(stochastic_distribution &&) noexcept=default
stochastic_distribution()
\brief Default constructor X3.
stochastic_distribution(const stochastic_distribution &) noexcept=default
Move semantics.
const data::variable_list & variables() const
bool is_defined() const
Returns true if the distribution is defined, i.e. it contains a valid distribution....
stochastic_distribution(const data::variable_list &variables, const data::data_expression &distribution)
\brief Constructor Z12.
stochastic_distribution & operator=(const stochastic_distribution &) noexcept=default
stochastic_distribution(const atermpp::aterm &term)
const data::data_expression & distribution() const
stochastic_linear_process(const atermpp::aterm &t, bool stochastic_distributions_allowed=true)
Constructor.
stochastic_linear_process(const data::variable_list &process_parameters, const deadlock_summand_vector &deadlock_summands, const stochastic_action_summand_vector &action_summands)
Constructor.
stochastic_linear_process()=default
Constructor.
stochastic_linear_process(const linear_process &other)
Constructor.
stochastic_process_initializer(const atermpp::aterm &term)
Constructor.
stochastic_process_initializer(const data::data_expression_list &expressions, const stochastic_distribution &distribution)
Constructor.
const stochastic_distribution & distribution() const
stochastic_specification(const specification &other)
Constructor. This constructor is explicit as implicit conversions of this kind is a source of bugs.
stochastic_specification()=default
Constructor.
stochastic_specification(const data::data_specification &data, const process::action_label_list &action_labels, const std::set< data::variable > &global_variables, const stochastic_linear_process &lps, const stochastic_process_initializer &initial_process)
Constructor.
Base class for LPS summands.
Definition summand.h:22
const data::data_expression & condition() const
Returns the condition expression.
Definition summand.h:56
const data::variable_list & summation_variables() const
Returns the sequence of summation variables.
Definition summand.h:49
data::variable_list m_summation_variables
The summation variables of the summand.
Definition summand.h:25
data::data_expression & condition()
Returns the condition expression.
Definition summand.h:63
data::data_expression m_condition
The condition of the summand.
Definition summand.h:28
void swap(summand_base &other) noexcept
Swaps the contents.
Definition summand.h:69
data::variable_list & summation_variables()
Returns the sequence of summation variables.
Definition summand.h:42
summand_base(const data::variable_list &summation_variables, const data::data_expression &condition)
Constructor.
Definition summand.h:35
summand_base()=default
Constructor.
\brief An action label
const data::sort_expression_list & sorts() const
action_label()
\brief Default constructor X3.
action_label(const atermpp::aterm &term)
action_label & operator=(action_label &&) noexcept=default
action_label(const std::string &name, const data::sort_expression_list &sorts)
\brief Constructor Z1.
action_label(action_label &&) noexcept=default
const core::identifier_string & name() const
action_label & operator=(const action_label &) noexcept=default
action_label(const action_label &) noexcept=default
Move semantics.
action_label(const core::identifier_string &name, const data::sort_expression_list &sorts)
\brief Constructor Z12.
\brief A multiset of action names
action_name_multiset & operator=(action_name_multiset &&) noexcept=default
const core::identifier_string_list & names() const
action_name_multiset & operator=(const action_name_multiset &) noexcept=default
action_name_multiset(const atermpp::aterm &term)
Constructor from aterm.
action_name_multiset(const action_name_multiset &) noexcept=default
Move semantics.
action_name_multiset(action_name_multiset &&) noexcept=default
action_name_multiset(const core::identifier_string_list &names)
Constructor. Names are sorted lexicographically to establish the sorted-storage invariant.
action(const action_label &label, const data::data_expression_list &arguments)
\brief Constructor Z14.
action & operator=(action &&) noexcept=default
action()
\brief Default constructor X3.
action(const atermpp::aterm &term)
action(action &&) noexcept=default
action & operator=(const action &) noexcept=default
const data::data_expression_list & arguments() const
action(const action &) noexcept=default
Move semantics.
const action_label & label() const
\brief The allow operator
allow(const allow &) noexcept=default
Move semantics.
allow()
\brief Default constructor X3.
allow(const atermpp::aterm &term)
const process_expression & operand() const
allow(const action_name_multiset_list &allow_set, const process_expression &operand)
\brief Constructor Z14.
allow(allow &&) noexcept=default
const action_name_multiset_list & allow_set() const
allow & operator=(allow &&) noexcept=default
allow & operator=(const allow &) noexcept=default
\brief The at operator
at(at &&) noexcept=default
at(const atermpp::aterm &term)
at(const at &) noexcept=default
Move semantics.
at()
\brief Default constructor X3.
at & operator=(const at &) noexcept=default
at(const process_expression &operand, const data::data_expression &time_stamp)
\brief Constructor Z14.
const data::data_expression & time_stamp() const
at & operator=(at &&) noexcept=default
const process_expression & operand() const
\brief The block operator
block & operator=(block &&) noexcept=default
block & operator=(const block &) noexcept=default
const process_expression & operand() const
block(block &&) noexcept=default
block(const block &) noexcept=default
Move semantics.
block(const atermpp::aterm &term)
block(const core::identifier_string_list &block_set, const process_expression &operand)
Constructor. block_set is sorted lexicographically to establish the sorted-storage invariant.
const core::identifier_string_list & block_set() const
\brief The bounded initialization
bounded_init(const bounded_init &) noexcept=default
Move semantics.
bounded_init & operator=(const bounded_init &) noexcept=default
const process_expression & right() const
bounded_init(bounded_init &&) noexcept=default
bounded_init(const process_expression &left, const process_expression &right)
\brief Constructor Z14.
bounded_init(const atermpp::aterm &term)
const process_expression & left() const
bounded_init()
\brief Default constructor X3.
bounded_init & operator=(bounded_init &&) noexcept=default
\brief The choice operator
choice(const atermpp::aterm &term)
choice & operator=(const choice &) noexcept=default
choice(const choice &) noexcept=default
Move semantics.
choice()
\brief Default constructor X3.
const process_expression & left() const
choice(const process_expression &left, const process_expression &right)
\brief Constructor Z14.
choice(choice &&) noexcept=default
const process_expression & right() const
choice & operator=(choice &&) noexcept=default
\brief The communication operator
comm & operator=(const comm &) noexcept=default
comm(const atermpp::aterm &term)
comm(comm &&) noexcept=default
comm & operator=(comm &&) noexcept=default
comm(const comm &) noexcept=default
Move semantics.
const communication_expression_list & comm_set() const
comm(const communication_expression_list &comm_set, const process_expression &operand)
\brief Constructor Z14.
const process_expression & operand() const
comm()
\brief Default constructor X3.
const core::identifier_string & name() const
communication_expression()
\brief Default constructor X3.
communication_expression & operator=(const communication_expression &) noexcept=default
communication_expression(const action_name_multiset &action_name, const std::string &name)
\brief Constructor Z1.
communication_expression(const communication_expression &) noexcept=default
Move semantics.
communication_expression(communication_expression &&) noexcept=default
communication_expression & operator=(communication_expression &&) noexcept=default
communication_expression(const action_name_multiset &action_name, const core::identifier_string &name)
\brief Constructor Z12.
const action_name_multiset & action_name() const
\brief The value delta
delta & operator=(const delta &) noexcept=default
delta()
\brief Default constructor X3.
delta(const atermpp::aterm &term)
delta(delta &&) noexcept=default
delta(const delta &) noexcept=default
Move semantics.
delta & operator=(delta &&) noexcept=default
\brief The hide operator
hide(hide &&) noexcept=default
hide(const atermpp::aterm &term)
hide(const core::identifier_string_list &hide_set, const process_expression &operand)
\brief Constructor Z14.
const core::identifier_string_list & hide_set() const
hide & operator=(const hide &) noexcept=default
const process_expression & operand() const
hide(const hide &) noexcept=default
Move semantics.
hide & operator=(hide &&) noexcept=default
hide()
\brief Default constructor X3.
\brief The if-then-else operator
const process_expression & else_case() const
if_then_else(if_then_else &&) noexcept=default
const process_expression & then_case() const
if_then_else(const atermpp::aterm &term)
if_then_else()
\brief Default constructor X3.
if_then_else & operator=(const if_then_else &) noexcept=default
if_then_else(const if_then_else &) noexcept=default
Move semantics.
const data::data_expression & condition() const
if_then_else & operator=(if_then_else &&) noexcept=default
if_then_else(const data::data_expression &condition, const process_expression &then_case, const process_expression &else_case)
\brief Constructor Z14.
\brief The if-then operator
const process_expression & then_case() const
if_then & operator=(const if_then &) noexcept=default
if_then(const data::data_expression &condition, const process_expression &then_case)
\brief Constructor Z14.
if_then(const atermpp::aterm &term)
const data::data_expression & condition() const
if_then(const if_then &) noexcept=default
Move semantics.
if_then & operator=(if_then &&) noexcept=default
if_then(if_then &&) noexcept=default
if_then()
\brief Default constructor X3.
\brief The left merge operator
left_merge(left_merge &&) noexcept=default
const process_expression & right() const
left_merge & operator=(left_merge &&) noexcept=default
left_merge(const atermpp::aterm &term)
left_merge & operator=(const left_merge &) noexcept=default
left_merge(const left_merge &) noexcept=default
Move semantics.
left_merge(const process_expression &left, const process_expression &right)
\brief Constructor Z14.
const process_expression & left() const
left_merge()
\brief Default constructor X3.
\brief The merge operator
merge(const atermpp::aterm &term)
const process_expression & right() const
const process_expression & left() const
merge & operator=(const merge &) noexcept=default
merge(const merge &) noexcept=default
Move semantics.
merge(const process_expression &left, const process_expression &right)
\brief Constructor Z14.
merge & operator=(merge &&) noexcept=default
merge(merge &&) noexcept=default
merge()
\brief Default constructor X3.
\brief A process equation
const data::variable_list & formal_parameters() const
const process_identifier & identifier() const
const process_expression & expression() const
\brief A process expression
process_expression & operator=(const process_expression &) noexcept=default
process_expression(const process_expression &) noexcept=default
Move semantics.
process_expression()
\brief Default constructor X3.
process_expression(const data::untyped_data_parameter &x)
\brief Constructor Z6.
process_expression(process_expression &&) noexcept=default
process_expression(const atermpp::aterm &term)
process_expression & operator=(process_expression &&) noexcept=default
\brief A process identifier
process_identifier(const process_identifier &) noexcept=default
Move semantics.
const data::variable_list & variables() const
process_identifier & operator=(const process_identifier &) noexcept=default
process_identifier(process_identifier &&) noexcept=default
process_identifier(const core::identifier_string &name, const data::variable_list &variables)
Constructor.
const core::identifier_string & name() const
process_identifier & operator=(process_identifier &&) noexcept=default
process_identifier(const std::string &name, const data::variable_list &variables)
Constructor.
process_identifier(const atermpp::aterm &term)
Constructor.
process_instance_assignment(const process_instance_assignment &) noexcept=default
Move semantics.
process_instance_assignment()
\brief Default constructor X3.
process_instance_assignment(const process_identifier &identifier, const data::assignment_list &assignments)
\brief Constructor Z14.
process_instance_assignment & operator=(const process_instance_assignment &) noexcept=default
process_instance_assignment(process_instance_assignment &&) noexcept=default
const data::assignment_list & assignments() const
process_instance_assignment(const atermpp::aterm &term)
process_instance_assignment & operator=(process_instance_assignment &&) noexcept=default
const process_identifier & identifier() const
const data::data_expression_list & actual_parameters() const
process_instance(const process_identifier &identifier, const data::data_expression_list &actual_parameters)
\brief Constructor Z14.
process_instance & operator=(const process_instance &) noexcept=default
process_instance & operator=(process_instance &&) noexcept=default
const process_identifier & identifier() const
process_instance(process_instance &&) noexcept=default
process_instance()
\brief Default constructor X3.
process_instance(const atermpp::aterm &term)
process_instance(const process_instance &) noexcept=default
Move semantics.
Process specification consisting of a data specification, action labels, a sequence of process equati...
process_expression & init()
Returns the initialization of the process specification.
process::action_label_list & action_labels()
Returns the action label specification.
\brief A rename expression
const core::identifier_string & source() const
rename_expression()
\brief Default constructor X3.
rename_expression & operator=(rename_expression &&) noexcept=default
rename_expression & operator=(const rename_expression &) noexcept=default
rename_expression(core::identifier_string &source, core::identifier_string &target)
\brief Constructor Z12.
const core::identifier_string & target() const
rename_expression(const atermpp::aterm &term)
rename_expression(rename_expression &&) noexcept=default
rename_expression(const std::string &source, const std::string &target)
\brief Constructor Z1.
rename_expression(const rename_expression &) noexcept=default
Move semantics.
\brief The rename operator
rename(const atermpp::aterm &term)
rename & operator=(const rename &) noexcept=default
rename(const rename &) noexcept=default
Move semantics.
rename()
\brief Default constructor X3.
const process_expression & operand() const
rename & operator=(rename &&) noexcept=default
rename(rename &&) noexcept=default
rename(const rename_expression_list &rename_set, const process_expression &operand)
\brief Constructor Z14.
const rename_expression_list & rename_set() const
\brief The sequential composition
seq & operator=(seq &&) noexcept=default
const process_expression & right() const
seq(const atermpp::aterm &term)
seq()
\brief Default constructor X3.
seq & operator=(const seq &) noexcept=default
const process_expression & left() const
seq(seq &&) noexcept=default
seq(const seq &) noexcept=default
Move semantics.
seq(const process_expression &left, const process_expression &right)
\brief Constructor Z14.
\brief The distribution operator
const data::variable_list & variables() const
const data::data_expression & distribution() const
stochastic_operator & operator=(stochastic_operator &&) noexcept=default
stochastic_operator()
\brief Default constructor X3.
stochastic_operator(const atermpp::aterm &term)
stochastic_operator(stochastic_operator &&) noexcept=default
stochastic_operator(const stochastic_operator &) noexcept=default
Move semantics.
stochastic_operator & operator=(const stochastic_operator &) noexcept=default
const process_expression & operand() const
stochastic_operator(const data::variable_list &variables, const data::data_expression &distribution, const process_expression &operand)
\brief Constructor Z14.
\brief The sum operator
const process_expression & operand() const
sum(const data::variable_list &variables, const process_expression &operand)
\brief Constructor Z14.
sum(const atermpp::aterm &term)
sum & operator=(sum &&) noexcept=default
sum()
\brief Default constructor X3.
const data::variable_list & variables() const
sum(sum &&) noexcept=default
sum(const sum &) noexcept=default
Move semantics.
sum & operator=(const sum &) noexcept=default
\brief The synchronization operator
sync & operator=(const sync &) noexcept=default
sync(sync &&) noexcept=default
sync(const sync &) noexcept=default
Move semantics.
const process_expression & left() const
sync()
\brief Default constructor X3.
sync & operator=(sync &&) noexcept=default
sync(const process_expression &left, const process_expression &right)
\brief Constructor Z14.
const process_expression & right() const
sync(const atermpp::aterm &term)
\brief The value tau
tau(const tau &) noexcept=default
Move semantics.
tau()
\brief Default constructor X3.
tau(const atermpp::aterm &term)
tau & operator=(tau &&) noexcept=default
tau & operator=(const tau &) noexcept=default
tau(tau &&) noexcept=default
\brief An untyped multi action or data application
const data::untyped_data_parameter_list & actions() const
\brief An untyped process assginment
untyped_process_assignment & operator=(untyped_process_assignment &&) noexcept=default
const data::untyped_identifier_assignment_list & assignments() const
untyped_process_assignment(const core::identifier_string &name, const data::untyped_identifier_assignment_list &assignments)
\brief Constructor Z14.
untyped_process_assignment(const atermpp::aterm &term)
const core::identifier_string & name() const
untyped_process_assignment()
\brief Default constructor X3.
untyped_process_assignment & operator=(const untyped_process_assignment &) noexcept=default
untyped_process_assignment(const std::string &name, const data::untyped_identifier_assignment_list &assignments)
\brief Constructor Z2.
untyped_process_assignment(untyped_process_assignment &&) noexcept=default
untyped_process_assignment(const untyped_process_assignment &) noexcept=default
Move semantics.
process_expression processbody
objectdatatype(const objectdatatype &o)=default
process_expression representedprocess
~objectdatatype()=default
process::action_label_list multi_action_names
processstatustype processstatus
identifier_string objectname
std::set< variable > get_free_variables() const
objectdatatype()=default
objectdatatype & operator=(const objectdatatype &o)=default
objecttype object
process_identifier process_representing_action
variable_list parameters
enumeratedtype(const enumeratedtype &e)
enumeratedtype(const std::size_t n, specification_basic_type &spec)
enumeratedtype & operator=(const enumeratedtype &e)=default
enumtype(const enumtype &)=delete
enumtype & operator=(const enumtype &)=delete
enumtype(std::size_t n, const sort_expression_list &fsorts, const sort_expression_list &gsorts, specification_basic_type &spec)
process_pid_pair & operator=(const process_pid_pair &other)=default
const process_expression & process_body() const
const process_identifier & process_id() const
process_pid_pair(const process_pid_pair &other)=default
process_pid_pair & operator=(process_pid_pair &&other)=default
process_pid_pair(const process_expression &process_body, const process_identifier &pid)
process_pid_pair(process_pid_pair &&other)=default
static stackoperations * find_suitable_stack_operations(const variable_list &parameters, stackoperations *stack_operations_list)
stacklisttype & operator=(const stacklisttype &)=delete
stacklisttype(const variable_list &parlist, specification_basic_type &spec, const bool regular, const std::set< process_identifier > &pCRLprocs, const bool singlecontrolstate)
Constructor.
stacklisttype(const stacklisttype &)=delete
stackoperations & operator=(const stackoperations &)=delete
stackoperations(const stackoperations &)=delete
stackoperations(const variable_list &pl, specification_basic_type &spec)
process_expression procstorealGNFbody(const process_expression &body, variableposition v, std::vector< process_identifier > &todo, const bool regular, processstatustype mode, const variable_list &freevars, const std::set< variable > &variables_bound_in_sum)
data_expression construct_binary_case_tree(std::size_t n, const variable_list &sums, data_expression_list terms, const sort_expression &termsort, const enumtype &e)
data::maintain_variables_in_rhs< data::mutable_map_substitution<> > make_unique_variables(const variable_list &var_list, const std::string &hint)
variable_list parscollect(const process_expression &oldbody, process_expression &newbody)
stochastic_action_summand collect_sum_arg_arg_cond(const enumtype &e, const stochastic_action_summand_vector &action_summands, const variable_list &parameters)
action_list linMergeMultiActionList(const action_list &ma1, const action_list &ma2)
void generateLPEpCRL(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const process_identifier &procId, const bool containstime, const bool regular, variable_list &parameters, data_expression_list &init, stochastic_distribution &initial_stochastic_distribution)
variable get_fresh_variable(const std::string &s, const sort_expression &sort, const int reuse_index=-1)
process_expression distributeActionOverConditions(const process_expression &act, const data_expression &condition, const process_expression &restterm, const variable_list &freevars, const std::set< variable > &variables_bound_in_sum)
data_expression construct_binary_case_tree_rec(std::size_t n, const variable_list &sums, data_expression_list &terms, const sort_expression &termsort, const enumtype &e)
static void complete_proc_identifier_map(std::map< process_identifier, process_identifier > &identifier_identifier_map)
process_expression to_regular_form(const process_expression &t, std::vector< process_identifier > &todo, const variable_list &freevars, const std::set< variable > &variables_bound_in_sum)
void collectsumlistterm(const process_identifier &procId, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const process_expression &body, const variable_list &pars, const stacklisttype &stack, const bool regular, const bool singlestate, const std::set< process_identifier > &pCRLprocs)
data_expression_list findarguments(const variable_list &pars, const variable_list &parlist, const assignment_list &args, const data_expression_list &t2, const stacklisttype &stack, const variable_list &vars, const std::set< variable > &free_variables_in_body, const variable_list &stochastic_variables)
void calculate_communication_merge(const stochastic_action_summand_vector &action_summands1, const deadlock_summand_vector &deadlock_summands1, const stochastic_action_summand_vector &action_summands2, const deadlock_summand_vector &deadlock_summands2, const action_name_multiset_list &allowlist, const bool is_allow, const bool is_block, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands)
void insertvariable(const variable &var, const bool mustbenew)
process_identifier storeinit(const process_expression &init)
static action_list to_sorted_action_list(const process_expression &p)
Convert the process expression to a sorted action list.
process_expression pCRLrewrite(const process_expression &t)
data_expression_list pushdummy_regular_data_expressions(const variable_list &pars, const stacklisttype &stack)
void define_equations_for_case_function(const std::size_t index, const data::function_symbol &functionname, const sort_expression &sort)
void alphaconvert(variable_list &sumvars, MutableSubstitution &sigma, const variable_list &occurvars, const data_expression_list &occurterms)
bool canterminatebody(const process_expression &t)
data_expression transform_matching_list(const variable_list &matchinglist)
void add_summands(const process_identifier &procId, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, process_expression summandterm, const std::set< process_identifier > &pCRLprocs, const stacklisttype &stack, const bool regular, const bool singlestate, const variable_list &process_parameters)
bool isDeltaAtZero(const process_expression &t)
data::function_symbol find_case_function(std::size_t index, const sort_expression &sort) const
data_expression_list make_initialstate(const process_identifier &initialProcId, const stacklisttype &stack, const std::set< process_identifier > &pcrlprcs, const bool regular, const bool singlecontrolstate, const stochastic_distribution &initial_stochastic_distribution)
static bool summandsCanBeClustered(const stochastic_action_summand &summand1, const stochastic_action_summand &summand2)
static sort_expression_list getActionSorts(const action_list &actionlist)
void filter_vars_by_multiaction(const action_list &multiaction, const std::set< variable > &vars_set, std::set< variable > &vars_result_set)
static process_identifier get_last(const process_identifier &id, const std::map< process_identifier, process_identifier > &identifier_identifier_map)
static bool check_real_variable_occurrence(const variable_list &sumvars, const data_expression &actiontime, const data_expression &condition)
process_identifier newprocess(const variable_list &parameters, const process_expression &body, const processstatustype ps, const bool canterminate, const bool containstime)
void make_pCRL_procs(const process_identifier &id, std::set< process_identifier > &reachable_process_identifiers)
void filter_vars_by_term(const data_expression &t, const std::set< variable > &vars_set, std::set< variable > &vars_result_set)
data_expression_list pushdummy_stack(const variable_list &parameters, const stacklisttype &stack, const variable_list &stochastic_variables)
void procstorealGNFrec(const process_identifier &procIdDecl, const variableposition v, std::vector< process_identifier > &todo, const bool regular)
static action_label_list getnames(const process_expression &multiAction)
variable_list getparameters_rec(const process_expression &multiAction, std::set< variable > &occurs_set)
static int match_sequence(const std::vector< process_instance_assignment > &s1, const std::vector< process_instance_assignment > &s2, const bool regular2)
assignment_list argscollect_regular2(const process_expression &t, variable_list &vl)
assignment_list make_optimised_assignment_list(const variable_list &parameters, const data_expression_list &resultnextstate, const variable_list &sum_vars, const variable_list &stoch_vars)
void calculate_left_merge_action(const lps::detail::ultimate_delay &ultimate_delay_condition, const stochastic_action_summand_vector &action_summands1, const action_name_multiset_list &allowlist, const bool is_allow, const bool is_block, stochastic_action_summand_vector &action_summands)
process_expression split_body(const process_expression &t, std::map< process_identifier, process_identifier > &visited_id, std::map< process_expression, process_expression > &visited_proc, const variable_list &parameters)
void parallelcomposition(const stochastic_action_summand_vector &action_summands1, const deadlock_summand_vector &deadlock_summands1, const variable_list &pars1, const data_expression_list &init1, const stochastic_distribution &initial_stochastic_distribution1, const lps::detail::ultimate_delay &ultimate_delay_condition1, const stochastic_action_summand_vector &action_summands2, const deadlock_summand_vector &deadlock_summands2, const variable_list &pars2, const data_expression_list &init2, const stochastic_distribution &initial_stochastic_distribution2, const lps::detail::ultimate_delay &ultimate_delay_condition2, const action_name_multiset_list &allowlist1, const bool is_allow, const bool is_block, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, variable_list &pars_result, data_expression_list &init_result, stochastic_distribution &initial_stochastic_distribution, lps::detail::ultimate_delay &ultimate_delay_condition)
bool occursintermlist(const variable &var, const assignment_list &r, const process_identifier &proc_name) const
void transform_process_arguments(const process_identifier &procId)
objectdatatype & insert_process_declaration(const process_identifier &procId, const variable_list &parameters, const process_expression &body, processstatustype s, const bool canterminate, const bool containstime)
static void set_proc_identifier_map(std::map< process_identifier, process_identifier > &identifier_identifier_map, const process_identifier &id1_, const process_identifier &id2_, const process_identifier &initial_process)
bool canterminate_rec(const process_identifier &procId, bool &stable, std::set< process_identifier > &visited)
set_identifier_generator fresh_identifier_generator
std::set< process_identifier > remove_stochastic_operators_from_front(const std::set< process_identifier > &reachable_process_identifiers, process_identifier &initial_process_id, stochastic_distribution &initial_stochastic_distribution)
void filter_vars_by_termlist(Iterator begin, const Iterator &end, const std::set< variable > &vars_set, std::set< variable > &vars_result_set)
bool searchProcDeclaration(const variable_list &parameters, const process_expression &body, const processstatustype s, const bool canterminate, const bool containstime, process_identifier &p) const
process_identifier splitmCRLandpCRLprocsAndAddTerminatedAction(const process_identifier &procId)
action_list linMergeMultiActionListProcess(const process_expression &ma1, const process_expression &ma2)
std::vector< process_equation > procs
action_list adapt_multiaction_to_stack(const action_list &multiAction, const stacklisttype &stack, const variable_list &vars)
void determinewhetherprocessescanterminate(const process_identifier &procId)
process_expression distribute_condition(const process_expression &body1, const data_expression &condition)
bool containstime_rec(const process_identifier &procId, bool *stable, std::set< process_identifier > &visited, bool &contains_if_then)
void collectsumlist(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const std::set< process_identifier > &pCRLprocs, const variable_list &pars, const stacklisttype &stack, bool regular, bool singlestate)
data_expression correctstatecond(const process_identifier &procId, const std::set< process_identifier > &pCRLproc, const stacklisttype &stack, int regular)
void calculate_communication_merge_action_summands(const stochastic_action_summand_vector &action_summands1, const stochastic_action_summand_vector &action_summands2, const action_name_multiset_list &allowlist, const bool is_allow, const bool is_block, stochastic_action_summand_vector &action_summands)
processstatustype determine_process_statusterm(const process_expression &body, const processstatustype status)
void calculate_communication_merge_action_deadlock_summands(const stochastic_action_summand_vector &action_summands1, const deadlock_summand_vector &deadlock_summands1, const stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands)
data_expression getvar(const variable &var, const stacklisttype &stack) const
variable_list initdatavars
lps::detail::ultimate_delay combine_ultimate_delays(const lps::detail::ultimate_delay &delay1, const lps::detail::ultimate_delay &delay2)
Returns the conjunction of the two delay conditions and the join of the variables,...
process_expression distributeTime(const process_expression &body, const data_expression &time, const variable_list &freevars, data_expression &timecondition)
data_expression_list pushdummyrec_stack(const variable_list &totalpars, const variable_list &pars, const stacklisttype &stack, const variable_list &stochastic_variables)
static action_list to_action_list(const process_expression &p)
std::set< data::variable > sigma_variables(const Substitution &sigma)
void combine_summand_lists(const stochastic_action_summand_vector &action_summands1, const deadlock_summand_vector &deadlock_summands1, const lps::detail::ultimate_delay &ultimate_delay_condition1, const stochastic_action_summand_vector &action_summands2, const deadlock_summand_vector &deadlock_summands2, const lps::detail::ultimate_delay &ultimate_delay_condition2, const variable_list &par1, const variable_list &par3, const action_name_multiset_list &allowlist1, const bool is_allow, const bool is_block, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands)
process_expression cut_off_unreachable_tail(const process_expression &t)
std::vector< enumeratedtype > enumeratedtypes
data_expression find_(const variable &s, const assignment_list &args, const stacklisttype &stack, const variable_list &vars, const std::set< variable > &free_variables_in_body, const variable_list &stochastic_variables)
process::action_label_list acts
assignment_list make_procargs_regular(const process_expression &t, const stacklisttype &stack, const std::set< process_identifier > &pcrlprcs, const bool singlestate, const variable_list &stochastic_variables)
std::size_t create_enumeratedtype(const std::size_t n)
void generateLPEmCRL(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const process_identifier &procIdDecl, const bool regular, variable_list &pars, data_expression_list &init, stochastic_distribution &initial_stochastic_distribution, lps::detail::ultimate_delay &ultimate_delay_condition)
process_instance_assignment expand_process_instance_assignment(const process_instance_assignment &t)
static process_expression delta_at_zero()
assignment_list rewrite_assignments(const assignment_list &t)
assignment_list push_regular(const process_identifier &procId, const assignment_list &args, const stacklisttype &stack, const std::set< process_identifier > &pCRLprocs, bool singlestate, const variable_list &stochastic_variables)
void transform_process_arguments(const process_identifier &procId, std::set< process_identifier > &visited_processes)
std::set< process_identifier > minimize_set_of_reachable_process_identifiers(const std::set< process_identifier > &reachable_process_identifiers, const process_identifier &initial_process)
void collectPcrlProcesses(const process_identifier &procDecl, std::vector< process_identifier > &pcrlprocesses, std::set< process_identifier > &visited)
variable_list make_binary_sums(std::size_t n, const sort_expression &enumtypename, data_expression &condition, const variable_list &tail)
variable_list SieveProcDataVarsAssignments(const std::set< variable > &vars, const data_expression_list &initial_state_expressions)
data_expression_list extend_conditions(const variable &var, const data_expression_list &conditionlist)
bool check_valid_process_instance_assignment(const process_identifier &id, const assignment_list &assignments)
void calculate_left_merge_deadlock(const lps::detail::ultimate_delay &ultimate_delay_condition, const deadlock_summand_vector &deadlock_summands1, const bool is_allow, const bool is_block, const stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands)
void addString(const identifier_string &str)
void procstovarheadGNF(const std::vector< process_identifier > &procs)
static process_expression action_list_to_process(const action_list &ma)
process_expression distribute_sum_over_a_stochastic_operator(const variable_list &sumvars, const variable_list &stochastic_variables, const data_expression &distribution, const process_expression &body)
void alphaconvertprocess(variable_list &sumvars, MutableSubstitution &sigma, const process_expression &p)
process_expression obtain_initial_distribution_term(const process_expression &t)
data_expression push_stack(const process_identifier &procId, const assignment_list &args, const data_expression_list &t2, const stacklisttype &stack, const std::set< process_identifier > &pCRLprocs, const variable_list &vars, const variable_list &stochastic_variables)
void calculate_left_merge(const stochastic_action_summand_vector &action_summands1, const deadlock_summand_vector &deadlock_summands1, const lps::detail::ultimate_delay &ultimate_delay_condition2, const action_name_multiset_list &allowlist, const bool is_allow, const bool is_block, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands)
void declare_control_state(const std::set< process_identifier > &pCRLprocs)
void create_case_function_on_enumeratedtype(const sort_expression &sort, const std::size_t enumeratedtype_index)
variable_list SieveProcDataVarsSummands(const std::set< variable > &vars, const stochastic_action_summand_vector &action_summands, const deadlock_summand_vector &deadlock_summands, const variable_list &parameters)
static data_expression_list extend(const data_expression &c, const data_expression_list &cl)
specification_basic_type & operator=(const specification_basic_type &)=delete
static bool occursinvarandremove(const variable &var, variable_list &vl)
process_expression bodytovarheadGNF(const process_expression &body, const state s, const variable_list &freevars, const variableposition v, const std::set< variable > &variables_bound_in_sum)
process_identifier terminatedProcId
process_expression distribute_sum(const variable_list &sumvars, const process_expression &body1)
data_expression variables_are_equal_to_default_values(const variable_list &vl)
void procstorealGNF(const process_identifier &procsIdDecl, const bool regular)
static bool check_assignment_list(const assignment_list &assignments, const variable_list &parameters)
data_expression RewriteTerm(const data_expression &t)
void alphaconversion(const process_identifier &procId, const variable_list &parameters)
bool all_equal(const atermpp::term_list< T > &l)
void cluster_actions(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const variable_list &pars)
process_expression transform_initial_distribution_term(const process_expression &t, const std::map< process_identifier, process_pid_pair > &processes_with_initial_distribution)
process_expression create_regular_invocation(process_expression sequence, std::vector< process_identifier > &todo, const variable_list &freevars, const std::set< variable > &variables_bound_in_sum)
process_expression transform_process_arguments_body(const process_expression &t, const std::set< variable > &bound_variables, std::set< process_identifier > &visited_processes)
static assignment_list parameters_to_assignment_list(const variable_list &parameters, const std::set< variable > &variables_bound_in_sum)
assignment_list dummyparameterlist(const stacklisttype &stack, const bool singlestate)
mcrl2::data::rewriter rewr
void make_pCRL_procs(const process_expression &t, std::set< process_identifier > &reachable_process_identifiers)
stackoperations * stack_operations_list
process_expression wraptime(const process_expression &body, const data_expression &time, const variable_list &freevars)
objectdatatype & objectIndex(const process_identifier &o)
process_identifier split_process(const process_identifier &procId, std::map< process_identifier, process_identifier > &visited_id, std::map< process_expression, process_expression > &visited_proc)
bool mergeoccursin(variable &var, const variable_list &v, variable_list &matchinglist, variable_list &pars, data_expression_list &args, const variable_list &process_parameters)
static bool occursintermlist(const variable &var, const data_expression_list &r)
bool exists_variable_for_sequence(const std::vector< process_instance_assignment > &process_names, process_identifier &result)
std::set< variable > find_free_variables_process(const process_expression &p)
process_expression alphaconversionterm(const process_expression &t, const variable_list &parameters, maintain_variables_in_rhs< mutable_map_substitution<> > sigma)
process_expression putbehind(const process_expression &body1, const process_expression &body2)
assignment_list substitute_assignmentlist(const assignment_list &assignments, const variable_list &parameters, const bool replacelhs, const bool replacerhs, Substitution &sigma)
process_instance_assignment transform_process_instance_to_process_instance_assignment(const process_instance &procId, const std::set< variable > &bound_variables=std::set< variable >())
process_instance_assignment RewriteProcess(const process_instance_assignment &t)
process_identifier delta_process
const objectdatatype & objectIndex(const process_identifier &o) const
void insert_summand(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const variable_list &sumvars, const data_expression &condition, const action_list &multiAction, const data_expression &actTime, const stochastic_distribution &distribution, const assignment_list &procargs, const bool has_time, const bool is_deadlock_summand)
bool alreadypresent(variable &var, const variable_list &vl, mutable_indexed_substitution<> &parameter_renaming)
variable_list parameters_that_occur_in_body(const variable_list &parameters, const process_expression &body)
process_expression enumerate_distribution_and_sums(const variable_list &sumvars, const variable_list &stochvars, const data_expression &distribution, const process_expression &body)
bool containstimebody(const process_expression &t)
assignment_list make_procargs(const process_expression &t, const stacklisttype &stack, const std::set< process_identifier > &pcrlprcs, const variable_list &vars, const bool regular, const bool singlestate, const variable_list &stochastic_variables)
data_expression adapt_term_to_stack(const data_expression &t, const stacklisttype &stack, const variable_list &vars, const variable_list &stochastic_variables)
data_expression_list processencoding(std::size_t i, const data_expression_list &t1, const stacklisttype &stack)
process_expression RewriteMultAct(const process_expression &t)
void generateLPEmCRLterm(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, const process_expression &t, const bool regular, const bool rename_variables, variable_list &pars, data_expression_list &init, stochastic_distribution &initial_stochastic_distribution, lps::detail::ultimate_delay &ultimate_delay_condition)
Linearise a process indicated by procIdDecl.
variable_list make_pars(const sort_expression_list &sortlist)
specification_basic_type(const specification_basic_type &)=delete
static data_expression real_times_optimized(const data_expression &r1, const data_expression &r2)
bool occursinpCRLterm(const variable &var, const process_expression &p, const bool strict)
void collectPcrlProcesses(const process_identifier &procDecl, std::vector< process_identifier > &pcrlprocesses)
static std::size_t upperpowerof2(std::size_t i)
void extract_names(const process_expression &sequence, std::vector< process_instance_assignment > &result)
std::map< aterm, objectdatatype > objectdata
action RewriteAction(const action &t)
data_expression_vector adapt_termlist_to_stack(Iterator begin, const Iterator &end, const stacklisttype &stack, const variable_list &vars, const variable_list &stochastic_variables)
data_expression make_procargs_stack(const process_expression &t, const stacklisttype &stack, const std::set< process_identifier > &pcrlprcs, const variable_list &vars, const variable_list &stochastic_variables)
specification_basic_type(const process::action_label_list &as, const std::vector< process_equation > &ps, const variable_list &idvs, const data_specification &ds, const std::set< data::variable > &glob_vars, const t_lin_options &opt, const process_specification &procspec)
variable_list getparameters(const process_expression &multiAction)
data_expression makesingleultimatedelaycondition(const variable_list &sumvars, const variable_list &freevars, const data_expression &condition, const bool has_time, const variable &timevariable, const data_expression &actiontime, variable_list &used_sumvars)
void collectPcrlProcesses_term(const process_expression &body, std::vector< process_identifier > &pcrlprocesses, std::set< process_identifier > &visited)
data_expression representative_generator_internal(const sort_expression &s, const bool allow_dont_care_var=true)
assignment_list processencoding(std::size_t i, const assignment_list &t1, const stacklisttype &stack)
objectdatatype & addMultiAction(const process_expression &multiAction, bool &isnew)
void storeprocs(const std::vector< process_equation > &procs)
process_expression substitute_pCRLproc(const process_expression &p, Substitution &sigma)
void make_parameters_and_sum_variables_unique(stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, variable_list &pars, lps::detail::ultimate_delay &ultimate_delay_condition, const std::string &hint="")
std::set< variable > global_variables
static data_expression getRHSassignment(const variable &var, const assignment_list &as)
variable_list construct_renaming(const variable_list &pars1, const variable_list &pars2, variable_list &pars3, variable_list &pars4, const bool unique=true)
void determine_process_status(const process_identifier &procDecl, const processstatustype status)
static action_list makemultiaction(const process::action_label_list &actionIds, const data_expression_list &args)
void insertvariables(const variable_list &vars, const bool mustbenew)
variable_list collectparameterlist(std::set< process_identifier > &pCRLprocs)
data_expression_list RewriteTermList(const data_expression_list &t)
data_specification data
variable_list make_parameters_rec(const data_expression_list &l, std::set< variable > &occurs_set)
void detail_check_objectdata(const process_identifier &o) const
static assignment_list filter_assignments(const assignment_list &assignments, const variable_list &parameters)
variable_list merge_var(const variable_list &v1, const variable_list &v2, std::vector< variable_list > &renamings_pars, std::vector< data_expression_list > &renamings_args, data_expression_list &conditionlist, const variable_list &process_parameters)
bool containstimebody(const process_expression &t, bool *stable, std::set< process_identifier > &visited, bool allowrecursion, bool &contains_if_then)
static assignment_list sort_assignments(const assignment_list &ass, const variable_list &parameters)
assignment_list find_dummy_arguments(const variable_list &parlist, const assignment_list &args, const std::set< variable > &free_variables_in_body, const variable_list &stochastic_variables)
process_identifier tau_process
static sort_expression_list get_sorts(const List &l)
std::vector< process_identifier > seq_varnames
void storeact(const process::action_label_list &acts)
bool is_global_variable(const data_expression &d) const
variable_list joinparameters(const variable_list &par1, const variable_list &par2, mutable_indexed_substitution<> &parameter_renaming)
static bool occursin(const variable &name, const variable_list &pars)
bool canterminatebody(const process_expression &t, bool &stable, std::set< process_identifier > &visited, const bool allowrecursion)
void AddTerminationActionIfNecessary(const stochastic_action_summand_vector &summands)
bool determinewhetherprocessescontaintime(const process_identifier &procId)
void filter_vars_by_assignmentlist(const assignment_list &assignments, const variable_list &parameters, const std::set< variable > &vars_set, std::set< variable > &vars_result_set)
data_expression_list addcondition(const variable_list &matchinglist, const data_expression_list &conditionlist)
void calculate_communication_merge_deadlock_summands(const deadlock_summand_vector &deadlock_summands1, const deadlock_summand_vector &deadlock_summands2, const stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands)
void transform(const process_identifier &init, stochastic_action_summand_vector &action_summands, deadlock_summand_vector &deadlock_summands, variable_list &parameters, data_expression_list &initial_state, stochastic_distribution &initial_stochastic_distribution)
process_expression obtain_initial_distribution(const process_identifier &procId)
objectdatatype & insertAction(const action_label &actionId)
Expression replace_variables_capture_avoiding_alt(const Expression &e, Substitution &sigma)
process_instance_assignment expand_process_instance_assignment(const process_instance_assignment &t, std::set< process_identifier > &visited_processes)
assignment_list pushdummy_regular(const variable_list &pars, const stacklisttype &stack, const variable_list &stochastic_variables)
assignment_list argscollect_regular(const process_expression &t, const variable_list &vl, const std::set< variable > &variables_bound_in_sum)
static data_expression_list getarguments(const action_list &multiAction)
lps::detail::ultimate_delay getUltimateDelayCondition(const stochastic_action_summand_vector &action_summands, const deadlock_summand_vector &deadlock_summands, const variable_list &freevars)
#define mCRL2log(LEVEL)
mCRL2log(LEVEL) provides the stream used to log.
Definition logger.h:435
void split_condition(const data_expression &e, std::vector< data_expression_list > &real_conditions, std::vector< data_expression > &non_real_conditions)
This function first splits the given condition e into real conditions and non real conditions.
lhs_t map_to_lhs_type(const map_based_lhs_t &lhs, const data_expression &factor, const rewriter &r)
data_expression negate_inequality(const data_expression &e)
lhs_t map_to_lhs_type(const map_based_lhs_t &lhs)
std::string pp(const detail::comparison_t t)
lhs_t set_factor_for_a_variable(const lhs_t &lhs, const variable &x, const data_expression &e)
const data_expression & else_part(const data_expression &e)
bool is_well_formed(const lhs_t &lhs)
bool is_inequality(const data_expression &e)
Determine whether a data expression is an inequality.
detail::comparison_t negate(const detail::comparison_t t)
const data_expression & condition_part(const data_expression &e)
lhs_t remove_variable_and_divide(const lhs_t &lhs, const variable &v, const data_expression &f, const rewriter &r)
std::string pp(const detail::lhs_t &lhs)
const data_expression & then_part(const data_expression &e)
static bool split_condition_aux(const data_expression &e, std::vector< data_expression_list > &real_conditions, std::vector< data_expression_list > &non_real_conditions, const bool negate=false)
Splits a condition in expressions ranging over reals and the others.
void set_factor_for_a_variable(detail::map_based_lhs_t &new_lhs, const variable &x, const data_expression &e)
atermpp::function_symbol f_variable_with_a_rational_factor()
A collection of utilities for lazy expression construction.
data_expression and_(data_expression const &p, data_expression const &q)
Returns an expression equivalent to p or q.
Namespace for system defined sort bool_.
Definition bool.h:29
bool is_or_application(const atermpp::aterm &e)
Recogniser for application of ||.
Definition bool.h:342
const basic_sort & bool_()
Constructor for sort expression Bool.
Definition bool.h:41
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
Definition bool.h:490
bool is_implies_application(const atermpp::aterm &e)
Recogniser for application of =>.
Definition bool.h:406
application not_(const data_expression &arg0)
Application of function symbol !.
Definition bool.h:194
application or_(const data_expression &arg0, const data_expression &arg1)
Application of function symbol ||.
Definition bool.h:321
const function_symbol & false_()
Constructor for function symbol false.
Definition bool.h:106
bool is_and_application(const atermpp::aterm &e)
Recogniser for application of &&.
Definition bool.h:278
bool is_not_application(const atermpp::aterm &e)
Recogniser for application of !.
Definition bool.h:214
const function_symbol & true_()
Constructor for function symbol true.
Definition bool.h:74
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
Definition bool.h:478
Namespace for system defined sort real_.
function_symbol plus(const sort_expression &s0, const sort_expression &s1)
Definition real1.h:1056
function_symbol times(const sort_expression &s0, const sort_expression &s1)
Definition real1.h:1234
bool is_zero(const atermpp::aterm &e)
function_symbol divides(const sort_expression &s0, const sort_expression &s1)
Definition real1.h:1404
data_expression & real_one()
bool is_one(const atermpp::aterm &e)
bool is_plus_application(const atermpp::aterm &e)
Recogniser for application of +.
Definition real1.h:1133
data_expression & real_zero()
bool is_creal_application(const atermpp::aterm &e)
Recogniser for application of @cReal.
Definition real1.h:150
function_symbol minus(const sort_expression &s0, const sort_expression &s1)
Definition real1.h:1149
const basic_sort & real_()
Constructor for sort expression Real.
Definition real1.h:45
bool is_real(const sort_expression &e)
Recogniser for sort expression Real.
Definition real1.h:55
application times(const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
Definition real1.h:1282
bool is_larger_zero(const atermpp::aterm &e)
Functions that returns true if e is a closed real number larger than zero.
function_symbol abs(const sort_expression &s0)
Definition real1.h:732
bool is_times_application(const atermpp::aterm &e)
Recogniser for application of *.
Definition real1.h:1303
function_symbol negate(const sort_expression &s0)
Definition real1.h:807
bool is_negate_application(const atermpp::aterm &e)
Recogniser for application of -.
Definition real1.h:874
bool is_minus_application(const atermpp::aterm &e)
Recogniser for application of -.
Definition real1.h:1218
linear_inequality subtract(const linear_inequality &e1, const linear_inequality &e2, const data_expression &f1, const data_expression &f2, const rewriter &r)
Subtract the given equality, multiplied by f1/f2. The result is e1-(f1/f2)e2,.
data_expression optimized_imp(const data_expression &p, const data_expression &q)
Make an implication and apply optimisations.
void make_optimized_imp(data_expression &result, const data_expression &p, const data_expression &q)
Make an implication and apply optimisations.
void make_optimized_and(data_expression &result, const data_expression &p, const data_expression &q)
Make a conjunction, and optimize if possible.
void make_optimized_or(data_expression &result, const data_expression &p, const data_expression &q)
Make a disjunction.
application real_times(const data_expression &arg0, const data_expression &arg1)
const data::data_expression & undefined_real()
Returns a data expression of type Real that corresponds to 'undefined'.
Definition undefined.h:66
data_expression & real_one()
void make_optimized_exists(data_expression &result, const variable_list &l, const data_expression &p, bool remove_variables=false)
Make an existential quantification and apply optimisations.
bool is_closed_real_number(const data_expression &e)
bool is_application(const data_expression &t)
Returns true if the term t is an application.
application real_plus(const data_expression &arg0, const data_expression &arg1)
data_expression & real_minus_one()
bool is_simple_substitution(const map_substitution< AssociativeContainer > &sigma)
data_expression optimized_or(const data_expression &p, const data_expression &q)
Make a disjunction.
bool is_positive(const data_expression &e, const rewriter &r)
bool is_where_clause(const atermpp::aterm &x)
Returns true if the term t is a where clause.
application less_equal(const data_expression &arg0, const data_expression &arg1)
Application of function symbol <=.
Definition standard.h:300
data_expression optimized_not(const data_expression &arg)
Make a negation.
application real_abs(const data_expression &arg)
application less(const data_expression &arg0, const data_expression &arg1)
Application of function symbol <.
Definition standard.h:263
std::set< data::variable > substitution_variables(const map_substitution< AssociativeContainer > &sigma)
void make_optimized_not(data_expression &result, const data_expression &arg)
Make a negation.
std::string pp_vector(const TYPE &inequalities)
Print the vector of inequalities to stderr in readable form.
bool is_abstraction(const atermpp::aterm &x)
Returns true if the term t is an abstraction.
application if_(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol if.
Definition standard.h:224
void remove_redundant_inequalities(const std::vector< linear_inequality > &inequalities, std::vector< linear_inequality > &resulting_inequalities, const rewriter &r)
Remove every redundant inequality from a vector of inequalities.
application real_minus(const data_expression &arg0, const data_expression &arg1)
map_substitution< AssociativeContainer > make_map_substitution(const AssociativeContainer &m)
Utility function for creating a map_substitution.
void fourier_motzkin(const data_expression &e_in, const variable_list &vars_in, data_expression &e_out, variable_list &vars_out, const rewriter &r)
Eliminate variables from a data expression using Gauss elimination and Fourier-Motzkin elimination.
bool is_simple_substitution(const assignment_sequence_substitution &sigma)
std::string pp(const linear_inequality &l)
application real_divides(const data_expression &arg0, const data_expression &arg1)
std::set< variable > gauss_elimination(const std::vector< linear_inequality > &inequalities, std::vector< linear_inequality > &resulting_equalities, std::vector< linear_inequality > &resulting_inequalities, Variable_iterator variables_begin, Variable_iterator variables_end, const rewriter &r)
Try to eliminate variables from a system of inequalities using Gauss elimination.
bool is_zero(const data_expression &e)
bool is_function_symbol(const atermpp::aterm &x)
Returns true if the term t is a function symbol.
void fourier_motzkin(const std::vector< linear_inequality > &inequalities_in, Data_variable_iterator variables_begin, Data_variable_iterator variables_end, std::vector< linear_inequality > &resulting_inequalities, const rewriter &r)
data_expression rewrite_with_memory(const data_expression &t, const rewriter &r)
data_expression & real_zero()
application greater(const data_expression &arg0, const data_expression &arg1)
Application of function symbol >
Definition standard.h:337
bool is_untyped_data_parameter(const atermpp::aterm &x)
data_expression optimized_exists(const variable_list &l, const data_expression &p, bool remove_variables=false)
Make an existential quantification and apply optimisations.
void make_optimized_forall(data_expression &result, const variable_list &l, const data_expression &p, bool remove_variables=false)
Make a universal quantification and apply optimisations.
application real_negate(const data_expression &arg)
data_expression optimized_and(const data_expression &p, const data_expression &q)
Make a conjunction, and optimize if possible.
bool is_inconsistent(const std::vector< linear_inequality > &inequalities_in, const rewriter &r, bool use_cache=true)
Determine whether a list of data expressions is inconsistent.
data_expression max(const data_expression &e1, const data_expression &e2, const rewriter &)
bool is_machine_number(const atermpp::aterm &x)
Returns true if the term t is a machine_number.
bool is_negative(const data_expression &e, const rewriter &r)
const data_expression_list & variable_list_to_data_expression_list(const variable_list &l)
Transform a variable_list into a data_expression_list.
application equal_to(const data_expression &arg0, const data_expression &arg1)
Application of function symbol ==.
Definition standard.h:149
data_expression min(const data_expression &e1, const data_expression &e2, const rewriter &)
data_expression optimized_forall(const variable_list &l, const data_expression &p, bool remove_variables=false)
Make a universal quantification and apply optimisations.
void swap(data_expression &t1, data_expression &t2) noexcept
\brief swap overload
bool is_variable(const atermpp::aterm &x)
Returns true if the term t is a variable.
A class that takes a linear process specification and checks all tau-summands of that LPS for conflue...
void replace_global_variables(Specification &lpsspec, const data::mutable_map_substitution<> &sigma)
Applies a global variable substitution to an LPS.
stochastic_action_summand_vector convert_action_summands(const action_summand_vector &action_summands)
data::mutable_map_substitution instantiate_global_variables(Specification &lpsspec)
Eliminates the global variables of an LPS, by substituting a constant value for them....
Summand make_action_summand(const data::variable_list &, const data::data_expression &, const multi_action &, const data::assignment_list &, const stochastic_distribution &)
The main namespace for the LPS library.
Definition constelm.h:18
std::ostream & operator<<(std::ostream &out, const stochastic_process_initializer &x)
std::ostream & operator<<(std::ostream &out, const stochastic_distribution &x)
std::string pp(const lps::stochastic_specification &x, bool arg0)
Definition lps.cpp:40
std::set< data::variable > find_all_variables(const lps::linear_process &x)
Definition lps.cpp:47
void make_stochastic_distribution(atermpp::aterm &t, const ARGUMENTS &... args)
std::string pp(const lps::specification &x, bool arg0)
Definition lps.cpp:35
std::set< data::sort_expression > find_sort_expressions(const lps::stochastic_specification &x)
Definition lps.cpp:46
std::set< data::variable > find_free_variables(const lps::stochastic_specification &x)
Definition lps.cpp:56
std::string pp(const lps::stochastic_distribution &x, bool arg0)
Definition lps.cpp:37
std::string pp_extended(const stochastic_specification &x, const std::string &process_name, bool precedence_aware, bool summand_numbers)
Definition lps.cpp:98
void complete_data_specification(stochastic_specification &spec)
Adds all sorts that appear in the process of l to the data specification of l.
void replace_variables_capture_avoiding(T &x, Substitution &sigma, data::set_identifier_generator &id_generator)
void swap(action_summand &t1, action_summand &t2) noexcept
\brief swap overload
void swap(deadlock_summand &t1, deadlock_summand &t2) noexcept
\brief swap overload
bool operator!=(const stochastic_specification &spec1, const stochastic_specification &spec2)
Inequality operator.
void replace_sort_expressions(T &x, const Substitution &sigma, bool innermost)
Definition replace.h:28
std::ostream & operator<<(std::ostream &out, const stochastic_linear_process &x)
std::set< data::variable > find_all_variables(const lps::stochastic_specification &x)
Definition lps.cpp:50
std::ostream & operator<<(std::ostream &out, const process_initializer &x)
bool check_well_typedness(const specification &x)
Definition lps.cpp:118
bool is_stochastic_process_initializer(const atermpp::aterm &x)
void complete_data_specification(specification &spec)
Adds all sorts that appear in the process of l to the data specification of l.
std::ostream & operator<<(std::ostream &out, const specification &x)
std::set< data::variable > find_free_variables(const lps::linear_process &x)
Definition lps.cpp:53
bool is_specification(const atermpp::aterm &x)
Test for a specification expression.
bool check_well_typedness(const linear_process &x)
Definition lps.cpp:108
void swap(deadlock &t1, deadlock &t2) noexcept
\brief swap overload
Definition deadlock.h:105
void swap(multi_action &t1, multi_action &t2) noexcept
\brief swap overload
T replace_variables_capture_avoiding(const T &x, Substitution &sigma, data::set_identifier_generator &id_generator)
std::set< data::function_symbol > find_function_symbols(const lps::stochastic_specification &x)
Definition lps.cpp:62
bool occursinterm(const data::data_expression &t, const data::variable &var)
std::string pp_extended(const specification &x, const std::string &process_name, bool precedence_aware, bool summand_numbers)
Definition lps.cpp:88
bool operator<(const stochastic_action_summand &x, const stochastic_action_summand &y)
Comparison operator for action summands.
void remove_parameters(Object &x, const std::set< data::variable > &to_be_removed)
Rewrites an LPS data type.
Definition remove.h:187
atermpp::aterm specification_to_aterm(const specification_base< LinearProcess, InitialProcessExpression > &spec)
Conversion to aterm.
std::set< process::action_label > find_action_labels(const lps::process_initializer &x)
Definition lps.cpp:66
std::ostream & operator<<(std::ostream &out, const deadlock &x)
Definition deadlock.h:99
std::set< data::variable > find_free_variables(const lps::specification &x)
Definition lps.cpp:55
void constelm(Specification &spec, const DataRewriter &R, bool instantiate_global_variables=false)
Removes zero or more constant parameters from the specification spec.
Definition constelm.h:269
std::ostream & operator<<(std::ostream &out, const action_summand &x)
void normalize_sorts(lps::specification &x, const data::sort_specification &)
Definition lps.cpp:42
atermpp::aterm deadlock_summand_to_aterm(const deadlock_summand &s)
Conversion to atermappl.
std::set< data::variable > find_free_variables(const lps::deadlock &x)
Definition lps.cpp:57
bool operator==(const specification &spec1, const specification &spec2)
Equality operator.
std::string pp(const lps::deadlock_summand &x, bool arg0)
Definition lps.cpp:31
std::set< process::action_label > find_action_labels(const lps::linear_process &x)
Definition lps.cpp:65
lps::multi_action normalize_sorts(const lps::multi_action &x, const data::sort_specification &sortspec)
Definition lps.cpp:41
std::set< data::variable > find_free_variables(const lps::stochastic_linear_process &x)
Definition lps.cpp:54
std::set< data::function_symbol > find_function_symbols(const lps::specification &x)
Definition lps.cpp:61
std::string pp(const lps::stochastic_linear_process &x, bool arg0)
Definition lps.cpp:38
std::set< data::variable > find_free_variables(const lps::stochastic_process_initializer &x)
Definition lps.cpp:60
bool operator==(const stochastic_specification &spec1, const stochastic_specification &spec2)
void swap(stochastic_action_summand &t1, stochastic_action_summand &t2) noexcept
\brief swap overload
std::set< data::variable > find_free_variables(const lps::multi_action &x)
Definition lps.cpp:58
std::string pp(const lps::deadlock &x, bool arg0)
Definition lps.cpp:30
std::ostream & operator<<(std::ostream &out, const multi_action &x)
void remove_redundant_assignments(Specification &lpsspec)
Removes redundant assignments of the form x = x from an LPS specification.
Definition remove.h:244
bool operator!=(const specification &spec1, const specification &spec2)
Inequality operator.
void normalize_sorts(lps::stochastic_specification &x, const data::sort_specification &)
Definition lps.cpp:43
std::set< data::variable > find_free_variables(const lps::process_initializer &x)
Definition lps.cpp:59
data::data_expression equal_multi_actions(const multi_action &a, const multi_action &b)
Returns a data expression that expresses under which conditions the multi actions a and b are equal....
bool is_stochastic_distribution(const atermpp::aterm &x)
specification remove_stochastic_operators(const stochastic_specification &spec)
Converts a stochastic specification to a specification. Throws an exception if non-empty distribution...
bool operator==(const action_summand &x, const action_summand &y)
Equality operator of action summands.
bool is_process_initializer(const atermpp::aterm &x)
void remove_singleton_sorts(Specification &spec)
Removes parameters with a singleton sort from a linear process specification.
Definition remove.h:208
bool check_well_typedness(const Object &o)
std::string pp(const lps::stochastic_action_summand &x, bool arg0)
Definition lps.cpp:36
data::assignment_list remove_redundant_assignments(const data::assignment_list &assignments, const data::variable_list &do_not_remove)
Removes assignments of the form x := x from v for variables x that are not contained in do_not_remove...
Definition remove.h:226
T replace_sort_expressions(const T &x, const Substitution &sigma, bool innermost)
Definition replace.h:38
mcrl2::lps::stochastic_specification linearise(const mcrl2::process::process_specification &type_checked_spec, const mcrl2::lps::t_lin_options &lin_options=t_lin_options())
Linearises a process specification.
std::string pp(const lps::stochastic_process_initializer &x, bool arg0)
Definition lps.cpp:39
std::string pp(const lps::linear_process &x, bool arg0)
Definition lps.cpp:32
std::string pp(const lps::multi_action &x, bool arg0)
Definition lps.cpp:33
void make_stochastic_process_initializer(atermpp::aterm &t, ARGUMENTS... args)
void swap(stochastic_process_initializer &t1, stochastic_process_initializer &t2) noexcept
\brief swap overload
std::ostream & operator<<(std::ostream &out, const stochastic_action_summand &x)
atermpp::aterm linear_process_to_aterm(const linear_process_base< ActionSummand > &p)
Conversion to aterm.
std::set< data::sort_expression > find_sort_expressions(const lps::specification &x)
Definition lps.cpp:45
void make_process_initializer(atermpp::aterm &t, EXPRESSION_LIST args)
bool operator==(const stochastic_action_summand &x, const stochastic_action_summand &y)
Equality operator of stochastic action summands.
void make_multi_action(atermpp::aterm &t, const ARGUMENTS &... args)
data::data_expression not_equal_multi_actions(const multi_action &a, const multi_action &b)
Returns a pbes expression that expresses under which conditions the multi actions a and b are not equ...
std::string pp(const lps::action_summand &x, bool arg0)
Definition lps.cpp:29
void remove_trivial_summands(Specification &spec)
Removes summands with condition equal to false from a linear process specification.
Definition remove.h:196
bool operator<(const action_summand &x, const action_summand &y)
Comparison operator for action summands.
std::set< data::variable > find_all_variables(const lps::specification &x)
Definition lps.cpp:49
std::ostream & operator<<(std::ostream &out, const linear_process &x)
bool check_well_typedness(const stochastic_specification &x)
Definition lps.cpp:123
std::set< data::variable > find_all_variables(const lps::deadlock &x)
Definition lps.cpp:51
atermpp::aterm action_summand_to_aterm(const action_summand &s)
Conversion to aterm.
std::set< data::variable > find_all_variables(const lps::stochastic_linear_process &x)
Definition lps.cpp:48
bool check_well_typedness(const stochastic_linear_process &x)
Definition lps.cpp:113
lps::multi_action translate_user_notation(const lps::multi_action &x)
Definition lps.cpp:44
void swap(stochastic_distribution &t1, stochastic_distribution &t2) noexcept
\brief swap overload
std::ostream & operator<<(std::ostream &out, const stochastic_specification &x)
std::set< core::identifier_string > find_identifiers(const lps::stochastic_specification &x)
Definition lps.cpp:64
atermpp::aterm action_summand_to_aterm(const stochastic_action_summand &s)
Conversion to aterm.
void swap(process_initializer &t1, process_initializer &t2) noexcept
\brief swap overload
std::set< core::identifier_string > find_identifiers(const lps::specification &x)
Definition lps.cpp:63
std::ostream & operator<<(std::ostream &out, const deadlock_summand &x)
std::set< process::action_label > find_action_labels(const lps::specification &x)
Definition lps.cpp:67
std::string pp(const lps::process_initializer &x, bool arg0)
Definition lps.cpp:34
bool is_multi_action(const atermpp::aterm &x)
bool is_linear_process(const atermpp::aterm &x)
Test for a linear_process expression.
The main namespace for the Process library.
std::string pp(const action_list &x, bool precedence_aware=true)
Definition process.cpp:24
bool is_at(const atermpp::aterm &x)
void swap(rename &t1, rename &t2) noexcept
\brief swap overload
void make_allow(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(at &t1, at &t2) noexcept
\brief swap overload
void swap(action &t1, action &t2) noexcept
\brief swap overload
bool operator<(const action_label &a1, const action_label &a2)
Total ordering on action labels: name first (string order), then sorts.
std::set< data::variable > find_all_variables(const action &x)
Definition process.cpp:76
std::ostream & operator<<(std::ostream &out, const sync &x)
void normalize_sorts(process::process_equation_vector &x, const data::sort_specification &sortspec)
Definition process.cpp:67
std::ostream & operator<<(std::ostream &out, const bounded_init &x)
void make_choice(atermpp::aterm &t, const ARGUMENTS &... args)
std::string pp(const process::action_name_multiset &x, bool arg0)
Definition process.cpp:36
std::string pp(const process::action_label &x, bool arg0)
Definition process.cpp:35
std::string pp(const process::process_identifier &x, bool arg0)
Definition process.cpp:52
void swap(if_then &t1, if_then &t2) noexcept
\brief swap overload
void make_process_identifier(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(bounded_init &t1, bounded_init &t2) noexcept
\brief swap overload
bool is_process_instance(const atermpp::aterm &x)
void swap(delta &t1, delta &t2) noexcept
\brief swap overload
std::string pp(const tau &x, bool precedence_aware=true)
Definition process.cpp:62
process::action_label_list normalize_sorts(const process::action_label_list &x, const data::sort_specification &sortspec)
Definition process.cpp:66
std::ostream & operator<<(std::ostream &out, const sum &x)
std::string pp(const if_then &x, bool precedence_aware=true)
Definition process.cpp:46
void make_merge(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(rename_expression &t1, rename_expression &t2) noexcept
\brief swap overload
std::string pp(const stochastic_operator &x, bool precedence_aware=true)
Definition process.cpp:59
void swap(merge &t1, merge &t2) noexcept
\brief swap overload
void make_at(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_process_expression(const atermpp::aterm &x)
bool is_process_instance_assignment(const atermpp::aterm &x)
void swap(left_merge &t1, left_merge &t2) noexcept
\brief swap overload
std::string pp(const process::communication_expression &x, bool arg0)
Definition process.cpp:43
std::ostream & operator<<(std::ostream &out, const untyped_process_assignment &x)
bool is_tau(const atermpp::aterm &x)
std::string pp(const process::rename_expression &x, bool arg0)
Definition process.cpp:57
std::ostream & operator<<(std::ostream &out, const stochastic_operator &x)
std::ostream & operator<<(std::ostream &out, const left_merge &x)
std::string pp(const process_identifier_list &x)
void make_action(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const process_identifier &x)
bool is_seq(const atermpp::aterm &x)
void make_sync(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(allow &t1, allow &t2) noexcept
\brief swap overload
bool is_merge(const atermpp::aterm &x)
std::set< data::sort_expression > find_sort_expressions(const process::action_label_list &x)
Definition process.cpp:72
void make_if_then_else(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_action_label(const atermpp::aterm &x)
void swap(process_identifier &t1, process_identifier &t2) noexcept
\brief swap overload
void make_hide(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(hide &t1, hide &t2) noexcept
\brief swap overload
bool is_communication_expression(const atermpp::aterm &x)
std::ostream & operator<<(std::ostream &out, const communication_expression &x)
bool is_allow(const atermpp::aterm &x)
std::string pp(const process_expression &x, bool precedence_aware=true)
Definition process.cpp:51
std::string pp(const merge &x, bool precedence_aware=true)
Definition process.cpp:49
std::string pp(const rename &x, bool precedence_aware=true)
Definition process.cpp:56
void swap(action_label &t1, action_label &t2) noexcept
\brief swap overload
bool operator<(const action &a1, const action &a2)
std::string pp(const seq &x, bool precedence_aware=true)
Definition process.cpp:58
void make_if_then(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const choice &x)
void swap(seq &t1, seq &t2) noexcept
\brief swap overload
std::string pp(const sum &x, bool precedence_aware=true)
Definition process.cpp:60
bool is_bounded_init(const atermpp::aterm &x)
bool is_delta(const atermpp::aterm &x)
std::ostream & operator<<(std::ostream &out, const rename &x)
std::string pp(const process_expression_list &x, bool precedence_aware=true)
Definition process.cpp:30
std::string pp(const bounded_init &x, bool precedence_aware=true)
Definition process.cpp:40
void swap(untyped_process_assignment &t1, untyped_process_assignment &t2) noexcept
\brief swap overload
std::ostream & operator<<(std::ostream &out, const process_instance_assignment &x)
std::ostream & operator<<(std::ostream &out, const process_instance &x)
std::set< data::sort_expression > find_sort_expressions(const process::process_expression &x)
Definition process.cpp:74
void make_block(atermpp::aterm &t, const ARGUMENTS &... args)
process::process_expression translate_user_notation(const process::process_expression &x)
Definition process.cpp:70
bool is_sum(const atermpp::aterm &x)
std::string pp(const allow &x, bool precedence_aware=true)
Definition process.cpp:37
std::string pp(const multi_action_name_set &A)
Pretty print function for a set of multi action names.
bool is_process_identifier(const atermpp::aterm &x)
std::ostream & operator<<(std::ostream &out, const at &x)
void swap(block &t1, block &t2) noexcept
\brief swap overload
bool is_block(const atermpp::aterm &x)
bool is_if_then_else(const atermpp::aterm &x)
void make_action_label(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const allow &x)
bool is_comm(const atermpp::aterm &x)
action normalize_sorts(const action &x, const data::sort_specification &sortspec)
Definition process.cpp:65
void alphabet_reduce(process_specification &procspec, std::size_t duplicate_equation_limit=(std::numeric_limits< size_t >::max)())
Applies alphabet reduction to a process specification.
Definition process.cpp:82
std::string pp(const process_instance &x, bool precedence_aware=true)
Definition process.cpp:53
std::ostream & operator<<(std::ostream &out, const if_then_else &x)
bool is_action(const atermpp::aterm &x)
std::string pp(const left_merge &x, bool precedence_aware=true)
Definition process.cpp:48
void swap(stochastic_operator &t1, stochastic_operator &t2) noexcept
\brief swap overload
void swap(if_then_else &t1, if_then_else &t2) noexcept
\brief swap overload
bool is_left_merge(const atermpp::aterm &x)
std::string pp(const sync &x, bool precedence_aware=true)
Definition process.cpp:61
std::string pp(const action &x, bool precedence_aware=true)
Definition process.cpp:34
std::ostream & operator<<(std::ostream &out, const tau &x)
void swap(process_instance &t1, process_instance &t2) noexcept
\brief swap overload
void make_communication_expression(atermpp::aterm &t, const ARGUMENTS &... args)
std::string pp(const at &x, bool precedence_aware=true)
Definition process.cpp:38
void make_stochastic_operator(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_action_name_multiset(const atermpp::aterm &x)
void swap(communication_expression &t1, communication_expression &t2) noexcept
\brief swap overload
std::string pp(const comm &x, bool precedence_aware=true)
Definition process.cpp:42
void swap(process_expression &t1, process_expression &t2) noexcept
\brief swap overload
void make_process_instance(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const hide &x)
bool is_hide(const atermpp::aterm &x)
std::string pp(const untyped_process_assignment &x, bool precedence_aware=true)
Definition process.cpp:64
void swap(tau &t1, tau &t2) noexcept
\brief swap overload
std::ostream & operator<<(std::ostream &out, const delta &x)
bool is_if_then(const atermpp::aterm &x)
std::ostream & operator<<(std::ostream &out, const comm &x)
void make_untyped_process_assignment(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const action_name_multiset &x)
void make_process_instance_assignment(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_choice(const atermpp::aterm &x)
action translate_user_notation(const action &x)
Definition process.cpp:69
std::set< data::variable > find_free_variables(const action &x)
Definition process.cpp:77
std::string pp(const process_instance_assignment &x, bool precedence_aware=true)
Definition process.cpp:54
std::string pp(const process_expression_vector &x, bool precedence_aware=true)
Definition process.cpp:31
void make_comm(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const seq &x)
bool is_stochastic_operator(const atermpp::aterm &x)
std::ostream & operator<<(std::ostream &out, const rename_expression &x)
std::string pp(const block &x, bool precedence_aware=true)
Definition process.cpp:39
void swap(sum &t1, sum &t2) noexcept
\brief swap overload
void make_bounded_init(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const process_expression &x)
void swap(process_instance_assignment &t1, process_instance_assignment &t2) noexcept
\brief swap overload
bool is_rename_expression(const atermpp::aterm &x)
void swap(comm &t1, comm &t2) noexcept
\brief swap overload
void make_rename_expression(atermpp::aterm &t, const ARGUMENTS &... args)
void make_action_name_multiset(atermpp::aterm &t, const ARGUMENTS &... args)
std::ostream & operator<<(std::ostream &out, const action_label &x)
std::ostream & operator<<(std::ostream &out, const block &x)
std::ostream & operator<<(std::ostream &out, const action &x)
std::ostream & operator<<(std::ostream &out, const merge &x)
void swap(choice &t1, choice &t2) noexcept
\brief swap overload
std::string pp(const choice &x, bool precedence_aware=true)
Definition process.cpp:41
bool is_rename(const atermpp::aterm &x)
bool is_untyped_process_assignment(const atermpp::aterm &x)
void make_rename(atermpp::aterm &t, const ARGUMENTS &... args)
void make_seq(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_sync(const atermpp::aterm &x)
std::string pp(const delta &x, bool precedence_aware=true)
Definition process.cpp:44
void make_sum(atermpp::aterm &t, const ARGUMENTS &... args)
std::string pp(const hide &x, bool precedence_aware=true)
Definition process.cpp:45
std::string pp(const if_then_else &x, bool precedence_aware=true)
Definition process.cpp:47
void swap(action_name_multiset &t1, action_name_multiset &t2) noexcept
\brief swap overload
bool equal_signatures(const action &a, const action &b)
Compares the signatures of two actions.
void swap(sync &t1, sync &t2) noexcept
\brief swap overload
std::ostream & operator<<(std::ostream &out, const if_then &x)
std::string pp(const process::action_label_list &x, bool arg0)
Definition process.cpp:26
void make_left_merge(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(atermpp::aterm &t1, atermpp::aterm &t2) noexcept
Swaps two term_applss.
Definition aterm.h:364
expression builder that visits all sub expressions
Definition builder.h:32
static const atermpp::aterm Delta
static const atermpp::aterm UntypedProcessAssignment
static const atermpp::aterm Distribution
static const atermpp::aterm Allow
static const atermpp::aterm RenameExpr
static const atermpp::aterm Tau
static const atermpp::aterm ActId
static const atermpp::aterm Hide
static const atermpp::aterm LinearProcessInit
static const atermpp::aterm Rename
static const atermpp::aterm Process
static const atermpp::aterm IfThen
static const atermpp::aterm StochasticOperator
static const atermpp::aterm BInit
static const atermpp::aterm Merge
static const atermpp::aterm Action
static const atermpp::aterm MultActName
static const atermpp::aterm AtTime
static const atermpp::aterm Choice
static const atermpp::aterm Comm
static const atermpp::aterm ProcessAssignment
static const atermpp::aterm Sync
static const atermpp::aterm LMerge
static const atermpp::aterm ProcVarId
static const atermpp::aterm ProcExpr
static const atermpp::aterm Seq
static const atermpp::aterm Sum
static const atermpp::aterm Block
static const atermpp::aterm CommExpr
static const atermpp::aterm IfThenElse
Substitution that maps data variables to data expressions. The substitution is stored as an assignmen...
assignment_sequence_substitution(const assignment_list &assignments_)
const data_expression & operator()(const variable &v) const
A unary function that can be used in combination with replace_data_expressions to eliminate real numb...
fourier_motzkin_sigma(const rewriter &rewr_)
data_expression apply(const abstraction &d, bool negate) const
data_expression operator()(const data_expression &d) const
static constexpr bool is_identity_substitution
Generic substitution function. The substitution is stored as a mapping of variables to expressions.
const AssociativeContainer & m_map
map_substitution(const AssociativeContainer &m)
static constexpr bool is_identity_substitution
expression_type operator()(const variable_type &v) const
void update(lps::action_summand &x)
Definition builder.h:222
void apply(T &result, const lps::stochastic_process_initializer &x)
Definition builder.h:308
void update(lps::linear_process &x)
Definition builder.h:245
void apply(T &result, const lps::multi_action &x)
Definition builder.h:205
void apply(T &result, const lps::stochastic_distribution &x)
Definition builder.h:264
void update(lps::specification &x)
Definition builder.h:253
void update(lps::deadlock &x)
Definition builder.h:195
void update(lps::stochastic_linear_process &x)
Definition builder.h:289
void apply(T &result, const lps::process_initializer &x)
Definition builder.h:238
void update(lps::stochastic_action_summand &x)
Definition builder.h:271
void update(lps::deadlock_summand &x)
Definition builder.h:212
void update(lps::stochastic_specification &x)
Definition builder.h:297
void update(lps::deadlock &x)
Definition builder.h:32
void update(lps::stochastic_specification &x)
Definition builder.h:153
void update(lps::specification &x)
Definition builder.h:99
void apply(T &result, const lps::process_initializer &x)
Definition builder.h:81
void apply(T &result, const lps::stochastic_process_initializer &x)
Definition builder.h:168
void update(lps::action_summand &x)
Definition builder.h:62
void apply(T &result, const lps::stochastic_distribution &x)
Definition builder.h:114
void update(lps::stochastic_linear_process &x)
Definition builder.h:142
void update(lps::stochastic_action_summand &x)
Definition builder.h:121
void apply(T &result, const lps::multi_action &x)
Definition builder.h:42
void update(lps::linear_process &x)
Definition builder.h:88
void update(lps::deadlock_summand &x)
Definition builder.h:49
void update(lps::action_summand &x)
Definition builder.h:364
void update(lps::deadlock &x)
Definition builder.h:334
void apply(T &result, const lps::multi_action &x)
Definition builder.h:344
void apply(T &result, const lps::stochastic_process_initializer &x)
Definition builder.h:464
void update(lps::specification &x)
Definition builder.h:401
void apply(T &result, const lps::stochastic_distribution &x)
Definition builder.h:413
void update(lps::linear_process &x)
Definition builder.h:390
void update(lps::stochastic_action_summand &x)
Definition builder.h:420
void update(lps::stochastic_specification &x)
Definition builder.h:452
void apply(T &result, const lps::process_initializer &x)
Definition builder.h:383
void update(lps::stochastic_linear_process &x)
Definition builder.h:441
void update(lps::deadlock_summand &x)
Definition builder.h:351
void apply(T &result, const stochastic_distribution &x, data::data_expression_list &pars)
In the code below, it is essential that the assignments are also updated. They are passed by referenc...
void apply(T &result, const stochastic_distribution &x, data::assignment_list &assignments)
In the code below, it is essential that the assignments are also updated. They are passed by referenc...
void do_action_summand(ActionSummand &x, const data::variable_list &v)
add_capture_avoiding_replacement(data::detail::capture_avoiding_substitution_updater< Substitution > &sigma)
Function object that checks if a sort is a singleton sort. Note that it is an approximation,...
Definition remove.h:36
is_singleton_sort(const data::data_specification &data_spec)
Definition remove.h:39
bool operator()(const data::sort_expression &s) const
Definition remove.h:43
const data::data_specification & m_data_spec
Definition remove.h:37
Function object that checks if a summand has a false condition.
Definition remove.h:25
bool operator()(const summand_base &s) const
Definition remove.h:26
Traverser for removing parameters from LPS data types. These parameters can be either process paramet...
Definition remove.h:58
void apply(atermpp::term_list< T > &result, const data::assignment_list &x)
Removes parameters from a list of assignments. Assignments to removed parameters are removed.
Definition remove.h:101
void apply(T &result, const stochastic_process_initializer &x)
Definition remove.h:156
void apply(T &result, const process_initializer &x)
Definition remove.h:149
void update(std::set< data::variable > &x)
Removes parameters from a set container.
Definition remove.h:73
const std::set< data::variable > & to_be_removed
Definition remove.h:65
void apply(atermpp::term_list< T > &result, const data::variable_list &x)
Removes parameters from a list of variables.
Definition remove.h:83
void update(linear_process &x)
Removes parameters from a linear_process.
Definition remove.h:111
data::data_expression_list remove_expressions(const data::data_expression_list &e)
Removes expressions from e at the corresponding positions of process_parameters.
Definition remove.h:130
void update(stochastic_specification &x)
Removes parameters from a linear process specification.
Definition remove.h:175
void update(specification &x)
Removes parameters from a linear process specification.
Definition remove.h:166
remove_parameters_builder(const std::set< data::variable > &to_be_removed_)
Definition remove.h:68
void update(stochastic_linear_process &x)
Removes parameters from a linear_process.
Definition remove.h:121
Options for linearisation.
Definition linearise.h:25
\brief Builder class
Definition builder.h:476
bool operator()(const core::identifier_string &s1, const core::identifier_string &s2) const
void apply(T &result, const process::process_equation &x)
Definition builder.h:405
void apply(T &result, const process::rename &x)
Definition builder.h:487
void apply(T &result, const process::left_merge &x)
Definition builder.h:567
void apply(T &result, const process::bounded_init &x)
Definition builder.h:551
void apply(T &result, const process::process_expression &x)
Definition builder.h:599
void apply(T &result, const process::block &x)
Definition builder.h:471
void apply(T &result, const process::merge &x)
Definition builder.h:559
void apply(T &result, const process::sync &x)
Definition builder.h:511
void apply(T &result, const process::choice &x)
Definition builder.h:575
void apply(T &result, const process::if_then &x)
Definition builder.h:535
void apply(T &result, const process::action &x)
Definition builder.h:421
void apply(T &result, const process::delta &x)
Definition builder.h:445
void apply(T &result, const process::process_instance_assignment &x)
Definition builder.h:437
void apply(T &result, const process::untyped_process_assignment &x)
Definition builder.h:591
void apply(T &result, const process::stochastic_operator &x)
Definition builder.h:583
void update(process::process_specification &x)
Definition builder.h:394
void apply(T &result, const process::allow &x)
Definition builder.h:503
void apply(T &result, const process::at &x)
Definition builder.h:519
void apply(T &result, const process::sum &x)
Definition builder.h:463
void apply(T &result, const process::seq &x)
Definition builder.h:527
void apply(T &result, const process::tau &x)
Definition builder.h:454
void apply(T &result, const process::comm &x)
Definition builder.h:495
void apply(T &result, const process::untyped_multi_action &x)
Definition builder.h:413
void apply(T &result, const process::hide &x)
Definition builder.h:479
void apply(T &result, const process::if_then_else &x)
Definition builder.h:543
void apply(T &result, const process::process_instance &x)
Definition builder.h:429
void apply(T &result, const process::sync &x)
Definition builder.h:1160
void apply(T &result, const process::rename &x)
Definition builder.h:1136
void apply(T &result, const process::if_then_else &x)
Definition builder.h:1192
void apply(T &result, const process::process_equation &x)
Definition builder.h:1059
void apply(T &result, const process::bounded_init &x)
Definition builder.h:1200
void apply(T &result, const process::at &x)
Definition builder.h:1168
void apply(T &result, const process::if_then &x)
Definition builder.h:1184
void apply(T &result, const process::choice &x)
Definition builder.h:1224
void apply(T &result, const process::tau &x)
Definition builder.h:1103
void apply(T &result, const process::merge &x)
Definition builder.h:1208
void apply(T &result, const process::left_merge &x)
Definition builder.h:1216
void apply(T &result, const process::sum &x)
Definition builder.h:1112
void apply(T &result, const process::seq &x)
Definition builder.h:1176
void apply(T &result, const process::untyped_process_assignment &x)
Definition builder.h:1240
void apply(T &result, const process::block &x)
Definition builder.h:1120
void apply(T &result, const process::allow &x)
Definition builder.h:1152
void apply(T &result, const process::action &x)
Definition builder.h:1067
void apply(T &result, const process::hide &x)
Definition builder.h:1128
void apply(T &result, const process::process_expression &x)
Definition builder.h:1249
void apply(T &result, const process::process_instance_assignment &x)
Definition builder.h:1085
void apply(T &result, const process::comm &x)
Definition builder.h:1144
void apply(T &result, const process::delta &x)
Definition builder.h:1094
void apply(T &result, const process::process_instance &x)
Definition builder.h:1076
void update(process::process_specification &x)
Definition builder.h:1048
void apply(T &result, const process::stochastic_operator &x)
Definition builder.h:1232
void apply(T &result, const process::process_expression &x)
Definition builder.h:1574
void apply(T &result, const process::process_identifier &x)
Definition builder.h:1377
void apply(T &result, const process::process_instance &x)
Definition builder.h:1403
void apply(T &result, const process::delta &x)
Definition builder.h:1419
void apply(T &result, const process::process_instance_assignment &x)
Definition builder.h:1411
void apply(T &result, const process::stochastic_operator &x)
Definition builder.h:1557
void apply(T &result, const process::choice &x)
Definition builder.h:1549
void apply(T &result, const process::at &x)
Definition builder.h:1493
void apply(T &result, const process::merge &x)
Definition builder.h:1533
void apply(T &result, const process::if_then &x)
Definition builder.h:1509
void apply(T &result, const process::comm &x)
Definition builder.h:1469
void apply(T &result, const process::process_equation &x)
Definition builder.h:1386
void apply(T &result, const process::left_merge &x)
Definition builder.h:1541
void apply(T &result, const process::sync &x)
Definition builder.h:1485
void apply(T &result, const process::tau &x)
Definition builder.h:1428
void update(process::process_specification &x)
Definition builder.h:1366
void apply(T &result, const process::hide &x)
Definition builder.h:1453
void apply(T &result, const process::if_then_else &x)
Definition builder.h:1517
void apply(T &result, const process::untyped_process_assignment &x)
Definition builder.h:1565
void apply(T &result, const process::rename &x)
Definition builder.h:1461
void apply(T &result, const process::seq &x)
Definition builder.h:1501
void apply(T &result, const process::block &x)
Definition builder.h:1445
void apply(T &result, const process::sum &x)
Definition builder.h:1437
void apply(T &result, const process::bounded_init &x)
Definition builder.h:1525
void apply(T &result, const process::action &x)
Definition builder.h:1394
void apply(T &result, const process::allow &x)
Definition builder.h:1477
void update(process::process_specification &x)
Definition builder.h:59
void apply(T &result, const process::sync &x)
Definition builder.h:188
void apply(T &result, const process::choice &x)
Definition builder.h:252
void apply(T &result, const process::process_instance_assignment &x)
Definition builder.h:114
void apply(T &result, const process::process_instance &x)
Definition builder.h:106
void apply(T &result, const process::merge &x)
Definition builder.h:236
void apply(T &result, const process::seq &x)
Definition builder.h:204
void apply(T &result, const process::if_then &x)
Definition builder.h:212
void apply(T &result, const process::untyped_multi_action &x)
Definition builder.h:90
void apply(T &result, const process::stochastic_operator &x)
Definition builder.h:260
void apply(T &result, const process::action &x)
Definition builder.h:98
void apply(T &result, const process::delta &x)
Definition builder.h:122
void apply(T &result, const process::if_then_else &x)
Definition builder.h:220
void apply(T &result, const process::left_merge &x)
Definition builder.h:244
void apply(T &result, const process::process_equation &x)
Definition builder.h:82
void apply(T &result, const process::hide &x)
Definition builder.h:156
void apply(T &result, const process::allow &x)
Definition builder.h:180
void apply(T &result, const process::rename &x)
Definition builder.h:164
void apply(T &result, const process::comm &x)
Definition builder.h:172
void apply(T &result, const process::sum &x)
Definition builder.h:140
void apply(T &result, const process::bounded_init &x)
Definition builder.h:228
void apply(T &result, const process::action_label &x)
Definition builder.h:52
void apply(T &result, const process::block &x)
Definition builder.h:148
void apply(T &result, const process::at &x)
Definition builder.h:196
void apply(T &result, const process::tau &x)
Definition builder.h:131
void apply(T &result, const process::process_identifier &x)
Definition builder.h:74
void apply(T &result, const process::process_expression &x)
Definition builder.h:276
void apply(T &result, const process::untyped_process_assignment &x)
Definition builder.h:268
void apply(T &result, const process::process_instance &x)
Definition builder.h:760
void apply(T &result, const process::choice &x)
Definition builder.h:906
void apply(T &result, const process::sync &x)
Definition builder.h:842
void apply(T &result, const process::sum &x)
Definition builder.h:794
void apply(T &result, const process::stochastic_operator &x)
Definition builder.h:914
void apply(T &result, const process::untyped_process_assignment &x)
Definition builder.h:922
void apply(T &result, const process::allow &x)
Definition builder.h:834
void apply(T &result, const process::bounded_init &x)
Definition builder.h:882
void apply(T &result, const process::comm &x)
Definition builder.h:826
void apply(T &result, const process::block &x)
Definition builder.h:802
void apply(T &result, const process::tau &x)
Definition builder.h:785
void apply(T &result, const process::action &x)
Definition builder.h:752
void apply(T &result, const process::left_merge &x)
Definition builder.h:898
void apply(T &result, const process::untyped_multi_action &x)
Definition builder.h:744
void apply(T &result, const process::merge &x)
Definition builder.h:890
void apply(T &result, const process::seq &x)
Definition builder.h:858
void apply(T &result, const process::delta &x)
Definition builder.h:776
void apply(T &result, const process::hide &x)
Definition builder.h:810
void apply(T &result, const process::at &x)
Definition builder.h:850
void apply(T &result, const process::process_identifier &x)
Definition builder.h:728
void apply(T &result, const process::if_then_else &x)
Definition builder.h:874
void update(process::process_specification &x)
Definition builder.h:716
void apply(T &result, const process::process_equation &x)
Definition builder.h:736
void apply(T &result, const process::process_instance_assignment &x)
Definition builder.h:768
void apply(T &result, const process::rename &x)
Definition builder.h:818
void apply(T &result, const process::if_then &x)
Definition builder.h:866
void apply(T &result, const process::process_expression &x)
Definition builder.h:930
Base builder class for processes.
Definition builder.h:25
void apply(T &result, const data::untyped_data_parameter &x)
Definition builder.h:30
\brief Builder class
Definition builder.h:1033
make_substitution(const std::map< process_identifier, process_identifier > &map)
process_identifier operator()(const process_identifier &id) const
const std::map< process_identifier, process_identifier > & m_map
std::size_t operator()(const mcrl2::lps::multi_action &ma) const
std::size_t operator()(const mcrl2::process::action &t) const