Cfaudes::AttributeSignalOutput::Action | Typedef for a single output action |
Cfaudes::adjlist | |
Cfaudes::Token::AttributeValue | Attribute value |
Cfaudes::AutoRegisterType< T > | Auto register faudes-type with specified type name |
Cfaudes::AutoRegisterXElementTag< T > | |
Cfaudes::Bisimulation | |
►Cfaudes::BisimulationCTA | The 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::AbstractBisimulationCTA | The DelayedBisimulation class Derived from Bisimulation class. We implement the "two-pass change-tracking" algorithm from the cited paper |
Cfaudes::nDevice::ClientState | Background: state of a connection to a client (shared) |
Cfaudes::ComSyn | |
Cfaudes::ConsoleOut | Console Out |
►Cstd::set::const_iterator | |
Cfaudes::TBaseSet< T, Cmp >::Iterator | Iterator class for high-level api to TBaseSet |
Cfaudes::SampledDensityFunction::CountEntry | |
Cfaudes::CoVerifierState | |
►Cfaudes::DiscreteDensityFunction | Density Function |
Cfaudes::SampledDensityFunction | |
Cfaudes::sDevice::Edges | Background: type def for edge detection
|
Cfaudes::ElemConstraint | Model of an elementary clock constraint formula |
Cfaudes::vBaseVector::ElementRecord | Internal entry data type |
Cfaudes::DiscreteDensityFunction::Entry | |
Cfaudes::TransSort::EvX1X2 | Binary predicate for sorting transitions in order Ev, X1, X2 |
Cfaudes::TransSort::EvX2X1 | Binary predicate for sorting transitions in order Ev, X2, X1 |
►Cstd::exception | |
Cfaudes::Exception | Faudes exception class |
Cfaudes::HioModule | Recurring structure in hierarchies designed according to the I/O based DES framework |
Cfaudes::Hopcroft | |
Cfaudes::mbDevice::IoRange | Modbus address ranges |
►CTGraph::iterator | |
Cfaudes::graph_iterator_t< VLabel, ELabel > | An iterator over the map of all nodes is interpreted as a state incl |
►CTNode::iterator | |
Cfaudes::node_iterator_t< VLabel, ELabel > | An iterator over the set of edges related to one vertex is interpreted as a transition |
Cfaudes::sDevice::Levels | Background: type def output values
|
CLiteratureRecord | |
Cfaudes::TokenReader::LState | State on entry of respective level |
Cfaudes::LuaState | Wrapper class to maintain a Lua state |
►Cstd::map | |
Cfaudes::TGraph< VLabel, ELabel > | Graph data structure for transitionrelation – EXPERIMENTAL |
Cfaudes::TGraph< Idx, Idx > | Specialisation of the graph template to provide convenience methods addressing the intended ussage |
Cfaudes::MCtrlPattern | |
Cfaudes::adjlist::node | |
Cfaudes::node_entry_t< VLabel, ELabel > | A node-entry represents one edge |
Cfaudes::ObjectCount | Debugging counter |
Cfaudes::OPSState | |
Cfaudes::OPState | |
CPageRecord | |
Cfaudes::Parameter | Structure to model a parameter type within the Signature of a Function |
Cfaudes::Pnode | |
Cfaudes::ReductionStateInfo | Data structure for identifying states in the same coset for supervisor reduction |
Cfaudes::SOE::Relation | Relation according to SOE in one block |
Cfaudes::SccFilter | Filter for strictly connected components (SCC) search/compute routines |
Cfaudes::nDevice::ServerState | Background: state of a connection to an event server (shared) |
►Cstd::set | |
Cfaudes::TNode< VLabel, ELabel > | A node represents the edges related to one individual vertex |
Cfaudes::SimEventCondition | Defining data of event based simulation condition |
Cfaudes::SimplenetAddress | Simplenet node address |
Cfaudes::SimPriorityEventAttribute | Defining data to prioritise events |
Cfaudes::SimStateCondition | Defining data of state based simulation condition |
Cfaudes::SimStochasticEventAttribute | Defining data of stochastic behaviour |
Cfaudes::SmallSize | |
Cfaudes::SNOState | |
Cfaudes::SOE | |
Cfaudes::Bisimulation::State | |
Cfaudes::BisimulationCTA::State | |
Cfaudes::Hopcroft::State | Internal representation of reverse transition relation with consecutive indexed states and events |
Cfaudes::SOE::State | Internal 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::TaIndexSet< StateAttr > | |
Cfaudes::TaIndexSet< faudes::DiagLabelSet > | |
Cfaudes::TaNameSet< faudes::AttributeFailureEvents > | |
►Cfaudes::TaNameSet< AttributeSimCondition > | |
Cfaudes::SimConditionSet | Set of simulation named conditions |
Cfaudes::TaNameSet< faudes::AttributeSignalEvent > | |
Cfaudes::TaNameSet< faudes::AttributeSimplenetEvent > | |
Cfaudes::TaNameSet< EventAttr > | |
Cfaudes::TaNameSet< SimEventAttribute > | |
►Cfaudes::TAttrMap< Idx, Attr > | |
Cfaudes::TaIndexSet< Attr > | Set of indices with attributes |
Cfaudes::TaNameSet< Attr > | Set of indices with symbolic names and attributes |
►Cfaudes::TAttrMap< Transition, Attr, TransSort::X1EvX2 > | |
Cfaudes::TaTransSet< Attr > | Set of Transitions with attributes |
Cfaudes::Time | Type to represent time |
Cfaudes::TimeConstraint | A TimeConstraint is a set of elementary clock constraints |
Cfaudes::TimedEvent | Global Tyoedefs |
Cfaudes::Executor::TimedState | Typedef for timed state |
Cfaudes::TimeInterval | Model of a time interval |
Cfaudes::Token | Tokens model atomic data for stream IO |
Cfaudes::TokenReader | A TokenReader reads sequential tokens from a file or string |
Cfaudes::TokenWriter | A TokenWriter writes sequential tokens to a file, a string or stdout |
Cfaudes::TopoSort | The 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 | Buffer data entry |
Cfaudes::Transition | Triple (X1,Ev,X2) to represent current state, event and next state |
Cfaudes::TransSort | Alternative ordering of Transitions |
Cfaudes::AttributeSignalInput::Trigger | Typedef for a single input trigger |
►Cfaudes::Type | Base class of all libFAUDES objects that participate in the run-time interface |
►Cfaudes::TBaseSet< std::string > | |
Cfaudes::SymbolSet | Set of symbols |
►Cfaudes::TBaseSet< Idx > | |
►Cfaudes::IndexSet | Set of indices |
Cfaudes::TaIndexSet< StateAttr > | |
Cfaudes::TaIndexSet< faudes::DiagLabelSet > | |
Cfaudes::TaIndexSet< Attr > | Set of indices with attributes |
►Cfaudes::NameSet | Set of indices with symbolic names |
Cfaudes::TaNameSet< faudes::AttributeFailureEvents > | |
Cfaudes::TaNameSet< AttributeSimCondition > | |
Cfaudes::TaNameSet< faudes::AttributeSignalEvent > | |
Cfaudes::TaNameSet< faudes::AttributeSimplenetEvent > | |
Cfaudes::TaNameSet< EventAttr > | |
Cfaudes::TaNameSet< SimEventAttribute > | |
Cfaudes::ClockSet | Container class to model a set of clocks |
Cfaudes::ColorSet | Container for colors: this is a NameSet with its own static symboltable |
Cfaudes::TaNameSet< Attr > | Set of indices with symbolic names and attributes |
►Cfaudes::TBaseSet< Transition, TransSort::X1EvX2 > | |
►Cfaudes::TTransSet< TransSort::X1EvX2 > | |
Cfaudes::TaTransSet< Attr > | Set of Transitions with attributes |
Cfaudes::TTransSet< Cmp > | Set of Transitions |
Cfaudes::TBaseSet< T, std::less< T > > | |
Cfaudes::TBaseSet< T, Cmp > | |
►Cfaudes::AttributeVoid | Minimal Attribute |
►Cfaudes::AttributeDeviceEvent | Attribute for the configuration of a input or output mapping |
Cfaudes::AttributeSignalEvent | Configuration of a signal based input or output |
Cfaudes::AttributeSimplenetEvent | Configuration of a networked input or output |
►Cfaudes::AttributeFlags | Boolean flags Attribute |
►Cfaudes::AttributeCFlags | Attribute class to model event controllability properties |
Cfaudes::SimEventAttribute | Attribute for an event in the context of simulation |
Cfaudes::AttributeColoredState | State attributes for multitasking automata |
Cfaudes::AttributeDiagnoserState | Implements state estimates for the current status of the generator |
Cfaudes::AttributeFailureEvents | Stores the failure and indicator events for a particular failure type |
Cfaudes::AttributeFailureTypeMap | Partitions the failure and indicator events |
Cfaudes::AttributeIosEvent | Attributes for events in DES with in- and outputs |
Cfaudes::AttributeIosState | Attributes for states in DESs with in- and outputs |
Cfaudes::AttributeSimCondition | Attribute for a simulation condition |
Cfaudes::AttributeTimedState | State attribute with invariant |
Cfaudes::AttributeTimedTrans | Transition Attribute with guard and resets |
Cfaudes::DiagLabelSet | Implements the label representation for state estimates |
Cfaudes::HioEventFlags | Event attributes for hierarchical discrete event systems with inputs and outputs |
Cfaudes::HioStateFlags | State attributes for hierarchical discrete event systems with inputs and outputs |
Cfaudes::AttributeSignalInput | Configuration of a signal based input mapping |
Cfaudes::AttributeSignalOutput | Configuration of a signal based output mapping |
Cfaudes::AttributeSimplenetInput | Configuration of a network input mapping |
Cfaudes::AttributeSimplenetOutput | Configuration of a network output mapping |
Cfaudes::AttributeTimedGlobal | Globat attribute with clockset |
Cfaudes::Boolean | Elementary type |
►Cfaudes::Documentation | Faudes type implementation macros, overall |
►Cfaudes::FunctionDefinition | A FunctionDefinition defines the interface to a faudes-function |
Cfaudes::LuaFunctionDefinition | A LuaFunctionDefinition is derived from FunctionDefinition to define a faudes-function by a Lua script |
Cfaudes::TypeDefinition | A TypeDefinition defines a faudes-type in that it specifies a faudes-type name to identify the type and a method NewObject() to instantiate objects of the respective type |
Cfaudes::EventRelabelMap | Rti convenience wrapper for relabeling maps |
►Cfaudes::Function | A faudes-function hosts parameter values of some faudes type and provides a method to perform an operation on the specified paramters, e.g |
Cfaudes::LuaFunction | A LuaFunction is a faudes-function that executes a luafaudes script |
Cfaudes::FunctionRegistry | The FunctionRegistry registers faudes-functions |
Cfaudes::Integer | Elementary type |
►Cfaudes::ParallelExecutor | Synchronized parallel execution of TimedGenerators |
►Cfaudes::LoggingExecutor | Executor with logging facilities |
►Cfaudes::ProposingExecutor | Executer that proposes which transition to execute |
Cfaudes::DeviceExecutor | Executer with IO device to handle external/physical events |
Cfaudes::ParallelExecutor::ParallelTimedState | Typedef for parallel timed state, incl token io |
Cfaudes::ProductCompositionMap | Rti-wrapper for composition maps |
Cfaudes::Signature | Signature of a Function |
Cfaudes::String | Elementary type |
Cfaudes::SymbolTable | A SymbolTable associates sybolic names with indices |
Cfaudes::TBaseSet< T, Cmp > | STL style set template |
Cfaudes::TypeRegistry | The TypeRegistry registers faudes-types |
►Cfaudes::vBaseVector | Vector bass class |
Cfaudes::TBaseVector< Generator > | |
Cfaudes::TBaseVector< T > | Vector template |
►Cfaudes::vDevice | Virtual base class to define the interface for event io |
Cfaudes::nDevice | An nDevice implements networked IO via a simple TCP/IP protocol |
►Cfaudes::sDevice | An sDevice implements signal based semantics for faudes events |
Cfaudes::mbDevice | Processimage synchronisation via Modbus/TCP |
Cfaudes::xDevice | Container of devices |
►Cfaudes::vGenerator | Base class of all FAUDES generators |
►Cfaudes::TaGenerator< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with specified attribute types |
Cfaudes::THioConstraint< AttributeVoid, HioStateFlags, HioEventFlags, AttributeVoid > | |
Cfaudes::THioController< AttributeVoid, HioStateFlags, HioEventFlags, AttributeVoid > | |
Cfaudes::THioEnvironment< AttributeVoid, HioStateFlags, HioEventFlags, AttributeVoid > | |
Cfaudes::THioPlant< AttributeVoid, HioStateFlags, HioEventFlags, AttributeVoid > | |
Cfaudes::THioConstraint< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with I/O-constraint attributes |
Cfaudes::THioController< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with I/O-controller attributes |
Cfaudes::THioEnvironment< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with I/O-environment attributes |
Cfaudes::THioPlant< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with I/O-plant attributes |
►Cfaudes::TcGenerator< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with controllability attributes |
Cfaudes::TdiagGenerator< GlobalAttr, StateAttr, EventAttr, TransAttr > | Provides the structure and methods to build and handle diagnosers |
Cfaudes::TmtcGenerator< GlobalAttr, StateAttr, EventAttr, TransAttr > | Allows to create colored marking generators (CMGs) as the common five tupel consisting of alphabet, stateset, transition relation, initial states, marked states, and attributes for state and event properties |
►Cfaudes::TtGenerator< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with timing extensions |
Cfaudes::Executor | An Executor is a timed generator that maintains a current state |
Cfaudes::TioGenerator< GlobalAttr, StateAttr, EventAttr, TransAttr > | Generator with I/O-system attributes |
Cfaudes::VerifierState | |
Cfaudes::TransSort::X1EvX2 | Binary predicate for sorting transitions in order X1, Ev, X2 |
Cfaudes::TransSort::X1X2Ev | Binary predicate for sorting transitions in order X1, X2, Ev |
Cfaudes::TransSort::X2EvX1 | Binary predicate for sorting transitions in order X2, Ev, X1 |
Cfaudes::TransSort::X2X1Ev | Binary predicate for sorting transitions in order X2, X1, Ev |