Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 Cfaudes::AttributeSignalOutput::ActionTypedef for a single output action
 Cfaudes::adjlist
 Cfaudes::Token::AttributeValueAttribute value
 Cfaudes::AutoRegisterType< T >Auto register faudes-type with specified type name
 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::nDevice::ClientStateBackground: state of a connection to a client (shared)
 Cfaudes::ComSyn
 Cfaudes::ConsoleOutConsole Out
 Cstd::set::const_iterator
 Cfaudes::SampledDensityFunction::CountEntry
 Cfaudes::CoVerifierState
 Cfaudes::DiscreteDensityFunctionDensity Function
 Cfaudes::sDevice::EdgesBackground: type def for edge detection
 Cfaudes::ElemConstraintModel of an elementary clock constraint formula
 Cfaudes::vBaseVector::ElementRecordInternal entry data type
 Cfaudes::DiscreteDensityFunction::Entry
 Cfaudes::TransSort::EvX1X2Binary predicate for sorting transitions in order Ev, X1, X2
 Cfaudes::TransSort::EvX2X1Binary predicate for sorting transitions in order Ev, X2, X1
 Cstd::exception
 Cfaudes::HioModuleRecurring structure in hierarchies designed according to the I/O based DES framework
 Cfaudes::Hopcroft
 Cfaudes::mbDevice::IoRangeModbus address ranges
 CTGraph::iterator
 CTNode::iterator
 Cfaudes::sDevice::LevelsBackground: type def output values
 CLiteratureRecord
 Cfaudes::TokenReader::LStateState on entry of respective level
 Cfaudes::LuaStateWrapper class to maintain a Lua state
 Cstd::map
 Cfaudes::MCtrlPattern
 Cfaudes::adjlist::node
 Cfaudes::node_entry_t< VLabel, ELabel >A node-entry represents one edge
 Cfaudes::ObjectCountDebugging counter
 Cfaudes::OPSState
 Cfaudes::OPState
 CPageRecord
 Cfaudes::ParameterStructure to model a parameter type within the Signature of a Function
 Cfaudes::Pnode
 Cfaudes::ReductionStateInfoData structure for identifying states in the same coset for supervisor reduction
 Cfaudes::SOE::RelationRelation according to SOE in one block
 Cfaudes::SccFilterFilter for strictly connected components (SCC) search/compute routines
 Cfaudes::nDevice::ServerStateBackground: state of a connection to an event server (shared)
 Cstd::set
 Cfaudes::SimEventConditionDefining data of event based simulation condition
 Cfaudes::SimplenetAddressSimplenet node address
 Cfaudes::SimPriorityEventAttributeDefining data to prioritise events
 Cfaudes::SimStateConditionDefining data of state based simulation condition
 Cfaudes::SimStochasticEventAttributeDefining data of stochastic behaviour
 Cfaudes::SmallSize
 Cfaudes::SNOState
 Cfaudes::SOE
 Cfaudes::Bisimulation::State
 Cfaudes::BisimulationCTA::State
 Cfaudes::Hopcroft::StateInternal representation of reverse transition relation with consecutive indexed states and events
 Cfaudes::SOE::StateInternal representation of transition relation with consecutive indexed states and events
 Cfaudes::TopoSort::State
 Cfaudes::swig_cast_info
 Cfaudes::swig_lua_userdata
 Cfaudes::swig_type_info
 Cfaudes::TAttrMap< T, Attr, Cmp >Attribute interface for TBaseSet
 Cfaudes::TAttrMap< Idx, Attr >
 Cfaudes::TAttrMap< Transition, Attr, TransSort::X1EvX2 >
 Cfaudes::TimeType to represent time
 Cfaudes::TimeConstraintA TimeConstraint is a set of elementary clock constraints
 Cfaudes::TimedEventGlobal Tyoedefs
 Cfaudes::Executor::TimedStateTypedef for timed state
 Cfaudes::TimeIntervalModel of a time interval
 Cfaudes::TokenTokens model atomic data for stream IO
 Cfaudes::TokenReaderA TokenReader reads sequential tokens from a file or string
 Cfaudes::TokenWriterA TokenWriter writes sequential tokens to a file, a string or stdout
 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::TraceSampleBuffer data entry
 Cfaudes::TransitionTriple (X1,Ev,X2) to represent current state, event and next state
 Cfaudes::TransSortAlternative ordering of Transitions
 Cfaudes::AttributeSignalInput::TriggerTypedef for a single input trigger
 Cfaudes::TypeBase class of all libFAUDES objects that participate in the run-time interface
 Cfaudes::VerifierState
 Cfaudes::TransSort::X1EvX2Binary predicate for sorting transitions in order X1, Ev, X2
 Cfaudes::TransSort::X1X2EvBinary predicate for sorting transitions in order X1, X2, Ev
 Cfaudes::TransSort::X2EvX1Binary predicate for sorting transitions in order X2, Ev, X1
 Cfaudes::TransSort::X2X1EvBinary predicate for sorting transitions in order X2, X1, Ev

libFAUDES 2.32f --- 2024.12.22 --- c++ api documentaion by doxygen