Browse Source

extended mec eliminator to minimal rewards

tempestpy_adaptions
TimQu 7 years ago
parent
commit
820f2ddf4c
  1. 131
      src/storm-pomdp/transformer/GlobalPomdpMecChoiceEliminator.cpp
  2. 3
      src/storm-pomdp/transformer/GlobalPomdpMecChoiceEliminator.h

131
src/storm-pomdp/transformer/GlobalPomdpMecChoiceEliminator.cpp

@ -31,13 +31,60 @@ namespace storm {
subformula = std::make_shared<storm::logic::UntilFormula>(storm::logic::Formula::getTrueFormula(), subformula->asEventuallyFormula().getSubformula().asSharedPointer()); subformula = std::make_shared<storm::logic::UntilFormula>(storm::logic::Formula::getTrueFormula(), subformula->asEventuallyFormula().getSubformula().asSharedPointer());
} }
if (subformula->isUntilFormula()) {
if (formula.isProbabilityOperatorFormula() && subformula->isUntilFormula()) {
if (!minimizes) { if (!minimizes) {
return transformMax(subformula->asUntilFormula()); return transformMax(subformula->asUntilFormula());
} }
} else if (formula.isRewardOperatorFormula() && subformula->isEventuallyFormula()) {
if (minimizes) {
return transformMinReward(subformula->asEventuallyFormula());
}
} }
STORM_LOG_THROW(false, storm::exceptions::InvalidPropertyException, "Mec elimination is not supported for the property " << formula); STORM_LOG_THROW(false, storm::exceptions::InvalidPropertyException, "Mec elimination is not supported for the property " << formula);
return nullptr;
}
template<typename ValueType>
std::shared_ptr<storm::models::sparse::Pomdp<ValueType>> GlobalPomdpMecChoiceEliminator<ValueType>::transformMinReward(storm::logic::EventuallyFormula const& formula) const {
assert (formula.isRewardPathFormula());
auto backwardTransitions = pomdp.getBackwardTransitions();
storm::storage::BitVector allStates(pomdp.getNumberOfStates(), true);
auto prob1EStates = storm::utility::graph::performProb1E(pomdp.getTransitionMatrix(), pomdp.getTransitionMatrix().getRowGroupIndices(), backwardTransitions, allStates, checkPropositionalFormula(formula.getSubformula()));
STORM_LOG_THROW(prob1EStates.full(), storm::exceptions::InvalidPropertyException, "There are states from which the set of target states is not reachable. This is not supported.");
auto prob1AStates = storm::utility::graph::performProb1A(pomdp.getTransitionMatrix(), pomdp.getTransitionMatrix().getRowGroupIndices(), backwardTransitions, allStates, checkPropositionalFormula(formula.getSubformula()));
auto mecs = decomposeEndComponents(~prob1AStates, ~allStates);
// Get the 'out' state for every MEC with just a single out state
storm::storage::BitVector uniqueOutStates = getEndComponentsWithSingleOutStates(mecs);
// For each observation of some 'out' state get the intersection of the choices that lead to the corresponding MEC
std::vector<storm::storage::BitVector> mecChoicesPerObservation = getEndComponentChoicesPerObservation(mecs, uniqueOutStates);
// Filter the observations that have a state that is not an out state
storm::storage::BitVector stateFilter = ~uniqueOutStates;
for (auto const& state : stateFilter) {
mecChoicesPerObservation[pomdp.getObservation(state)].clear();
}
// It should not be possible to clear all choices for an observation since we only consider states that lead outside of its MEC.
for (auto& clearedChoices : mecChoicesPerObservation) {
STORM_LOG_ASSERT(clearedChoices.size() == 0 || !clearedChoices.full(), "Tried to clear all choices for an observation.");
}
// transform the set of selected choices to global choice indices
storm::storage::BitVector choiceFilter(pomdp.getNumberOfChoices(), true);
stateFilter.complement();
for (auto const& state : stateFilter) {
uint64_t offset = pomdp.getTransitionMatrix().getRowGroupIndices()[state];
for (auto const& choice : mecChoicesPerObservation[pomdp.getObservation(state)]) {
choiceFilter.set(offset + choice, false);
}
}
ChoiceSelector<ValueType> cs(pomdp);
return cs.transform(choiceFilter)->template as<storm::models::sparse::Pomdp<ValueType>>();
} }
template<typename ValueType> template<typename ValueType>
@ -46,9 +93,41 @@ namespace storm {
auto prob01States = storm::utility::graph::performProb01Max(pomdp.getTransitionMatrix(), pomdp.getTransitionMatrix().getRowGroupIndices(), backwardTransitions, checkPropositionalFormula(formula.getLeftSubformula()), checkPropositionalFormula(formula.getRightSubformula())); auto prob01States = storm::utility::graph::performProb01Max(pomdp.getTransitionMatrix(), pomdp.getTransitionMatrix().getRowGroupIndices(), backwardTransitions, checkPropositionalFormula(formula.getLeftSubformula()), checkPropositionalFormula(formula.getRightSubformula()));
auto mecs = decomposeEndComponents(~(prob01States.first | prob01States.second), prob01States.first); auto mecs = decomposeEndComponents(~(prob01States.first | prob01States.second), prob01States.first);
std::vector<storm::storage::BitVector> mecChoicesPerObservation(pomdp.getNrObservations());
storm::storage::BitVector uniqueOutStates(pomdp.getNumberOfStates(), false);
// Find the MECs that have only one 'out' state
// Get the 'out' state for every MEC with just a single out state
storm::storage::BitVector uniqueOutStates = getEndComponentsWithSingleOutStates(mecs);
// For each observation of some 'out' state get the intersection of the choices that lead to the corresponding MEC
std::vector<storm::storage::BitVector> mecChoicesPerObservation = getEndComponentChoicesPerObservation(mecs, uniqueOutStates);
// Filter the observations that have a state that is neither an out state, nor a prob0A state
storm::storage::BitVector stateFilter = ~(uniqueOutStates | prob01States.first);
for (auto const& state : stateFilter) {
mecChoicesPerObservation[pomdp.getObservation(state)].clear();
}
// It should not be possible to clear all choices for an observation since we only consider states that lead outside of its MEC.
for (auto& clearedChoices : mecChoicesPerObservation) {
STORM_LOG_ASSERT(clearedChoices.size() == 0 || !clearedChoices.full(), "Tried to clear all choices for an observation.");
}
// transform the set of selected choices to global choice indices
storm::storage::BitVector choiceFilter(pomdp.getNumberOfChoices(), true);
stateFilter.complement();
for (auto const& state : stateFilter) {
uint64_t offset = pomdp.getTransitionMatrix().getRowGroupIndices()[state];
for (auto const& choice : mecChoicesPerObservation[pomdp.getObservation(state)]) {
choiceFilter.set(offset + choice, false);
}
}
ChoiceSelector<ValueType> cs(pomdp);
return cs.transform(choiceFilter)->template as<storm::models::sparse::Pomdp<ValueType>>();
}
template<typename ValueType>
storm::storage::BitVector GlobalPomdpMecChoiceEliminator<ValueType>::getEndComponentsWithSingleOutStates(storm::storage::MaximalEndComponentDecomposition<ValueType> const& mecs) const {
storm::storage::BitVector result(pomdp.getNumberOfStates(), false);
for (auto const& mec : mecs) { for (auto const& mec : mecs) {
boost::optional<uint64_t> uniqueOutState = boost::none; boost::optional<uint64_t> uniqueOutState = boost::none;
for (auto const& stateActionsPair : mec) { for (auto const& stateActionsPair : mec) {
@ -64,16 +143,27 @@ namespace storm {
} }
} }
if (uniqueOutState) { if (uniqueOutState) {
uniqueOutStates.set(uniqueOutState.get(), true);
result.set(uniqueOutState.get(), true);
}
}
return result;
}
storm::storage::BitVector localChoiceIndices(pomdp.getNumberOfChoices(uniqueOutState.get()), false);
uint64_t offset = pomdp.getTransitionMatrix().getRowGroupIndices()[uniqueOutState.get()];
for (auto const& choice : mec.getChoicesForState(uniqueOutState.get())) {
template<typename ValueType>
std::vector<storm::storage::BitVector> GlobalPomdpMecChoiceEliminator<ValueType>::getEndComponentChoicesPerObservation(storm::storage::MaximalEndComponentDecomposition<ValueType> const& mecs, storm::storage::BitVector const& consideredStates) const {
std::vector<storm::storage::BitVector> result(pomdp.getNrObservations());
for (auto const& mec : mecs) {
for (auto const& stateActions : mec) {
if (consideredStates.get(stateActions.first)) {
storm::storage::BitVector localChoiceIndices(pomdp.getNumberOfChoices(stateActions.first), false);
uint64_t offset = pomdp.getTransitionMatrix().getRowGroupIndices()[stateActions.first];
for (auto const& choice : stateActions.second) {
assert(choice >= offset); assert(choice >= offset);
localChoiceIndices.set(choice - offset, true); localChoiceIndices.set(choice - offset, true);
} }
auto& mecChoices = mecChoicesPerObservation[pomdp.getObservation(uniqueOutState.get())];
auto& mecChoices = result[pomdp.getObservation(stateActions.first)];
if (mecChoices.size() == 0) { if (mecChoices.size() == 0) {
mecChoices = localChoiceIndices; mecChoices = localChoiceIndices;
} else { } else {
@ -82,31 +172,10 @@ namespace storm {
} }
} }
} }
// Filter the observations that have a state that is neither an out state, nor a prob0A or prob1A state
storm::storage::BitVector stateFilter = ~(uniqueOutStates | prob01States.first | prob01States.second);
for (auto const& state : stateFilter) {
mecChoicesPerObservation[pomdp.getObservation(state)].clear();
}
// It should not be possible to clear all choices for an observation since we only consider states that lead outside of its MEC.
for (auto& clearedChoices : mecChoicesPerObservation) {
STORM_LOG_ASSERT(clearedChoices.size() == 0 || !clearedChoices.full(), "Tried to clear all choices for an observation.");
}
// transform the set of selected choices to global choice indices
storm::storage::BitVector choiceFilter(pomdp.getNumberOfChoices(), true);
stateFilter.complement();
for (auto const& state : stateFilter) {
uint64_t offset = pomdp.getTransitionMatrix().getRowGroupIndices()[state];
for (auto const& choice : mecChoicesPerObservation[pomdp.getObservation(state)]) {
choiceFilter.set(offset + choice, false);
} }
return result;
} }
ChoiceSelector<ValueType> cs(pomdp);
return cs.transform(choiceFilter)->template as<storm::models::sparse::Pomdp<ValueType>>();
}
template<typename ValueType> template<typename ValueType>
storm::storage::MaximalEndComponentDecomposition<ValueType> GlobalPomdpMecChoiceEliminator<ValueType>::decomposeEndComponents(storm::storage::BitVector const& subsystem, storm::storage::BitVector const& redirectingStates) const { storm::storage::MaximalEndComponentDecomposition<ValueType> GlobalPomdpMecChoiceEliminator<ValueType>::decomposeEndComponents(storm::storage::BitVector const& subsystem, storm::storage::BitVector const& redirectingStates) const {

3
src/storm-pomdp/transformer/GlobalPomdpMecChoiceEliminator.h

@ -20,8 +20,11 @@ namespace storm {
private: private:
std::shared_ptr<storm::models::sparse::Pomdp<ValueType>> transformMinReward(storm::logic::EventuallyFormula const& formula) const;
std::shared_ptr<storm::models::sparse::Pomdp<ValueType>> transformMax(storm::logic::UntilFormula const& formula) const; std::shared_ptr<storm::models::sparse::Pomdp<ValueType>> transformMax(storm::logic::UntilFormula const& formula) const;
storm::storage::MaximalEndComponentDecomposition<ValueType> decomposeEndComponents(storm::storage::BitVector const& subsystem, storm::storage::BitVector const& ignoredStates) const; storm::storage::MaximalEndComponentDecomposition<ValueType> decomposeEndComponents(storm::storage::BitVector const& subsystem, storm::storage::BitVector const& ignoredStates) const;
storm::storage::BitVector getEndComponentsWithSingleOutStates(storm::storage::MaximalEndComponentDecomposition<ValueType> const& mecs) const;
std::vector<storm::storage::BitVector> getEndComponentChoicesPerObservation(storm::storage::MaximalEndComponentDecomposition<ValueType> const& mecs, storm::storage::BitVector const& consideredStates) const;
storm::storage::BitVector checkPropositionalFormula(storm::logic::Formula const& propositionalFormula) const; storm::storage::BitVector checkPropositionalFormula(storm::logic::Formula const& propositionalFormula) const;

Loading…
Cancel
Save