Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
oCfaudes::AttributeSignalOutput::ActionTypedef for a single output action
oCfaudes::adjlist
oCfaudes::Token::AttributeValueAttribute value
oCfaudes::AutoRegisterType< T >Auto register faudes-type with specified type name
oCfaudes::AutoRegisterXElementTag< T >
oCfaudes::Bisimulation
oCfaudes::nDevice::ClientStateBackground: state of a connection to a client (shared)
oCfaudes::ConfigGsPairComparator
oCfaudes::ConfigSetComparator
oCfaudes::ConsoleOutConsole Out
oCfaudes::SampledDensityFunction::CountEntry
oCfaudes::CoVerifierState
oCfaudes::DiscreteDensityFunctionDensity Function
oCfaudes::sDevice::EdgesBackground: type def for edge detection
oCfaudes::ElemConstraintModel of an elementary clock constraint formula
oCfaudes::vBaseVector::ElementRecordInternal entry data type
oCfaudes::DiscreteDensityFunction::Entry
oCfaudes::TransSort::EvX1X2Binary predicate for sorting transitions in order Ev, X1, X2
oCfaudes::TransSort::EvX2X1Binary predicate for sorting transitions in order Ev, X2, X1
oCfaudes::ExceptionFaudes exception class
oCfaudes::GotoMachineSimple generator for parsing with goto tables
oCfaudes::GrammarGrammar
oCfaudes::GrammarProductionGrammar Production
oCfaudes::GrammarSymbolGrammar Symbol
oCfaudes::graph_iterator_t< VLabel, ELabel >An iterators over the map of all nodes is interpreted as a state incl
oCfaudes::GsComparator
oCfaudes::GsVectorComparator
oCfaudes::HioModuleRecurring structure in hierarchies designed according to the I/O based DES framework
oCfaudes::Hopcroft
oCfaudes::mbDevice::IoRangeModbus address ranges
oCfaudes::TBaseSet< T, Cmp >::IteratorIterator class for high-level api to TBaseSet
oCfaudes::LangKThis class is used to find all words that can be found when traversing a maximum of k transitions of a given generator
oCfaudes::sDevice::LevelsBackground: type def output values
oCLiteratureRecord
oCfaudes::Lr1ConfigurationLr1 Configuration
oCfaudes::Lr1ParserLr1Parser
oCfaudes::Lr1ParserActionLr1ParserAction
oCfaudes::Lr1ParserActionElementLr1ParserActionElement
oCfaudes::LuaStateWrapper class to maintain a Lua state
oCfaudes::MCtrlPattern
oCfaudes::MergeAbstractAbstract interface class for all kinds of items which can comprise a new state
oCfaudes::adjlist::node
oCfaudes::node_entry_t< VLabel, ELabel >A node-entry represents one edge
oCfaudes::node_iterator_t< VLabel, ELabel >An iterator over the set of edges related to one vertex is interpreted as a transition
oCfaudes::ObjectCountDebugging counter
oCfaudes::OPSState
oCfaudes::OPState
oCPageRecord
oCfaudes::ParameterStructure to model a parameter type within the Signature of a Function
oCfaudes::Pnode
oCfaudes::ReductionStateInfoData structure for identifying states in the same coset for supervisor reduction
oCfaudes::SccFilterFilter for strictly connected components (SCC) search/compute routines
oCfaudes::ScopeLoggerClass to create a log file which contains function calls with their runtime
oCfaudes::nDevice::ServerStateBackground: state of a connection to an event server (shared)
oCfaudes::SimEventConditionDefining data of event based simulation condition
oCfaudes::SimplenetAddressSimplenet node address
oCfaudes::SimPriorityEventAttributeDefining data to prioritise events
oCfaudes::SimStateConditionDefining data of state based simulation condition
oCfaudes::SimStochasticEventAttributeDefining data of stochastic behaviour
oCfaudes::SNOState
oCfaudes::StackSymbolDeprecated, do not use!
oCfaudes::Bisimulation::State
 internal representation of transition relation with consecutive indexed states and events

Revision 20150724 tmoor — technically, re-indexing is equivalent to "pointers on source indicees" and buffers log-n searches [30sec -> 10sec for our testcases]

oCfaudes::Hopcroft::StateInternal representation of reverse transition relation with consecutive indexed states and events
oCfaudes::swig_cast_info
oCfaudes::swig_lua_userdata
oCfaudes::swig_type_info
oCfaudes::TGraph< VLabel, ELabel >A graph is modelled as a map from vertex-labels to nodes
oCfaudes::TGraph< Idx, Idx >Specialisation of the graph template to provide convenience methods addressing the intended ussage
oCfaudes::TimeConstraintA TimeConstraint is a set of elementary clock constraints
oCfaudes::TimedEventGlobal Tyoedefs
oCfaudes::Executor::TimedStateTypedef for timed state
oCfaudes::TimeIntervalModel of a time interval
oCfaudes::TNode< VLabel, ELabel >A node represents the edges related to one individual vertex
oCfaudes::TokenTokens model atomic data for stream IO
oCfaudes::TokenReaderA TokenReader reads sequential tokens from a file or string
oCfaudes::TokenWriterA TokenWriter writes sequential tokens to a file, a string or stdout
oCfaudes::tpTimeType to represent time
oCfaudes::LoggingExecutor::TraceSampleBuffer data entry
oCfaudes::TransitionTriple (X1,Ev,X2) to represent current state, event and next state
oCfaudes::TransSortAlternative ordering of Transitions
oCfaudes::AttributeSignalInput::TriggerTypedef for a single input trigger
oCfaudes::TypeBase class of all libFAUDES objects that participate in the run-time interface
oCfaudes::VerifierState
oCfaudes::TransSort::X1EvX2Binary predicate for sorting transitions in order X1, Ev, X2
oCfaudes::TransSort::X1X2EvBinary predicate for sorting transitions in order X1, X2, Ev
oCfaudes::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.26g --- 2015.08.17 --- c++ api documentaion by doxygen