Main Page
|
Modules
|
Namespace List
|
Class Hierarchy
|
Class List
|
Directories
|
File List
|
Namespace Members
|
Class Members
|
File Members
spot Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
spot::acss_statistics
Accepting Cycle Search Space statistics
spot::ars_statistics
Accepting Run Search statistics
spot::ltl::atomic_prop
Atomic propositions
spot::barand< gen >
Compute pseudo-random integer value between 0 and
n
included, following a binomial distribution for probability
p
spot::bdd_allocator
Manage ranges of variables
spot::bdd_dict
spot::bdd_dict::annon_free_list
spot::bdd_less_than
Comparison functor for BDDs
spot::bfs_steps
Make a BFS in a
spot::tgba
to compute a
tgba_run::steps
spot::ltl::binop
Binary operator
spot::ltl::clone_visitor
Clone a formula
spot::connected_component_hash_set
spot::connected_component_hash_set_factory
Factory for
connected_component_hash_set
spot::ltl::const_visitor
Formula visitor that cannot modify the formula
spot::ltl::constant
A constant (True or False)
spot::couvreur99_check
Check whether the language of an automate is empty
spot::couvreur99_check_result
Compute a counter example from a
spot::couvreur99_check_status
spot::couvreur99_check_shy
A version of
spot::couvreur99_check
that tries to visit known states first
spot::couvreur99_check_shy::successor
spot::couvreur99_check_shy::todo_item
spot::couvreur99_check_status
The status of the emptiness-check on success
spot::ltl::declarative_environment
A declarative environment
spot::ltl::default_environment
A laxist environment
spot::delayed_simulation_relation
spot::direct_simulation_relation
spot::dotty_decorator
Choose state and link styles for
spot::dotty_reachable
spot::duplicator_node
Duplicator node of parity game graph
spot::duplicator_node_delayed
Duplicator node of parity game graph for delayed simulation
spot::ec_statistics
Emptiness-check statistics
spot::emptiness_check
Common interface to emptiness check algorithms
spot::emptiness_check_result
The result of an emptiness check
spot::ltl::environment
An environment that describes atomic propositions
spot::evtgba
spot::evtgba_explicit
spot::evtgba_explicit::state
spot::evtgba_explicit::transition
Explicit transitions (used by
spot::evtgba_explicit
)
spot::evtgba_iterator
spot::evtgba_product
spot::evtgba_reachable_iterator
Iterate over all reachable states of a
spot::evtgba
spot::evtgba_reachable_iterator_breadth_first
An implementation of
spot::evtgba_reachable_iterator
that browses states breadth first
spot::evtgba_reachable_iterator_depth_first
An implementation of
spot::evtgba_reachable_iterator
that browses states depth first
spot::explicit_connected_component
An SCC storing all its states explicitly
spot::explicit_connected_component_factory
Abstract factory for
explicit_connected_component
spot::ltl::formula
An LTL formula
spot::ltl::formula_ptr_hash
Hash Function for
const formula*
spot::ltl::formula_ptr_less_than
Strict Weak Ordering for
const formula*
spot::free_list
Manage list of free integers
spot::gspn_exeption
An exeption used to forward GSPN errors
spot::gspn_interface
spot::gspn_ssp_interface
yy::Location
Abstract a
Location
spot::loopless_modular_mixed_radix_gray_code
Loopless modular mixed radix Gray code iteration
spot::minato_isop
Generate an irredundant sum-of-products (ISOP) form of a BDD function
spot::minato_isop::local_vars
Internal variables for
minato_isop
spot::ltl::multop
Multi-operand operators
spot::ltl::multop::paircmp
Comparison functor used internally by
ltl::multop
spot::numbered_state_heap
Keep track of a large quantity of indexed states
spot::numbered_state_heap_const_iterator
Iterator on
numbered_state_heap
objects
spot::numbered_state_heap_factory
Abstract factory for
numbered_state_heap
spot::numbered_state_heap_hash_map
A straightforward implementation of
numbered_state_heap
with a hash map
spot::numbered_state_heap_hash_map_factory
Factory for
numbered_state_heap_hash_map
spot::parity_game_graph
Parity game graph which compute a simulation relation
spot::parity_game_graph_delayed
spot::parity_game_graph_direct
Parity game graph which compute the direct simulation relation
yy::Position
Abstract a
Position
spot::ltl::postfix_visitor
Apply an algorithm on each node of an AST, during a postfix traversal
spot::ptr_hash< T >
A hash function for pointers
spot::ltl::random_ltl
Generate random LTL formulae
spot::ltl::random_ltl::op_proba
spot::ltl::ref_formula
A reference-counted LTL formula
spot::rsymbol
spot::scc_stack
spot::scc_stack::connected_component
spot::ltl::simplify_f_g_visitor
Replace
true U f
and
false R g
by
F f
and
G g
yy::Slice< T, S >
spot::spoiler_node
Spoiler node of parity game graph
spot::spoiler_node_delayed
Spoiler node of parity game graph for delayed simulation
yy::Stack< T, S >
spot::state
Abstract class for states
spot::state_bdd
spot::state_evtgba_explicit
States used by spot::tgba_evtgba_explicit
spot::state_explicit
spot::state_product
A state for
spot::tgba_product
spot::state_ptr_equal
An Equivalence Relation for
state*
spot::state_ptr_hash
Hash Function for
state*
spot::state_ptr_less_than
Strict Weak Ordering for
state*
spot::string_hash
A hash function for strings
spot::symbol
spot::tgba
A Transition-based Generalized Büchi Automaton
spot::tgba_bdd_concrete
A concrete
spot::tgba
implemented using BDDs
spot::tgba_bdd_concrete_factory
Helper class to build a
spot::tgba_bdd_concrete
object
spot::tgba_bdd_core_data
Core data for a TGBA encoded using BDDs
spot::tgba_bdd_factory
Abstract class for
spot::tgba_bdd_concrete
factories
spot::tgba_explicit
spot::tgba_explicit::transition
Explicit transitions (used by
spot::tgba_explicit
)
spot::tgba_explicit_succ_iterator
spot::tgba_product
A lazy product. (States are computed on the fly.)
spot::tgba_reachable_iterator
Iterate over all reachable states of a
spot::tgba
spot::tgba_reachable_iterator_breadth_first
An implementation of
spot::tgba_reachable_iterator
that browses states breadth first
spot::tgba_reachable_iterator_depth_first
An implementation of
spot::tgba_reachable_iterator
that browses states depth first
spot::tgba_reduc
spot::tgba_run
An accepted run, for a tgba
spot::tgba_run::step
spot::tgba_run_dotty_decorator
Highlight a
spot::tgba_run
on a
spot::tgba
spot::tgba_sba_proxy
Degeneralize a
spot::tgba
on the fly, producing an SBA
spot::tgba_statistics
spot::tgba_succ_iterator
Iterate over the successors of a state
spot::tgba_succ_iterator_concrete
spot::tgba_succ_iterator_product
Iterate over the successors of a product computed on the fly
spot::tgba_tba_proxy
Degeneralize a
spot::tgba
on the fly, producing a TBA
spot::time_info
A structure to record elapsed time in clock ticks
spot::timer
A timekeeper that accumulate interval of time
spot::timer_map
A map of timer, where each timer has a name
spot::ltl::unabbreviate_logic_visitor
Clone and rewrite a formula to remove most of the abbreviated logical operators
spot::ltl::unabbreviate_ltl_visitor
Clone and rewrite a formula to remove most of the abbreviated LTL and logical operators
spot::ltl::unop
Unary operators
spot::ltl::visitor
Formula visitor that can modify the formula
spot::weight
Manage for a given automaton a vector of counter indexed by its acceptance condition
Please
comment
this page and
report errors
about it on
the RefDocComments page
.
Generated on Mon Jan 31 12:55:19 2005 for spot by
1.4.0