#include <ce.hh>
Collaboration diagram for spot::counter_example:
Public Types | |
typedef std::pair< const state *, bdd > | state_proposition |
typedef std::list< const state * > | state_sequence |
typedef std::list< state_proposition > | cycle_path |
Public Member Functions | |
counter_example (const emptiness_check_status *ecs, const explicit_connected_component_factory *eccf=connected_component_hash_set_factory::instance()) | |
std::ostream & | print_result (std::ostream &os, const tgba *restrict=0) const |
Display the example computed by counter_example(). | |
void | print_stats (std::ostream &os) const |
Output statistics about this object. | |
Public Attributes | |
state_sequence | suffix |
cycle_path | period |
Protected Member Functions | |
void | accepting_path (const explicit_connected_component *scc, const state *start, bdd acc_to_traverse) |
void | complete_cycle (const explicit_connected_component *scc, const state *from, const state *to) |
Private Attributes | |
const emptiness_check_status * | ecs_ |
|
|
|
|
|
|
|
|
|
Called by counter_example to find a path which traverses all acceptance conditions in the accepted SCC. |
|
Complete a cycle that caraterise the period of the counter example. Append a sequence to the path given by accepting_path. |
|
Display the example computed by counter_example().
|
|
Output statistics about this object.
|
|
|
|
|
|
|