@ -100,9 +100,9 @@ namespace storm {
/ / Determine the states that have 0 probability of reaching the target states . / / Determine the states that have 0 probability of reaching the target states .
storm : : storage : : BitVector statesWithProbabilityGreater0 ; storm : : storage : : BitVector statesWithProbabilityGreater0 ;
if ( this - > minimumOperatorStack . top ( ) ) { if ( this - > minimumOperatorStack . top ( ) ) {
statesWithProbabilityGreater0 = storm : : utility : : graph : : performProbGreater0A ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , phiStates , psiStates , true , stepBound ) ;
statesWithProbabilityGreater0 = storm : : utility : : graph : : performProbGreater0A ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , phiStates , psiStates , true , stepBound ) ;
} else { } else {
statesWithProbabilityGreater0 = storm : : utility : : graph : : performProbGreater0E ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , phiStates , psiStates , true , stepBound ) ;
statesWithProbabilityGreater0 = storm : : utility : : graph : : performProbGreater0E ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , phiStates , psiStates , true , stepBound ) ;
} }
/ / Check if we already know the result ( i . e . probability 0 ) for all initial states and / / Check if we already know the result ( i . e . probability 0 ) for all initial states and
@ -119,20 +119,17 @@ namespace storm {
/ / We can eliminate the rows and columns from the original transition probability matrix that have probability 0. / / We can eliminate the rows and columns from the original transition probability matrix that have probability 0.
storm : : storage : : SparseMatrix < Type > submatrix = this - > getModel ( ) . getTransitionMatrix ( ) . getSubmatrix ( true , statesWithProbabilityGreater0 , statesWithProbabilityGreater0 , false ) ; storm : : storage : : SparseMatrix < Type > submatrix = this - > getModel ( ) . getTransitionMatrix ( ) . getSubmatrix ( true , statesWithProbabilityGreater0 , statesWithProbabilityGreater0 , false ) ;
/ / Get the " new " nondeterministic choice indices for the submatrix .
std : : vector < uint_fast64_t > subNondeterministicChoiceIndices = storm : : utility : : vector : : getConstrainedOffsetVector ( this - > getModel ( ) . getNondeterministicChoiceIndices ( ) , statesWithProbabilityGreater0 ) ;
/ / Compute the new set of target states in the reduced system . / / Compute the new set of target states in the reduced system .
storm : : storage : : BitVector rightStatesInReducedSystem = psiStates % statesWithProbabilityGreater0 ; storm : : storage : : BitVector rightStatesInReducedSystem = psiStates % statesWithProbabilityGreater0 ;
/ / Make all rows absorbing that satisfy the second sub - formula . / / Make all rows absorbing that satisfy the second sub - formula .
submatrix . makeRowGroupsAbsorbing ( rightStatesInReducedSystem , subNondeterministicChoiceIndices ) ;
submatrix . makeRowGroupsAbsorbing ( rightStatesInReducedSystem ) ;
/ / Create the vector with which to multiply . / / Create the vector with which to multiply .
std : : vector < Type > subresult ( statesWithProbabilityGreater0 . getNumberOfSetBits ( ) ) ; std : : vector < Type > subresult ( statesWithProbabilityGreater0 . getNumberOfSetBits ( ) ) ;
storm : : utility : : vector : : setVectorValues ( subresult , rightStatesInReducedSystem , storm : : utility : : constantOne < Type > ( ) ) ; storm : : utility : : vector : : setVectorValues ( subresult , rightStatesInReducedSystem , storm : : utility : : constantOne < Type > ( ) ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , submatrix , subresult , subNondeterministicChoiceIndices , nullptr , stepBound ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , submatrix , subresult , nullptr , stepBound ) ;
/ / Set the values of the resulting vector accordingly . / / Set the values of the resulting vector accordingly .
storm : : utility : : vector : : setVectorValues ( result , statesWithProbabilityGreater0 , subresult ) ; storm : : utility : : vector : : setVectorValues ( result , statesWithProbabilityGreater0 , subresult ) ;
@ -173,7 +170,7 @@ namespace storm {
std : : vector < Type > result ( this - > getModel ( ) . getNumberOfStates ( ) ) ; std : : vector < Type > result ( this - > getModel ( ) . getNumberOfStates ( ) ) ;
storm : : utility : : vector : : setVectorValues ( result , nextStates , storm : : utility : : constantOne < Type > ( ) ) ; storm : : utility : : vector : : setVectorValues ( result , nextStates , storm : : utility : : constantOne < Type > ( ) ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result , this - > getModel ( ) . getNondeterministicChoiceIndices ( ) ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result ) ;
return result ; return result ;
} }
@ -282,17 +279,17 @@ namespace storm {
* @ return The probabilities for the satisfying phi until psi for each state of the model . If the * @ return The probabilities for the satisfying phi until psi for each state of the model . If the
* qualitative flag is set , exact probabilities might not be computed . * qualitative flag is set , exact probabilities might not be computed .
*/ */
static std : : pair < std : : vector < Type > , storm : : storage : : TotalScheduler > computeUnboundedUntilProbabilities ( bool minimize , storm : : storage : : SparseMatrix < Type > const & transitionMatrix , std : : vector < uint_fast64_t > nondeterministicChoiceIndices , st orm : : storage : : SparseMatrix < Type > const & backwardTransitions , storm : : storage : : BitVector const & initialStates , storm : : storage : : BitVector const & phiStates , storm : : storage : : BitVector const & psiStates , std : : shared_ptr < storm : : solver : : NondeterministicLinearEquationSolver < Type > > nondeterministicLinearEquationSolver , bool qualitative ) {
static std : : pair < std : : vector < Type > , storm : : storage : : TotalScheduler > computeUnboundedUntilProbabilities ( bool minimize , storm : : storage : : SparseMatrix < Type > const & transitionMatrix , storm : : storage : : SparseMatrix < Type > const & backwardTransitions , storm : : storage : : BitVector const & initialStates , storm : : storage : : BitVector const & phiStates , storm : : storage : : BitVector const & psiStates , std : : shared_ptr < storm : : solver : : NondeterministicLinearEquationSolver < Type > > nondeterministicLinearEquationSolver , bool qualitative ) {
size_t numberOfStates = phiStates . size ( ) ; size_t numberOfStates = phiStates . size ( ) ;
/ / We need to identify the states which have to be taken out of the matrix , i . e . / / We need to identify the states which have to be taken out of the matrix , i . e .
/ / all states that have probability 0 and 1 of satisfying the until - formula . / / all states that have probability 0 and 1 of satisfying the until - formula .
std : : pair < storm : : storage : : BitVector , storm : : storage : : BitVector > statesWithProbability01 ; std : : pair < storm : : storage : : BitVector , storm : : storage : : BitVector > statesWithProbability01 ;
if ( minimize ) { if ( minimize ) {
statesWithProbability01 = storm : : utility : : graph : : performProb01Min ( transitionMatrix , nondeterministicChoiceIndices , backwardTransitions , phiStates , psiStates ) ;
statesWithProbability01 = storm : : utility : : graph : : performProb01Min ( transitionMatrix , transitionMatrix . getRowGroupIndices ( ) , backwardTransitions , phiStates , psiStates ) ;
} else { } else {
statesWithProbability01 = storm : : utility : : graph : : performProb01Max ( transitionMatrix , nondeterministicChoiceIndices , backwardTransitions , phiStates , psiStates ) ;
statesWithProbability01 = storm : : utility : : graph : : performProb01Max ( transitionMatrix , transitionMatrix . getRowGroupIndices ( ) , backwardTransitions , phiStates , psiStates ) ;
} }
storm : : storage : : BitVector statesWithProbability0 = std : : move ( statesWithProbability01 . first ) ; storm : : storage : : BitVector statesWithProbability0 = std : : move ( statesWithProbability01 . first ) ;
storm : : storage : : BitVector statesWithProbability1 = std : : move ( statesWithProbability01 . second ) ; storm : : storage : : BitVector statesWithProbability1 = std : : move ( statesWithProbability01 . second ) ;
@ -322,18 +319,15 @@ namespace storm {
/ / whose probabilities are already known . / / whose probabilities are already known .
storm : : storage : : SparseMatrix < Type > submatrix = transitionMatrix . getSubmatrix ( true , maybeStates , maybeStates , false ) ; storm : : storage : : SparseMatrix < Type > submatrix = transitionMatrix . getSubmatrix ( true , maybeStates , maybeStates , false ) ;
/ / Get the " new " nondeterministic choice indices for the submatrix .
std : : vector < uint_fast64_t > subNondeterministicChoiceIndices = storm : : utility : : vector : : getConstrainedOffsetVector ( nondeterministicChoiceIndices , maybeStates ) ;
/ / Prepare the right - hand side of the equation system . For entry i this corresponds to / / Prepare the right - hand side of the equation system . For entry i this corresponds to
/ / the accumulated probability of going from state i to some ' yes ' state . / / the accumulated probability of going from state i to some ' yes ' state .
std : : vector < Type > b = transitionMatrix . getConstrainedRowGroupSumVector ( maybeStates , nondeterministicChoiceIndices , statesWithProbability1 ) ;
std : : vector < Type > b = transitionMatrix . getConstrainedRowGroupSumVector ( maybeStates , statesWithProbability1 ) ;
/ / Create vector for results for maybe states . / / Create vector for results for maybe states .
std : : vector < Type > x ( maybeStates . getNumberOfSetBits ( ) ) ; std : : vector < Type > x ( maybeStates . getNumberOfSetBits ( ) ) ;
/ / Solve the corresponding system of equations . / / Solve the corresponding system of equations .
nondeterministicLinearEquationSolver - > solveEquationSystem ( minimize , submatrix , x , b , subNondeterministicChoiceIndices ) ;
nondeterministicLinearEquationSolver - > solveEquationSystem ( minimize , submatrix , x , b ) ;
/ / Set values of resulting vector according to result . / / Set values of resulting vector according to result .
storm : : utility : : vector : : setVectorValues < Type > ( result , maybeStates , x ) ; storm : : utility : : vector : : setVectorValues < Type > ( result , maybeStates , x ) ;
@ -344,13 +338,13 @@ namespace storm {
storm : : utility : : vector : : setVectorValues < Type > ( result , statesWithProbability1 , storm : : utility : : constantOne < Type > ( ) ) ; storm : : utility : : vector : : setVectorValues < Type > ( result , statesWithProbability1 , storm : : utility : : constantOne < Type > ( ) ) ;
/ / Finally , compute a scheduler that achieves the extramal value . / / Finally , compute a scheduler that achieves the extramal value .
storm : : storage : : TotalScheduler scheduler = computeExtremalScheduler ( minimize , transitionMatrix , nondeterministicChoiceIndices , result ) ;
storm : : storage : : TotalScheduler scheduler = computeExtremalScheduler ( minimize , transitionMatrix , result ) ;
return std : : make_pair ( result , scheduler ) ; return std : : make_pair ( result , scheduler ) ;
} }
std : : pair < std : : vector < Type > , storm : : storage : : TotalScheduler > checkUntil ( bool minimize , storm : : storage : : BitVector const & phiStates , storm : : storage : : BitVector const & psiStates , bool qualitative ) const { std : : pair < std : : vector < Type > , storm : : storage : : TotalScheduler > checkUntil ( bool minimize , storm : : storage : : BitVector const & phiStates , storm : : storage : : BitVector const & psiStates , bool qualitative ) const {
return computeUnboundedUntilProbabilities ( minimize , this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getNondeterministicChoiceIndices ( ) , this - > getModel ( ) . get BackwardTransitions ( ) , this - > getModel ( ) . getInitialStates ( ) , phiStates , psiStates , this - > nondeterministicLinearEquationSolver , qualitative ) ;
return computeUnboundedUntilProbabilities ( minimize , this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , this - > getModel ( ) . getInitialStates ( ) , phiStates , psiStates , this - > nondeterministicLinearEquationSolver , qualitative ) ;
} }
/*! /*!
@ -374,7 +368,7 @@ namespace storm {
/ / Initialize result to state rewards of the model . / / Initialize result to state rewards of the model .
std : : vector < Type > result ( this - > getModel ( ) . getStateRewardVector ( ) ) ; std : : vector < Type > result ( this - > getModel ( ) . getStateRewardVector ( ) ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result , this - > getModel ( ) . getNondeterministicChoiceIndices ( ) , nullptr , formula . getBound ( ) ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result , nullptr , formula . getBound ( ) ) ;
return result ; return result ;
} }
@ -416,7 +410,7 @@ namespace storm {
result . resize ( this - > getModel ( ) . getNumberOfStates ( ) ) ; result . resize ( this - > getModel ( ) . getNumberOfStates ( ) ) ;
} }
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result , this - > getModel ( ) . getNondeterministicChoiceIndices ( ) , & totalRewardVector , formula . getBound ( ) ) ;
this - > nondeterministicLinearEquationSolver - > performMatrixVectorMultiplication ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result , & totalRewardVector , formula . getBound ( ) ) ;
return result ; return result ;
} }
@ -462,9 +456,9 @@ namespace storm {
storm : : storage : : BitVector infinityStates ; storm : : storage : : BitVector infinityStates ;
storm : : storage : : BitVector trueStates ( this - > getModel ( ) . getNumberOfStates ( ) , true ) ; storm : : storage : : BitVector trueStates ( this - > getModel ( ) . getNumberOfStates ( ) , true ) ;
if ( minimize ) { if ( minimize ) {
infinityStates = std : : move ( storm : : utility : : graph : : performProb1A ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , trueStates , targetStates ) ) ;
infinityStates = std : : move ( storm : : utility : : graph : : performProb1A ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , trueStates , targetStates ) ) ;
} else { } else {
infinityStates = std : : move ( storm : : utility : : graph : : performProb1E ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , trueStates , targetStates ) ) ;
infinityStates = std : : move ( storm : : utility : : graph : : performProb1E ( this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , this - > getModel ( ) . getBackwardTransitions ( ) , trueStates , targetStates ) ) ;
} }
infinityStates . complement ( ) ; infinityStates . complement ( ) ;
storm : : storage : : BitVector maybeStates = ~ targetStates & ~ infinityStates ; storm : : storage : : BitVector maybeStates = ~ targetStates & ~ infinityStates ;
@ -489,9 +483,6 @@ namespace storm {
/ / whose reward values are already known . / / whose reward values are already known .
storm : : storage : : SparseMatrix < Type > submatrix = this - > getModel ( ) . getTransitionMatrix ( ) . getSubmatrix ( true , maybeStates , maybeStates , false ) ; storm : : storage : : SparseMatrix < Type > submatrix = this - > getModel ( ) . getTransitionMatrix ( ) . getSubmatrix ( true , maybeStates , maybeStates , false ) ;
/ / Get the " new " nondeterministic choice indices for the submatrix .
std : : vector < uint_fast64_t > subNondeterministicChoiceIndices = storm : : utility : : vector : : getConstrainedOffsetVector ( this - > getModel ( ) . getNondeterministicChoiceIndices ( ) , maybeStates ) ;
/ / Prepare the right - hand side of the equation system . For entry i this corresponds to / / Prepare the right - hand side of the equation system . For entry i this corresponds to
/ / the accumulated probability of going from state i to some ' yes ' state . / / the accumulated probability of going from state i to some ' yes ' state .
std : : vector < Type > b ( submatrix . getRowCount ( ) ) ; std : : vector < Type > b ( submatrix . getRowCount ( ) ) ;
@ -501,7 +492,7 @@ namespace storm {
/ / side to the vector resulting from summing the rows of the pointwise product / / side to the vector resulting from summing the rows of the pointwise product
/ / of the transition probability matrix and the transition reward matrix . / / of the transition probability matrix and the transition reward matrix .
std : : vector < Type > pointwiseProductRowSumVector = this - > getModel ( ) . getTransitionMatrix ( ) . getPointwiseProductRowSumVector ( this - > getModel ( ) . getTransitionRewardMatrix ( ) ) ; std : : vector < Type > pointwiseProductRowSumVector = this - > getModel ( ) . getTransitionMatrix ( ) . getPointwiseProductRowSumVector ( this - > getModel ( ) . getTransitionRewardMatrix ( ) ) ;
storm : : utility : : vector : : selectVectorValues ( b , maybeStates , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , pointwiseProductRowSumVector ) ;
storm : : utility : : vector : : selectVectorValues ( b , maybeStates , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , pointwiseProductRowSumVector ) ;
if ( this - > getModel ( ) . hasStateRewards ( ) ) { if ( this - > getModel ( ) . hasStateRewards ( ) ) {
/ / If a state - based reward model is also available , we need to add this vector / / If a state - based reward model is also available , we need to add this vector
@ -509,7 +500,7 @@ namespace storm {
/ / that we still consider ( i . e . maybeStates ) , we need to extract these values / / that we still consider ( i . e . maybeStates ) , we need to extract these values
/ / first . / / first .
std : : vector < Type > subStateRewards ( b . size ( ) ) ; std : : vector < Type > subStateRewards ( b . size ( ) ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( subStateRewards , maybeStates , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , this - > getModel ( ) . getStateRewardVector ( ) ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( subStateRewards , maybeStates , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , this - > getModel ( ) . getStateRewardVector ( ) ) ;
storm : : utility : : vector : : addVectorsInPlace ( b , subStateRewards ) ; storm : : utility : : vector : : addVectorsInPlace ( b , subStateRewards ) ;
} }
} else { } else {
@ -517,14 +508,14 @@ namespace storm {
/ / right - hand side . As the state reward vector contains entries not just for the / / right - hand side . As the state reward vector contains entries not just for the
/ / states that we still consider ( i . e . maybeStates ) , we need to extract these values / / states that we still consider ( i . e . maybeStates ) , we need to extract these values
/ / first . / / first .
storm : : utility : : vector : : selectVectorValuesRepeatedly ( b , maybeStates , this - > getModel ( ) . getNondeterministicChoice Indices ( ) , this - > getModel ( ) . getStateRewardVector ( ) ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( b , maybeStates , this - > getModel ( ) . getTransitionMatrix ( ) . getRowGroup Indices ( ) , this - > getModel ( ) . getStateRewardVector ( ) ) ;
} }
/ / Create vector for results for maybe states . / / Create vector for results for maybe states .
std : : vector < Type > x ( maybeStates . getNumberOfSetBits ( ) ) ; std : : vector < Type > x ( maybeStates . getNumberOfSetBits ( ) ) ;
/ / Solve the corresponding system of equations . / / Solve the corresponding system of equations .
this - > nondeterministicLinearEquationSolver - > solveEquationSystem ( minimize , submatrix , x , b , subNondeterministicChoiceIndices ) ;
this - > nondeterministicLinearEquationSolver - > solveEquationSystem ( minimize , submatrix , x , b ) ;
/ / Set values of resulting vector according to result . / / Set values of resulting vector according to result .
storm : : utility : : vector : : setVectorValues < Type > ( result , maybeStates , x ) ; storm : : utility : : vector : : setVectorValues < Type > ( result , maybeStates , x ) ;
@ -535,7 +526,7 @@ namespace storm {
storm : : utility : : vector : : setVectorValues ( result , infinityStates , storm : : utility : : constantInfinity < Type > ( ) ) ; storm : : utility : : vector : : setVectorValues ( result , infinityStates , storm : : utility : : constantInfinity < Type > ( ) ) ;
/ / Finally , compute a scheduler that achieves the extramal value . / / Finally , compute a scheduler that achieves the extramal value .
storm : : storage : : TotalScheduler scheduler = computeExtremalScheduler ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , this - > getModel ( ) . getNondeterministicChoiceIndices ( ) , result , this - > getModel ( ) . hasStateRewards ( ) ? & this - > getModel ( ) . getStateRewardVector ( ) : nullptr , this - > getModel ( ) . hasTransitionRewards ( ) ? & this - > getModel ( ) . getTransitionRewardMatrix ( ) : nullptr ) ;
storm : : storage : : TotalScheduler scheduler = computeExtremalScheduler ( this - > minimumOperatorStack . top ( ) , this - > getModel ( ) . getTransitionMatrix ( ) , result , this - > getModel ( ) . hasStateRewards ( ) ? & this - > getModel ( ) . getStateRewardVector ( ) : nullptr , this - > getModel ( ) . hasTransitionRewards ( ) ? & this - > getModel ( ) . getTransitionRewardMatrix ( ) : nullptr ) ;
return std : : make_pair ( result , scheduler ) ; return std : : make_pair ( result , scheduler ) ;
} }
@ -547,9 +538,8 @@ namespace storm {
* @ param minimize If set , all choices are resolved such that the solution value becomes minimal and maximal otherwise . * @ param minimize If set , all choices are resolved such that the solution value becomes minimal and maximal otherwise .
* @ param nondeterministicResult The model checking result for nondeterministic choices of all states . * @ param nondeterministicResult The model checking result for nondeterministic choices of all states .
* @ param takenChoices The output vector that is to store the taken choices . * @ param takenChoices The output vector that is to store the taken choices .
* @ param nondeterministicChoiceIndices The assignment of states to their nondeterministic choices in the matrix .
*/ */
static storm : : storage : : TotalScheduler computeExtremalScheduler ( bool minimize , storm : : storage : : SparseMatrix < Type > const & transitionMatrix , std : : vector < uint_fast64_t > const & nondeterministicChoiceIndices , std : : vector < Type > const & result , std : : vector < Type > const * stateRewardVector = nullptr , storm : : storage : : SparseMatrix < Type > const * transitionRewardMatrix = nullptr ) {
static storm : : storage : : TotalScheduler computeExtremalScheduler ( bool minimize , storm : : storage : : SparseMatrix < Type > const & transitionMatrix , std : : vector < Type > const & result , std : : vector < Type > const * stateRewardVector = nullptr , storm : : storage : : SparseMatrix < Type > const * transitionRewardMatrix = nullptr ) {
std : : vector < Type > temporaryResult ( result . size ( ) ) ; std : : vector < Type > temporaryResult ( result . size ( ) ) ;
std : : vector < Type > nondeterministicResult ( transitionMatrix . getRowCount ( ) ) ; std : : vector < Type > nondeterministicResult ( transitionMatrix . getRowCount ( ) ) ;
transitionMatrix . multiplyWithVector ( result , nondeterministicResult ) ; transitionMatrix . multiplyWithVector ( result , nondeterministicResult ) ;
@ -560,12 +550,12 @@ namespace storm {
totalRewardVector = transitionMatrix . getPointwiseProductRowSumVector ( * transitionRewardMatrix ) ; totalRewardVector = transitionMatrix . getPointwiseProductRowSumVector ( * transitionRewardMatrix ) ;
if ( stateRewardVector ! = nullptr ) { if ( stateRewardVector ! = nullptr ) {
std : : vector < Type > stateRewards ( totalRewardVector . size ( ) ) ; std : : vector < Type > stateRewards ( totalRewardVector . size ( ) ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( stateRewards , storm : : storage : : BitVector ( stateRewardVector - > size ( ) , true ) , nondeterministicChoiceIndices , * stateRewardVector ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( stateRewards , storm : : storage : : BitVector ( stateRewardVector - > size ( ) , true ) , transitionMatrix . getRowGroupIndices ( ) , * stateRewardVector ) ;
storm : : utility : : vector : : addVectorsInPlace ( totalRewardVector , stateRewards ) ; storm : : utility : : vector : : addVectorsInPlace ( totalRewardVector , stateRewards ) ;
} }
} else { } else {
totalRewardVector . resize ( nondeterministicResult . size ( ) ) ; totalRewardVector . resize ( nondeterministicResult . size ( ) ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( totalRewardVector , storm : : storage : : BitVector ( stateRewardVector - > size ( ) , true ) , nondeterministicChoiceIndices , * stateRewardVector ) ;
storm : : utility : : vector : : selectVectorValuesRepeatedly ( totalRewardVector , storm : : storage : : BitVector ( stateRewardVector - > size ( ) , true ) , transitionMatrix . getRowGroupIndices ( ) , * stateRewardVector ) ;
} }
storm : : utility : : vector : : addVectorsInPlace ( nondeterministicResult , totalRewardVector ) ; storm : : utility : : vector : : addVectorsInPlace ( nondeterministicResult , totalRewardVector ) ;
} }
@ -573,9 +563,9 @@ namespace storm {
std : : vector < uint_fast64_t > choices ( result . size ( ) ) ; std : : vector < uint_fast64_t > choices ( result . size ( ) ) ;
if ( minimize ) { if ( minimize ) {
storm : : utility : : vector : : reduceVectorMin ( nondeterministicResult , temporaryResult , nondeterministicChoiceIndices , & choices ) ;
storm : : utility : : vector : : reduceVectorMin ( nondeterministicResult , temporaryResult , transitionMatrix . getRowGroupIndices ( ) , & choices ) ;
} else { } else {
storm : : utility : : vector : : reduceVectorMax ( nondeterministicResult , temporaryResult , nondeterministicChoiceIndices , & choices ) ;
storm : : utility : : vector : : reduceVectorMax ( nondeterministicResult , temporaryResult , transitionMatrix . getRowGroupIndices ( ) , & choices ) ;
} }
return storm : : storage : : TotalScheduler ( choices ) ; return storm : : storage : : TotalScheduler ( choices ) ;
dehnert
11 years ago