|
mCRL2
|
information about a transition sorted per target state More...
#include <liblts_bisim_dnj.h>
Public Member Functions | |
| template<class LTS_TYPE > | |
| std::string | debug_id_short (const bisim_partitioner_dnj< LTS_TYPE > &partitioner) const |
| print a short transition identification for debugging | |
| template<class LTS_TYPE > | |
| std::string | debug_id (const bisim_partitioner_dnj< LTS_TYPE > &partitioner) const |
| print a transition identification for debugging | |
Public Attributes | |
| action_block_entry * | action_block = nullptr |
| circular iterator to link the four transition arrays | |
| state_info_entry * | source = nullptr |
| source state of the transition | |
| state_info_entry * | target = nullptr |
| target state of the transition | |
| check_complexity::trans_dnj_counter_t | work_counter |
information about a transition sorted per target state
As I expect the transitions in this array to be moved least often, I store the information on source and target state in this entry. (It could be stored in any of the four arrays describing the transition; through the circular iterators, the information would be available anyway.)
Definition at line 856 of file liblts_bisim_dnj.h.
|
inline |
print a transition identification for debugging
Definition at line 879 of file liblts_bisim_dnj.h.
|
inline |
print a short transition identification for debugging
Definition at line 870 of file liblts_bisim_dnj.h.
| action_block_entry* mcrl2::lts::detail::bisim_dnj::pred_entry::action_block = nullptr |
circular iterator to link the four transition arrays
Definition at line 860 of file liblts_bisim_dnj.h.
| state_info_entry* mcrl2::lts::detail::bisim_dnj::pred_entry::source = nullptr |
source state of the transition
Definition at line 863 of file liblts_bisim_dnj.h.
| state_info_entry* mcrl2::lts::detail::bisim_dnj::pred_entry::target = nullptr |
target state of the transition
Definition at line 866 of file liblts_bisim_dnj.h.
|
mutable |
Definition at line 897 of file liblts_bisim_dnj.h.