spot
0.8.1
|
#include <tgbaalgos/scc.hh>
Public Member Functions | |
scc (int index) | |
Public Attributes | |
int | index |
Index of the SCC. | |
bdd | acc |
std::list< const state * > | states |
States of the component. | |
cond_set | conds |
Set of conditions used in the SCC. | |
bdd | supp |
Conjunction of atomic propositions used in the SCC. | |
bdd | supp_rec |
Conjunction of atomic propositions used in the SCC. | |
succ_type | succ |
Successor SCC. | |
bool | trivial |
Trivial SCC have one state and no self-loops. | |
bdd | useful_acc |
Set of acceptance combinations used in the SCC. |
spot::scc_map::scc::scc | ( | int | index | ) | [inline] |
The union of all acceptance conditions of transitions which connect the states of the connected component.
Set of conditions used in the SCC.
Index of the SCC.
std::list<const state*> spot::scc_map::scc::states |
States of the component.
Successor SCC.
Conjunction of atomic propositions used in the SCC.
Conjunction of atomic propositions used in the SCC.
Trivial SCC have one state and no self-loops.
Set of acceptance combinations used in the SCC.
Note that the encoding used here differs from the encoding used in automata. If some transitions of the automaton are labeled by Acc[a]&!Acc[b]&!Acc[c] | !Acc[a]&Acc[b]&!Acc[c] an other transitions are labeled by !Acc[a]&Acc[b]&!Acc[c] | !Acc[a]&!Acc[b]&Acc[c] then useful_acc will contain Acc[a]&Acc[b]&!Acc[c] | !Acc[a]&Acc[b]&Acc[c]