A timed automaton.
More...
#include <timed_automaton.hh>
|
void | deepCopy (TimedAutomaton &dest, std::unordered_map< TAState *, std::shared_ptr< TAState >> &old2new) const |
| make a deep copy of this timed automaton. More...
|
|
size_t | clockSize () const |
| Returns the number of clock variables used in the timed automaton.
|
|
bool | isMember (const std::vector< std::pair< Alphabet, double >> &w) const |
| solve membership problem for observable timed automaton More...
|
|
std::size_t | stateSize () const |
| Returns the number of the states.
|
|
bool | operator== (const Automaton< TAState > A) const |
|
|
std::vector< int > | maxConstraints |
| The maximum constraints for each clock variables.
|
|
std::vector< std::shared_ptr< TAState > > | states |
| The states of this automaton.
|
|
std::vector< std::shared_ptr< TAState > > | initialStates |
| The initial states of this automaton.
|
|
◆ deepCopy()
make a deep copy of this timed automaton.
- Parameters
-
[out] | dest | The destination of the deep copy. |
[out] | old2new | The mapping from the original state to the corresponding new state. |
◆ isMember()
bool TimedAutomaton::isMember |
( |
const std::vector< std::pair< Alphabet, double >> & |
w | ) |
const |
|
inline |
solve membership problem for observable timed automaton
- Note
- This is only for testing.
-
If there are epsilon transitions, this does not work.
The documentation for this struct was generated from the following file: