#include <tgbaalgos/gtec/ce.hh>
Inheritance diagram for spot::couvreur99_check_result:
Public Member Functions | |
couvreur99_check_result (const couvreur99_check_status *ecs) | |
virtual tgba_run * | accepting_run () |
Return a run accepted by the automata passed to the emptiness check. | |
void | print_stats (std::ostream &os) const |
virtual int | acss_states () const |
Number of states in the search space for the accepting cycle. | |
const tgba * | automaton () const |
The automaton on which an accepting_run() was found. | |
void | inc_ars_prefix_states () |
int | ars_prefix_states () const |
void | inc_ars_cycle_states () |
int | ars_cycle_states () const |
Protected Member Functions | |
void | accepting_cycle () |
Protected Attributes | |
const tgba * | a_ |
The automaton. | |
Private Attributes | |
const couvreur99_check_status * | ecs_ |
tgba_run * | run_ |
|
|
|
Called by accepting_run() to find a cycle which traverses all acceptance conditions in the accepted SCC. |
|
Return a run accepted by the automata passed to the emptiness check. This method might actually compute the acceptance run. (Not all emptiness check algorithms actually produce a counter-example as a side-effect of checking emptiness, some need some post-processing.) This can also return 0 if the emptiness check algorithm cannot produce a counter example (that does not mean there is no counter-example; the mere existence of an instance of this class asserts the existence of a counter-example). Reimplemented from spot::emptiness_check_result. |
|
Number of states in the search space for the accepting cycle.
Implements spot::acss_statistics. |
|
|
|
|
|
The automaton on which an accepting_run() was found.
|
|
|
|
|
|
|
|
The automaton.
|
|
|
|
|