Storm
A Modern Probabilistic Model Checker
|
Find modules (independent subtrees) in DFT. More...
#include <DftModularizer.h>
Public Types | |
using | DFTElementCPointer = std::shared_ptr< storm::dft::storage::elements::DFTElement< ValueType > const > |
using | ElementId = size_t |
Public Member Functions | |
DftModularizer ()=default | |
Constructor. | |
storm::dft::storage::DftIndependentModule | computeModules (storm::dft::storage::DFT< ValueType > const &dft) |
Compute modules of DFT by applying the LTA/DR algorithm. | |
Find modules (independent subtrees) in DFT.
The computation follows the LTA/DR algorithm from: Dutuit, Rauzy: "A linear-time algorithm to find modules of fault trees"
Definition at line 17 of file DftModularizer.h.
using storm::dft::utility::DftModularizer< ValueType >::DFTElementCPointer = std::shared_ptr<storm::dft::storage::elements::DFTElement<ValueType> const> |
Definition at line 19 of file DftModularizer.h.
using storm::dft::utility::DftModularizer< ValueType >::ElementId = size_t |
Definition at line 20 of file DftModularizer.h.
|
default |
Constructor.
storm::dft::storage::DftIndependentModule storm::dft::utility::DftModularizer< ValueType >::computeModules | ( | storm::dft::storage::DFT< ValueType > const & | dft | ) |
Compute modules of DFT by applying the LTA/DR algorithm.
dft | DFT. |
Definition at line 7 of file DftModularizer.cpp.