|
@ -3,16 +3,53 @@ |
|
|
namespace storm { |
|
|
namespace storm { |
|
|
namespace builder { |
|
|
namespace builder { |
|
|
|
|
|
|
|
|
void ExplicitDFTModelBuilder::exploreStateSuccessors(storm::storage::DFTState const &state) { |
|
|
|
|
|
|
|
|
template<typename ValueType, typename RewardModelType, typename IndexType> |
|
|
|
|
|
void ExplicitDFTModelBuilder<ValueType, RewardModelType, IndexType>::buildCTMC() { |
|
|
|
|
|
// Initialize
|
|
|
|
|
|
storm::storage::DFTState state(mDft, newIndex++); |
|
|
|
|
|
mStates.insert(state); |
|
|
|
|
|
|
|
|
|
|
|
std::queue<storm::storage::DFTState> stateQueue; |
|
|
|
|
|
stateQueue.push(state); |
|
|
|
|
|
|
|
|
|
|
|
bool deterministicModel = true; |
|
|
|
|
|
storm::storage::SparseMatrixBuilder<ValueType> transitionMatrixBuilder(0, 0, 0, false, !deterministicModel, 0); |
|
|
|
|
|
|
|
|
|
|
|
// Begin model generation
|
|
|
|
|
|
exploreStates(stateQueue, transitionMatrixBuilder); |
|
|
|
|
|
//std::cout << "Generated " << mStates.size() << " states" << std::endl;
|
|
|
|
|
|
|
|
|
|
|
|
// Build CTMC
|
|
|
|
|
|
transitionMatrix = transitionMatrixBuilder.build(); |
|
|
|
|
|
//std::cout << "TransitionMatrix: " << std::endl;
|
|
|
|
|
|
//std::cout << transitionMatrix << std::endl;
|
|
|
|
|
|
// TODO Matthias: build CTMC
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
template<typename ValueType, typename RewardModelType, typename IndexType> |
|
|
|
|
|
void ExplicitDFTModelBuilder<ValueType, RewardModelType, IndexType>::exploreStates(std::queue<storm::storage::DFTState>& stateQueue, storm::storage::SparseMatrixBuilder<ValueType>& transitionMatrixBuilder) { |
|
|
|
|
|
|
|
|
|
|
|
std::vector<std::pair<size_t, ValueType>> outgoingTransitions; |
|
|
|
|
|
|
|
|
|
|
|
while (!stateQueue.empty()) { |
|
|
|
|
|
// Initialization
|
|
|
|
|
|
outgoingTransitions.clear(); |
|
|
|
|
|
ValueType sum = 0; |
|
|
|
|
|
|
|
|
|
|
|
// Consider next state
|
|
|
|
|
|
storm::storage::DFTState state = stateQueue.front(); |
|
|
|
|
|
stateQueue.pop(); |
|
|
|
|
|
|
|
|
size_t smallest = 0; |
|
|
size_t smallest = 0; |
|
|
|
|
|
|
|
|
|
|
|
// Let BE fail
|
|
|
while (smallest < state.nrFailableBEs()) { |
|
|
while (smallest < state.nrFailableBEs()) { |
|
|
//std::cout << "exploring from: " << mDft.getStateString(state) << std::endl;
|
|
|
//std::cout << "exploring from: " << mDft.getStateString(state) << std::endl;
|
|
|
|
|
|
|
|
|
storm::storage::DFTState newState(state); |
|
|
storm::storage::DFTState newState(state); |
|
|
std::pair<std::shared_ptr<storm::storage::DFTBE<double>>, bool> nextBE = newState.letNextBEFail(smallest++); |
|
|
|
|
|
|
|
|
std::pair<std::shared_ptr<storm::storage::DFTBE<ValueType>>, bool> nextBE = newState.letNextBEFail(smallest++); |
|
|
if (nextBE.first == nullptr) { |
|
|
if (nextBE.first == nullptr) { |
|
|
//std::cout << "break" << std::endl;
|
|
|
|
|
|
|
|
|
std::cout << "break" << std::endl; |
|
|
break; |
|
|
break; |
|
|
|
|
|
|
|
|
} |
|
|
} |
|
@ -45,12 +82,14 @@ namespace storm { |
|
|
if (it == mStates.end()) { |
|
|
if (it == mStates.end()) { |
|
|
// New state
|
|
|
// New state
|
|
|
newState.setId(newIndex++); |
|
|
newState.setId(newIndex++); |
|
|
mStates.insert(newState); |
|
|
|
|
|
|
|
|
auto itInsert = mStates.insert(newState); |
|
|
|
|
|
assert(itInsert.second); |
|
|
|
|
|
it = itInsert.first; |
|
|
//std::cout << "New state " << mDft.getStateString(newState) << std::endl;
|
|
|
//std::cout << "New state " << mDft.getStateString(newState) << std::endl;
|
|
|
|
|
|
|
|
|
// Recursive call
|
|
|
// Recursive call
|
|
|
if (!mDft.hasFailed(newState) && !mDft.isFailsafe(newState)) { |
|
|
if (!mDft.hasFailed(newState) && !mDft.isFailsafe(newState)) { |
|
|
exploreStateSuccessors(newState); |
|
|
|
|
|
|
|
|
stateQueue.push(newState); |
|
|
} else { |
|
|
} else { |
|
|
if (mDft.hasFailed(newState)) { |
|
|
if (mDft.hasFailed(newState)) { |
|
|
//std::cout << "Failed " << mDft.getStateString(newState) << std::endl;
|
|
|
//std::cout << "Failed " << mDft.getStateString(newState) << std::endl;
|
|
@ -63,9 +102,33 @@ namespace storm { |
|
|
// State already exists
|
|
|
// State already exists
|
|
|
//std::cout << "State " << mDft.getStateString(*it) << " already exists" << std::endl;
|
|
|
//std::cout << "State " << mDft.getStateString(*it) << " already exists" << std::endl;
|
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Set transition
|
|
|
|
|
|
ValueType prob = nextBE.first->activeFailureRate(); |
|
|
|
|
|
outgoingTransitions.push_back(std::make_pair(it->getId(), prob)); |
|
|
|
|
|
sum += prob; |
|
|
|
|
|
} // end while failing BE
|
|
|
|
|
|
|
|
|
|
|
|
// Add all transitions
|
|
|
|
|
|
for (auto it = outgoingTransitions.begin(); it != outgoingTransitions.end(); ++it) |
|
|
|
|
|
{ |
|
|
|
|
|
ValueType rate = it->second / sum; |
|
|
|
|
|
transitionMatrixBuilder.addNextValue(state.getId(), it->first, rate); |
|
|
|
|
|
//std::cout << "Added transition from " << state.getId() << " to " << it->first << " with " << rate << std::endl;
|
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
} // end while queue
|
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Explicitly instantiate the class.
|
|
|
|
|
|
template |
|
|
|
|
|
class ExplicitDFTModelBuilder<double, storm::models::sparse::StandardRewardModel<double>, uint32_t>; |
|
|
|
|
|
|
|
|
|
|
|
#ifdef STORM_HAVE_CARL
|
|
|
|
|
|
template class ExplicitDFTModelBuilder<double, storm::models::sparse::StandardRewardModel<storm::Interval>, uint32_t>; |
|
|
|
|
|
template class ExplicitDFTModelBuilder<RationalFunction, storm::models::sparse::StandardRewardModel<RationalFunction>, uint32_t>; |
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
} // namespace builder
|
|
|
} // namespace builder
|
|
|
} // namespace storm
|
|
|
} // namespace storm
|
|
|
|
|
|
|
|
|