Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 Cfaudes::AttributeSignalOutput::Action
 Cfaudes::adjlist
 Cfaudes::Token::AttributeValue
 Cfaudes::AutoRegisterType< T >
 Cfaudes::AutoRegisterXElementTag< T >
 Cfaudes::Bisimulation
 Cfaudes::BisimulationCTAThe Bisimulation class The following class implements a basic normal bisimulation partition algorithms and derives a class for partitioning w.r.t. delayed bisimulation and weak bisimulation . All these algorithms are introduced in "Computing Maximal Weak and Other Bisimulations" from Alexandre Boulgakov et. al. (2016). The utilised normal bisimulation algorithm originates from the "change tracking algorithm" from Stefan Blom and Simona Orzan (see ref. of cited paper). Besides, the current paper uses topological sorted states to avoid computing saturated transitions explicitly when computing delayed and weak bisimulation
 Cfaudes::Candidate
 Cfaudes::nDevice::ClientState
 Cfaudes::CompVerify
 Cfaudes::ComSyn
 Cfaudes::ConsoleOut
 Cstd::set::const_iterator
 Cfaudes::SampledDensityFunction::CountEntry
 Cfaudes::CoVerifierState
 Cfaudes::DiscreteDensityFunction
 Cfaudes::sDevice::Edges
 Cfaudes::ElemConstraint
 Cfaudes::vBaseVector::ElementRecord
 Cfaudes::DiscreteDensityFunction::Entry
 Cfaudes::TransSort::EvX1X2
 Cfaudes::TransSort::EvX2X1
 Cstd::exception
 Cfaudes::HioModule
 Cfaudes::Hopcroft
 Cfaudes::mbDevice::IoRange
 CTGraph::iterator
 CTNode::iterator
 Cfaudes::sDevice::Levels
 CLiteratureRecord
 Cfaudes::TokenReader::LState
 Cfaudes::LuaState
 Cstd::map
 Cfaudes::MCtrlPattern
 Cfaudes::adjlist::node
 Cfaudes::node_entry_t< VLabel, ELabel >
 Cfaudes::ObjectCount
 Cfaudes::OPSState
 Cfaudes::OPState
 CPageRecord
 Cfaudes::Parameter
 Cfaudes::Pnode
 Cfaudes::ReductionStateInfo
 Cfaudes::SOE::Relation
 Cfaudes::SccFilter
 Cfaudes::nDevice::ServerState
 Cstd::set
 Cfaudes::SimEventCondition
 Cfaudes::SimplenetAddress
 Cfaudes::SimPriorityEventAttribute
 Cfaudes::SimStateCondition
 Cfaudes::SimStochasticEventAttribute
 CSmain
 Cfaudes::SmallSize
 Cfaudes::SNOState
 Cfaudes::SOE
 Cfaudes::Bisimulation::State
 Cfaudes::BisimulationCTA::State
 Cfaudes::Hopcroft::State
 Cfaudes::SOE::State
 Cfaudes::TopoSort::State
 Cfaudes::swig_cast_info
 Cfaudes::swig_lua_userdata
 Cfaudes::swig_type_info
 Cfaudes::SynchCandidates
 CTaEventSet
 Cfaudes::TAttrMap< T, Attr, Cmp >
 Cfaudes::TAttrMap< Idx, Attr >
 Cfaudes::TAttrMap< Transition, Attr, TransSort::X1EvX2 >
 Cfaudes::Time
 Cfaudes::TimeConstraint
 Cfaudes::TimedEvent
 Cfaudes::Executor::TimedState
 Cfaudes::TimeInterval
 Cfaudes::Token
 Cfaudes::TokenReader
 Cfaudes::TokenWriter
 Cfaudes::TopoSortThe TopoSort class perform a topological sort on states of a given automaton. if s1 is before s2 in the sort then there is no path from s2 to s1. The algorithm can be found in https://en.wikipedia.org/wiki/Topological_sorting under depth-first search, which is considered as first invented by R. Tarjan in 1976
 Cfaudes::LoggingExecutor::TraceSample
 Cfaudes::Transition
 Cfaudes::TransSort
 Cfaudes::AttributeSignalInput::Trigger
 Cfaudes::Type
 Cfaudes::VerifierState
 Cfaudes::TransSort::X1EvX2
 Cfaudes::TransSort::X1X2Ev
 Cfaudes::TransSort::X2EvX1
 Cfaudes::TransSort::X2X1Ev

libFAUDES 2.33b --- 2025.05.07 --- c++ api documentaion by doxygen