Made the prob0/1 algorithms for MDPs share a common backward transition object.

src/modelchecker/SparseMdpPrctlModelChecker.h

@@ -360,9 +360,9 @@ public:
 		storm::storage::BitVector infinityStates;
 		storm::storage::BitVector trueStates(this->getModel().getNumberOfStates(), true);
 		if (this->minimumOperatorStack.top()) {
-			infinityStates = storm::utility::GraphAnalyzer::performProb1A(this->getModel(), trueStates, *targetStates);
+			infinityStates = storm::utility::GraphAnalyzer::performProb1A(this->getModel(), this->getModel().getBackwardTransitions(), trueStates, *targetStates);
 		} else {
-			infinityStates = storm::utility::GraphAnalyzer::performProb1E(this->getModel(), trueStates, *targetStates);
+			infinityStates = storm::utility::GraphAnalyzer::performProb1E(this->getModel(), this->getModel().getBackwardTransitions(), trueStates, *targetStates);
 		}
 		infinityStates.complement();
 

src/utility/GraphAnalyzer.h

@@ -139,8 +139,12 @@ public:
 	template <typename T>
 	static std::pair<storm::storage::BitVector, storm::storage::BitVector> performProb01Max(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
 		std::pair<storm::storage::BitVector, storm::storage::BitVector> result;
-        result.first = GraphAnalyzer::performProb0A(model, phiStates, psiStates);
-		result.second = GraphAnalyzer::performProb1E(model, phiStates, psiStates);
+        
+        // Get the backwards transition relation from the model to ease the search.
+		storm::storage::SparseMatrix<bool> backwardTransitions = model.getBackwardTransitions();
+        
+        result.first = GraphAnalyzer::performProb0A(model, backwardTransitions, phiStates, psiStates);
+		result.second = GraphAnalyzer::performProb1E(model, backwardTransitions, phiStates, psiStates);
         return result;
 	}
 
@@ -151,18 +155,16 @@ public:
      * scheduler tries to maximize this probability.
      *
 	 * @param model The model whose graph structure to search.
+     * @param backwardTransitions The reversed transition relation of the model.
 	 * @param phiStates The set of all states satisfying phi.
 	 * @param psiStates The set of all states satisfying psi.
 	 * @return A bit vector that represents all states with probability 0.
 	 */
 	template <typename T>
-	static storm::storage::BitVector performProb0A(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
+	static storm::storage::BitVector performProb0A(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::SparseMatrix<bool> const& backwardTransitions, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
         // Prepare the resulting bit vector.
         storm::storage::BitVector statesWithProbability0(model.getNumberOfStates());
 
-		// Get the backwards transition relation from the model to ease the search.
-		storm::storage::SparseMatrix<bool> backwardTransitions = model.getBackwardTransitions();
-
 		// Add all psi states as the already satisfy the condition.
 		statesWithProbability0 |= psiStates;
 
@@ -196,19 +198,17 @@ public:
      * scheduler tries to maximize this probability.
      *
 	 * @param model The model whose graph structure to search.
+     * @param backwardTransitions The reversed transition relation of the model.
 	 * @param phiStates The set of all states satisfying phi.
 	 * @param psiStates The set of all states satisfying psi.
 	 * @return A bit vector that represents all states with probability 1.
 	 */
 	template <typename T>
-	static storm::storage::BitVector performProb1E(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
+	static storm::storage::BitVector performProb1E(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::SparseMatrix<bool> const& backwardTransitions, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
         // Get some temporaries for convenience.
 		std::shared_ptr<storm::storage::SparseMatrix<T>> transitionMatrix = model.getTransitionMatrix();
 		std::shared_ptr<std::vector<uint_fast64_t>> nondeterministicChoiceIndices = model.getNondeterministicChoiceIndices();
 
-		// Get the backwards transition relation from the model to ease the search.
-		storm::storage::SparseMatrix<bool> backwardTransitions = model.getBackwardTransitions();
-
 		storm::storage::BitVector currentStates(model.getNumberOfStates(), true);
 
 		std::vector<uint_fast64_t> stack;
@@ -274,8 +274,12 @@ public:
     template <typename T>
 	static std::pair<storm::storage::BitVector, storm::storage::BitVector> performProb01Min(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
 		std::pair<storm::storage::BitVector, storm::storage::BitVector> result;
-        result.first = GraphAnalyzer::performProb0E(model, phiStates, psiStates);
-		result.second = GraphAnalyzer::performProb1A(model, phiStates, psiStates);
+        
+        // Get the backwards transition relation from the model to ease the search.
+		storm::storage::SparseMatrix<bool> backwardTransitions = model.getBackwardTransitions();
+        
+        result.first = GraphAnalyzer::performProb0E(model, backwardTransitions, phiStates, psiStates);
+		result.second = GraphAnalyzer::performProb1A(model, backwardTransitions, phiStates, psiStates);
         return result;
 	}
 
@@ -286,12 +290,13 @@ public:
      * scheduler tries to minimize this probability.
      *
 	 * @param model The model whose graph structure to search.
+     * @param backwardTransitions The reversed transition relation of the model.
 	 * @param phiStates The set of all states satisfying phi.
 	 * @param psiStates The set of all states satisfying psi.
 	 * @return A bit vector that represents all states with probability 0.
 	 */
 	template <typename T>
-	static storm::storage::BitVector performProb0E(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
+	static storm::storage::BitVector performProb0E(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::SparseMatrix<bool> const& backwardTransitions, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
         // Prepare resulting bit vector.
         storm::storage::BitVector statesWithProbability0(model.getNumberOfStates());
         
@@ -299,9 +304,6 @@ public:
 		std::shared_ptr<storm::storage::SparseMatrix<T>> transitionMatrix = model.getTransitionMatrix();
 		std::shared_ptr<std::vector<uint_fast64_t>> nondeterministicChoiceIndices = model.getNondeterministicChoiceIndices();
 
-		// Get the backwards transition relation from the model to ease the search.
-		storm::storage::SparseMatrix<bool> backwardTransitions = model.getBackwardTransitions();
-
 		// Add all psi states as the already satisfy the condition.
 		statesWithProbability0 |= psiStates;
 
@@ -355,19 +357,17 @@ public:
      * scheduler tries to minimize this probability.
      *
 	 * @param model The model whose graph structure to search.
+     * @param backwardTransitions The reversed transition relation of the model.
 	 * @param phiStates The set of all states satisfying phi.
 	 * @param psiStates The set of all states satisfying psi.
 	 * @return A bit vector that represents all states with probability 0.
 	 */
 	template <typename T>
-	static storm::storage::BitVector performProb1A(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
+	static storm::storage::BitVector performProb1A(storm::models::AbstractNondeterministicModel<T> const& model, storm::storage::SparseMatrix<bool> const& backwardTransitions, storm::storage::BitVector const& phiStates, storm::storage::BitVector const& psiStates) {
 		// Get some temporaries for convenience.
 		std::shared_ptr<storm::storage::SparseMatrix<T>> transitionMatrix = model.getTransitionMatrix();
 		std::shared_ptr<std::vector<uint_fast64_t>> nondeterministicChoiceIndices = model.getNondeterministicChoiceIndices();
 
-		// Get the backwards transition relation from the model to ease the search.
-		storm::storage::SparseMatrix<bool> backwardTransitions = model.getBackwardTransitions();
-
 		storm::storage::BitVector currentStates(model.getNumberOfStates(), true);
 
 		std::vector<uint_fast64_t> stack;