|
|
||||||
|
Public Types |
Public Member Functions |
Protected Member Functions |
Protected Attributes |
Static Protected Attributes |
Friends |
List of all members
faudes::SccFilter Class Reference Detailed DescriptionFilter for strictly connected components (SCC) search/compute routines. When ComputeScc()/HasScc()/NextScc() traverse a specified transition sytem in their search, a SccFilter parameter can mute certain transitions. The respective filter conditions are set by the constructor and consist of a flag word (mMode) and additional parameters (depending on the flags). The Flags can be combined from the following:
Convenience modes set up the state related filter conditions from the set of marked states:
Technical note: SccFilters interally use references to condition parameters that are required to exist during the life time of the filter object. Technical note: currently, there is no EventsRequire filter because the implementation interprets the transition relation primarily from a directed graph perspective; while StatesRequire makes sense for marked states semantics, we are not aware of any applications for a corresponding version of EventsRequire; please let us know if you require such an extension. Definition at line 65 of file cfl_graphfncts.h.
Member Enumeration Documentation◆ FModeTypedef for filter modes.
Definition at line 89 of file cfl_graphfncts.h. Constructor & Destructor Documentation◆ SccFilter() [1/7]
Constructor (no filter) Definition at line 52 of file cfl_graphfncts.cpp. ◆ SccFilter() [2/7]
Constructor (copy constructor) Definition at line 64 of file cfl_graphfncts.cpp. ◆ SccFilter() [3/7]
◆ SccFilter() [4/7]
Constructor (from flags and state set, either avoid or require) Definition at line 95 of file cfl_graphfncts.cpp. ◆ SccFilter() [5/7]
Constructor (from flags and state sets) Definition at line 115 of file cfl_graphfncts.cpp. ◆ SccFilter() [6/7]
Constructor (from flags and event sets) Definition at line 76 of file cfl_graphfncts.cpp. ◆ SccFilter() [7/7]
Constructor (from flags and sets) ◆ ~SccFilter()
Destructor. Definition at line 45 of file cfl_graphfncts.cpp. Member Function Documentation◆ Clear()
Edit filter (RTI): no filter. Definition at line 165 of file cfl_graphfncts.cpp. ◆ EventsAvoid()
Edit filter (RTI): set avoid events. Definition at line 203 of file cfl_graphfncts.cpp. ◆ FindFirst()
Edit filter (RTI): find first. Definition at line 217 of file cfl_graphfncts.cpp. ◆ IgnoreTrivial()
Edit filter (RTI): ignore trivial. Definition at line 211 of file cfl_graphfncts.cpp. ◆ MergeStatesAvoid()
Edit filter (RTI): avoid states. Definition at line 195 of file cfl_graphfncts.cpp. ◆ Mode()
Member access. Definition at line 127 of file cfl_graphfncts.h. ◆ StatesAvoid() [1/2]
Edit filter (RTI): set avoid states. Definition at line 179 of file cfl_graphfncts.cpp. ◆ StatesAvoid() [2/2]
Member access. Definition at line 130 of file cfl_graphfncts.h. ◆ StatesRequire() [1/2]
Edit filter (RTI): set required states. Definition at line 187 of file cfl_graphfncts.cpp. ◆ StatesRequire() [2/2]
Member access. Definition at line 133 of file cfl_graphfncts.h. Friends And Related Function Documentation◆ ComputeNextScc
Compute next SCC. This function provides an API for the iterative computation of SCCs. It invokes SearchScc() to find the next SCC and then adds the SCC to the StatesAvoid Filter. This approach is not computationally efficient but it allows for simple Lua wrappers.
Definition at line 560 of file cfl_graphfncts.cpp. ◆ SearchScc
Search for strongly connected components (SCC). This function partitions the stateset of a generator into equivalent classes such that states x1 and x2 are equivalent iff there is a path from x1 to x2 AND a path from x2 to x1. This function implements the algorithm based on a recursive depth first search presented in: – Aho, Hopcroft, Ullman: The Design and Analysis of Computer Algorithms – While the original algorithm works on a directed graph, this implementation adds some features that refer to transition systems and allow to filter SCCs on the run. The filter condition is specified by the SccFilter parameter rFilter. Note: this version is derived from earlier implementations used in various plug-ins; in due course, this version will replace earlier versions. Note: Due to the recursive implementation, this function requires a stack size proportional to the largest SCC. We have experienced typical default configurations to be good for a depth of about 80000 (Mac OSX 10.6, Debian 7.4). For SCCs exceeding the default stack size, you may adjust the operating system parameters accordingly. On Unix/Linux/MacOsX this is done by the shell command "ulimit -s hard". A future revision of SearchSCC() may be re-designed to circumvent this inconvenient issue. Note: for a convenience API see also ComputeScc()
Definition at line 228 of file cfl_graphfncts.cpp. Member Data Documentation◆ mMode
Flag, combining bit masks from Mode. Definition at line 160 of file cfl_graphfncts.h. ◆ mpEventsAvoid
Definition at line 171 of file cfl_graphfncts.h. ◆ mpStatesAvoid
Local sets (optional) Definition at line 169 of file cfl_graphfncts.h. ◆ mpStatesRequire
Definition at line 170 of file cfl_graphfncts.h. ◆ msEmptyEventsDefinition at line 175 of file cfl_graphfncts.h. ◆ msEmptyStatesStatic emptysets. Definition at line 174 of file cfl_graphfncts.h. ◆ pEventsAvoid
Events to avoid (if flag EventssAvoid is set) Definition at line 166 of file cfl_graphfncts.h. ◆ pStatesAvoid
States to avoid (if flag StatesAvoid is set) Definition at line 162 of file cfl_graphfncts.h. ◆ pStatesRequire
States to require (if flag StatesRequire is set) Definition at line 164 of file cfl_graphfncts.h. The documentation for this class was generated from the following files: libFAUDES 2.32b --- 2024.03.01 --- c++ api documentaion by doxygen |