dddmp |
7 | Functions to read in and write out BDDs, ADDs 8 | | 9 |
| 8 | Programmer view | 9 |10 | Maintainer by function | 11 |12 | Maintainer by file | 13 |
| 8 | Programmer view | 9 |10 | Maintainer by function | 11 |12 | Maintainer by file | 13 |
| 7 | Command Documentation | 8 |9 | Package Documentation | 10 |Generated by 11 | the Ext system | 12 | 13 |
Bnet_BuildNodeBDD()
13 | Bnet_DfsVariableOrder()
16 | Bnet_FreeNetwork()
19 | Bnet_PrintNetwork()
22 | Bnet_PrintOrder()
25 | Bnet_ReadNetwork()
28 | Bnet_ReadOrder()
31 | Bnet_bddArrayDump()
34 | Bnet_bddDump()
37 | extdoc on 1010215
44 |
45 |
46 |
--------------------------------------------------------------------------------
/legacy-deps/pycudd2.0.2/cudd-2.4.2/nanotrav/doc/bnetExtAbs.html:
--------------------------------------------------------------------------------
1 |
2 | Bnet_BuildNodeBDD()
13 | Bnet_DfsVariableOrder()
16 | Bnet_FreeNetwork()
19 | Bnet_PrintNetwork()
22 | Bnet_PrintOrder()
25 | Bnet_ReadNetwork()
28 | Bnet_ReadOrder()
31 | Bnet_bddArrayDump()
34 | Bnet_bddDump()
37 | extdoc on 1010215
44 |
45 |
46 |
--------------------------------------------------------------------------------
/bymc/src/schemaOpt.mli:
--------------------------------------------------------------------------------
1 | (**
2 | Various options that control the behaviour of schema checkers.
3 |
4 | Igor Konnov, 2016
5 | *)
6 |
7 | (** is the solver working in the incremental mode? *)
8 | val is_incremental: unit -> bool
9 | (** set the solver to the incremental mode *)
10 | val set_incremental: bool -> unit
11 |
12 | (** is the control flow optimization enabled? *)
13 | val is_flow_opt_enabled: unit -> bool
14 | (** is the reachability optimization enabled *)
15 | val is_reach_opt_enabled: unit -> bool
16 | (** is the adaptive reachability optimization enabled *)
17 | val is_adaptive_reach_opt_enabled: unit -> bool
18 |
19 | (** enable/disable the control flow optimization *)
20 | val set_flow_opt: bool -> unit
21 | (** enable/disable the reachability optimization *)
22 | val set_reach_opt: bool ->unit
23 | (** enable/disable the reachability optimization *)
24 | val set_adaptive_reach_opt: bool -> unit
25 |
26 | (** how often to try to switch between the reachability
27 | and non-reachability optimizations (in the adaptive mode) *)
28 | val get_ada_reach_adapt_after: unit -> int
29 | (** set the number of rounds to wait before switching reachability on/off *)
30 | val set_ada_reach_adapt_after: int -> unit
31 |
32 | (** do we associate a predicate with every guard when switching contexts?
33 | (see BUGFIX-20160628)
34 | *)
35 | val use_guard_predicates: unit -> bool
36 | (** associate a predicate with every guard when switching a context *)
37 | val set_use_guard_predicates: bool -> unit
38 |
39 | (** is the total number of schemas always computed,
40 | even if there are too many (default: no) *)
41 | val is_always_compute_nschemas: unit -> bool
42 |
43 | (* enable/disable computation of the number of schemas *)
44 | val set_always_compute_nschemas: bool -> unit
45 |
46 |
--------------------------------------------------------------------------------
/legacy-deps/pycudd2.0.2/pycudd/tlcinfo.i:
--------------------------------------------------------------------------------
1 | %{
2 | #ifndef FROM_PYCUDDI
3 | #error Use only from pycudd.i. Make sure to define FROM_PYCUDDI!
4 | #endif
5 | %}
6 |
7 | // Return the clauses as (valid?, (var1,phase1), (var2,phase2))
8 | %typemap (argout) (DdHalfWord *dum_var1, DdHalfWord *dum_var2, int *dum_phase1, int *dum_phase2) {
9 | PyObject *o, *o2, *o3;
10 | o2 = $result;
11 | $result = PyTuple_New(3);
12 | PyTuple_SetItem($result,0,o2);
13 |
14 | o3 = PyTuple_New(2);
15 | if (*$1 == CUDD_MAXINDEX) o = PyInt_FromLong(-1);
16 | else o = PyInt_FromLong(*$1);
17 | PyTuple_SetItem(o3,0,o);
18 | o = PyInt_FromLong(*$3);
19 | PyTuple_SetItem(o3,1,o);
20 | PyTuple_SetItem($result,1,o3);
21 |
22 | o3 = PyTuple_New(2);
23 | if (*$2 == CUDD_MAXINDEX) o = PyInt_FromLong(-1);
24 | else o = PyInt_FromLong(*$2);
25 | PyTuple_SetItem(o3,0,o);
26 | o = PyInt_FromLong(*$4);
27 | PyTuple_SetItem(o3,1,o);
28 | PyTuple_SetItem($result,2,o3);
29 |
30 | Py_DECREF(o2);
31 | }
32 |
33 |
34 | %typemap(in,numinputs=0) DdHalfWord *dum_var1 (DdHalfWord dv1) {
35 | $1 = &dv1;
36 | }
37 |
38 | %typemap(in,numinputs=0) DdHalfWord *dum_var2 (DdHalfWord dv2) {
39 | $1 = &dv2;
40 | }
41 |
42 | struct DdTlcInfo { };
43 |
44 | %extend DdTlcInfo {
45 | %pythoncode %{
46 | __doc__ = "Helper class for enumeration of two literal clauses. Look at example2.py for usage."
47 | %}
48 | DdTlcInfo() {
49 | return NULL;
50 | }
51 |
52 | ~DdTlcInfo() {
53 | Cudd_tlcInfoFree(self);
54 | }
55 | %apply int *OUTPUT { int * dum_phase1 }
56 | %apply int *OUTPUT { int * dum_phase2 }
57 | int ReadIthClause(int i, DdHalfWord *dum_var1, DdHalfWord *dum_var2, int *dum_phase1, int *dum_phase2) { return Cudd_ReadIthClause(self, i, dum_var1, dum_var2, dum_phase1, dum_phase2); }
58 | }
59 |
60 |
61 |
--------------------------------------------------------------------------------
/bymc/test/test2-4.pml:
--------------------------------------------------------------------------------
1 | /**
2 | * A parameterized model of the broadcast distributed algorithm
3 | * in the symbolic extension of Promela.
4 | *
5 | * Igor Konnov, Josef Widder, 2012
6 | */
7 |
8 | #define IT 0 /* the initial state */
9 | #define SE 1 /* the echo message sent */
10 | #define PC_SZ 4
11 |
12 | #define FALSE 0
13 | #define TRUE 1
14 |
15 | symbolic int N; /* the number of processes: correct + faulty */
16 | symbolic int T; /* the threshold */
17 | symbolic int F; /* the actual number of faulty processes */
18 |
19 | int nsnt;
20 |
21 | assume(N > 3);
22 | assume(F >= 0);
23 | assume(T >= 1);
24 | assume(N > 3 * T);
25 | assume(F <= T);
26 |
27 | atomic prec_unforg = all(Proc:pc == IT);
28 | atomic prec_init = all(Proc@end);
29 | atomic ex_acc = some(Proc:pc == SE);
30 | atomic in_transit = some(Proc:nrcvd < nsnt);
31 |
32 | active[N - F] proctype Proc() {
33 | byte pc = 0, next_pc = 0;
34 | int nrcvd = 0, next_nrcvd = 0;
35 |
36 | /* INIT */
37 | pc = IT;
38 |
39 | /* THE ALGORITHM */
40 | end: /* at some point there will be nothing to do */
41 | do
42 | :: atomic {
43 | if
44 | :: nrcvd < 1 -> next_nrcvd = nrcvd + 1;
45 | :: else -> next_nrcvd = nrcvd;
46 | fi;
47 | if
48 | :: pc == 0 -> next_pc = 1;
49 | :: pc == 1 -> next_pc = 2;
50 | :: pc == 2 -> next_pc = 3;
51 | :: pc == 3 -> next_pc = pc;
52 | fi;
53 | nsnt = next_nrcvd;
54 | pc = next_pc;
55 | nrcvd = next_nrcvd;
56 | next_pc = 0;
57 | next_nrcvd = 0;
58 | }
59 | od;
60 | }
61 |
62 | ltl fairness { []<>(!in_transit) }
63 | ltl unforg { []((prec_init && prec_unforg) -> []!ex_acc) }
64 |
65 |
--------------------------------------------------------------------------------
/legacy-deps/pycudd2.0.2/cudd-2.4.2/util/getopt.c:
--------------------------------------------------------------------------------
1 | /* LINTLIBRARY */
2 |
3 | #include . 38 | . 39 | . 40 | . 41 | . 42 | . 43 | . 44 | . 45 | . 46 | . 47 | . 48 | . 49 | . 50 | . 51 | . 52 | . 53 | . 54 | . 55 | . 56 | . 57 | . 58 | . 59 | . 60 | . 61 | . 62 | . 63 | . 64 | . 65 | . 66 | . 67 |68 |
. 79 | . 80 | . 81 | . 82 | . 83 | . 84 | . 85 | . 86 | . 87 | . 88 | . 89 | . 90 | . 91 | . 92 | . 93 | . 94 | . 95 | . 96 | . 97 | . 98 | . 99 | . 100 | . 101 | . 102 | . 103 | . 104 | . 105 | . 106 | . 107 | . 108 |109 |