#include <tgbaalgos/gtec/gtec.hh>
Inheritance diagram for spot::emptiness_check_shy:
Public Member Functions | |
emptiness_check_shy (const tgba *a, const numbered_state_heap_factory *nshf=numbered_state_heap_hash_map_factory::instance()) | |
virtual | ~emptiness_check_shy () |
virtual bool | check () |
Check whether the automaton's language is empty. | |
const emptiness_check_status * | result () const |
Return the status of the emptiness-check. | |
Protected Types | |
typedef std::list< successor > | succ_queue |
typedef std::pair< const state *, succ_queue > | pair_state_successors |
Protected Member Functions | |
virtual int * | find_state (const state *s) |
find the SCC number of a unprocessed state. | |
void | remove_component (const state *start_delete) |
Remove a strongly component from the hash. | |
Protected Attributes | |
std::stack< bdd > | arc |
int | num |
std::stack< pair_state_successors > | todo |
emptiness_check_status * | ecs_ |
See the documentation for spot::emptiness_check
|
|
|
|
|
|
|
|
|
Check whether the automaton's language is empty.
Reimplemented from spot::emptiness_check.
|
|
find the SCC number of a unprocessed state. Sometimes we want to modify some of the above structures when looking up a new state. This happens for instance when find() must perform inclusion checking and add new states to process to TODO during this step. (Because TODO must be known, sub-classing spot::numbered_state_heap is not enough.) Then overriding this method is the way to go. |
|
Remove a strongly component from the hash. This function remove all accessible state from a given state. In other words, it removes the strongly connected component that contains this state. |
|
Return the status of the emptiness-check. When check() succeed, the status should be passed along to spot::counter_example. This status should not be deleted, it is a pointer to a member of this class that will be deleted when the emptiness_check object is deleted. |
|
|
|
|
|
|
|
|