You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
326 lines
24 KiB
326 lines
24 KiB
#include "gtest/gtest.h"
|
|
#include "storm-config.h"
|
|
|
|
#include "src/storage/dd/CuddDd.h"
|
|
#include "src/parser/PrismParser.h"
|
|
#include "src/models/symbolic/Dtmc.h"
|
|
#include "src/models/symbolic/Mdp.h"
|
|
#include "src/models/symbolic/StandardRewardModel.h"
|
|
#include "src/models/sparse/Dtmc.h"
|
|
#include "src/models/sparse/Mdp.h"
|
|
#include "src/models/sparse/StandardRewardModel.h"
|
|
#include "src/builder/DdPrismModelBuilder.h"
|
|
#include "src/builder/ExplicitPrismModelBuilder.h"
|
|
#include "src/utility/graph.h"
|
|
#include "src/storage/dd/CuddAdd.h"
|
|
#include "src/storage/dd/CuddBdd.h"
|
|
#include "src/storage/dd/CuddDdManager.h"
|
|
|
|
TEST(GraphTest, SymbolicProb01) {
|
|
storm::prism::Program program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/crowds-5-5.pm");
|
|
std::shared_ptr<storm::models::symbolic::Model<storm::dd::DdType::CUDD>> model = storm::builder::DdPrismModelBuilder<storm::dd::DdType::CUDD>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Dtmc);
|
|
|
|
std::pair<storm::dd::Bdd<storm::dd::DdType::CUDD>, storm::dd::Bdd<storm::dd::DdType::CUDD>> statesWithProbability01;
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01(*model->as<storm::models::symbolic::Dtmc<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("observe0Greater1")));
|
|
EXPECT_EQ(4409ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(1316ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01(*model->as<storm::models::symbolic::Dtmc<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("observeIGreater1")));
|
|
EXPECT_EQ(1091ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(4802ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01(*model->as<storm::models::symbolic::Dtmc<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("observeOnlyTrueSender")));
|
|
EXPECT_EQ(5829ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(1032ul, statesWithProbability01.second.getNonZeroCount());
|
|
}
|
|
|
|
TEST(GraphTest, SymbolicProb01MinMax) {
|
|
storm::prism::Program program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/leader3.nm");
|
|
std::shared_ptr<storm::models::symbolic::Model<storm::dd::DdType::CUDD>> model = storm::builder::DdPrismModelBuilder<storm::dd::DdType::CUDD>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Mdp);
|
|
|
|
std::pair<storm::dd::Bdd<storm::dd::DdType::CUDD>, storm::dd::Bdd<storm::dd::DdType::CUDD>> statesWithProbability01;
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("elected")));
|
|
EXPECT_EQ(0ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(364ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("elected")));
|
|
EXPECT_EQ(0ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(364ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/coin2-2.nm");
|
|
model = storm::builder::DdPrismModelBuilder<storm::dd::DdType::CUDD>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Mdp);
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("all_coins_equal_0")));
|
|
EXPECT_EQ(77ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(149ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("all_coins_equal_0")));
|
|
EXPECT_EQ(74ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(198ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("all_coins_equal_1")));
|
|
EXPECT_EQ(94ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(33ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("all_coins_equal_1")));
|
|
EXPECT_EQ(83ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(35ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/csma2-2.nm");
|
|
model = storm::builder::DdPrismModelBuilder<storm::dd::DdType::CUDD>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Mdp);
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("collision_max_backoff")));
|
|
EXPECT_EQ(993ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(16ul, statesWithProbability01.second.getNonZeroCount());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::symbolic::Mdp<storm::dd::DdType::CUDD>>(), model->getReachableStates(), model->getStates("collision_max_backoff")));
|
|
EXPECT_EQ(993ul, statesWithProbability01.first.getNonZeroCount());
|
|
EXPECT_EQ(16ul, statesWithProbability01.second.getNonZeroCount());
|
|
}
|
|
|
|
#ifdef STORM_HAVE_MSAT
|
|
|
|
#include "src/storage/prism/menu_games/AbstractProgram.h"
|
|
|
|
#include "src/storage/expressions/Expression.h"
|
|
|
|
#include "src/utility/solver.h"
|
|
|
|
TEST(GraphTest, SymbolicProb01StochasticGameDieSmall) {
|
|
storm::prism::Program program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/die.pm");
|
|
|
|
std::vector<storm::expressions::Expression> initialPredicates;
|
|
storm::expressions::ExpressionManager& manager = program.getManager();
|
|
|
|
initialPredicates.push_back(manager.getVariableExpression("s") < manager.integer(3));
|
|
|
|
storm::prism::menu_games::AbstractProgram<storm::dd::DdType::CUDD, double> abstractProgram(program.getManager(), program, initialPredicates, std::make_unique<storm::utility::solver::MathsatSmtSolverFactory>(), false);
|
|
|
|
storm::prism::menu_games::MenuGame<storm::dd::DdType::CUDD> game = abstractProgram.getAbstractGame();
|
|
|
|
game.getQualitativeTransitionMatrix().toAdd().exportToDot("trans.dot");
|
|
|
|
// The target states are those states where !(s < 3).
|
|
storm::dd::Bdd<storm::dd::DdType::CUDD> targetStates = game.getStates(initialPredicates[0], true);
|
|
|
|
storm::utility::graph::GameProb01Result<storm::dd::DdType::CUDD> result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
EXPECT_TRUE(static_cast<bool>(result.player1Strategy));
|
|
EXPECT_TRUE(static_cast<bool>(result.player2Strategy));
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(0, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(2, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(0, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(2, result.states.getNonZeroCount());
|
|
|
|
EXPECT_TRUE(static_cast<bool>(result.player1Strategy));
|
|
EXPECT_TRUE(static_cast<bool>(result.player2Strategy));
|
|
|
|
result.player1Strategy.get().toAdd().exportToDot("player1.dot");
|
|
result.player2Strategy.get().toAdd().exportToDot("player2.dot");
|
|
exit(-1);
|
|
|
|
abstractProgram.refine({manager.getVariableExpression("s") < manager.integer(2)});
|
|
game = abstractProgram.getAbstractGame();
|
|
|
|
// We need to create a new BDD for the target states since the reachable states might have changed.
|
|
targetStates = game.getStates(initialPredicates[0], true);
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(0, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(3, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(0, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(3, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(0, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(3, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(0, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(3, result.states.getNonZeroCount());
|
|
}
|
|
|
|
TEST(GraphTest, SymbolicProb01StochasticGameTwoDice) {
|
|
storm::prism::Program program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/two_dice.nm");
|
|
program = program.substituteConstants();
|
|
program = program.flattenModules(std::make_unique<storm::utility::solver::MathsatSmtSolverFactory>());
|
|
|
|
std::vector<storm::expressions::Expression> initialPredicates;
|
|
storm::expressions::ExpressionManager& manager = program.getManager();
|
|
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(0));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(1));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(2));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(3));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(4));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(5));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(6));
|
|
initialPredicates.push_back(manager.getVariableExpression("s1") == manager.integer(7));
|
|
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(0));
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(1));
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(2));
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(3));
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(4));
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(5));
|
|
initialPredicates.push_back(manager.getVariableExpression("d1") == manager.integer(6));
|
|
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(0));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(1));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(2));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(3));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(4));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(5));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(6));
|
|
initialPredicates.push_back(manager.getVariableExpression("s2") == manager.integer(7));
|
|
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(0));
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(1));
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(2));
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(3));
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(4));
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(5));
|
|
initialPredicates.push_back(manager.getVariableExpression("d2") == manager.integer(6));
|
|
|
|
storm::prism::menu_games::AbstractProgram<storm::dd::DdType::CUDD, double> abstractProgram(program.getManager(), program, initialPredicates, std::make_unique<storm::utility::solver::MathsatSmtSolverFactory>(), false);
|
|
|
|
storm::prism::menu_games::MenuGame<storm::dd::DdType::CUDD> game = abstractProgram.getAbstractGame();
|
|
|
|
// The target states are those states where s1 == 7 & s2 == 7 & d1 + d2 == 1.
|
|
storm::dd::Bdd<storm::dd::DdType::CUDD> targetStates = game.getStates(initialPredicates[7], false) && game.getStates(initialPredicates[22], false) && game.getStates(initialPredicates[9], false) && game.getStates(initialPredicates[24], false);
|
|
|
|
storm::utility::graph::GameProb01Result<storm::dd::DdType::CUDD> result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Minimize);
|
|
EXPECT_EQ(153, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(153, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Minimize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(153, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Minimize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb0(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(153, result.states.getNonZeroCount());
|
|
|
|
result = storm::utility::graph::performProb1(game, game.getQualitativeTransitionMatrix(), game.getReachableStates(), targetStates, storm::OptimizationDirection::Maximize, storm::OptimizationDirection::Maximize, true);
|
|
EXPECT_EQ(1, result.states.getNonZeroCount());
|
|
}
|
|
|
|
#endif
|
|
|
|
TEST(GraphTest, ExplicitProb01) {
|
|
storm::prism::Program program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/crowds-5-5.pm");
|
|
std::shared_ptr<storm::models::sparse::Model<double>> model = storm::builder::ExplicitPrismModelBuilder<double>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Dtmc);
|
|
|
|
std::pair<storm::storage::BitVector, storm::storage::BitVector> statesWithProbability01;
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01(*model->as<storm::models::sparse::Dtmc<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("observe0Greater1")));
|
|
EXPECT_EQ(4409ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(1316ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01(*model->as<storm::models::sparse::Dtmc<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("observeIGreater1")));
|
|
EXPECT_EQ(1091ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(4802ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01(*model->as<storm::models::sparse::Dtmc<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("observeOnlyTrueSender")));
|
|
EXPECT_EQ(5829ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(1032ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
}
|
|
|
|
TEST(GraphTest, ExplicitProb01MinMax) {
|
|
storm::prism::Program program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/leader3.nm");
|
|
std::shared_ptr<storm::models::sparse::Model<double>> model = storm::builder::ExplicitPrismModelBuilder<double>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Mdp);
|
|
|
|
std::pair<storm::storage::BitVector, storm::storage::BitVector> statesWithProbability01;
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("elected")));
|
|
EXPECT_EQ(0ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(364ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("elected")));
|
|
EXPECT_EQ(0ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(364ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/coin2-2.nm");
|
|
model = storm::builder::ExplicitPrismModelBuilder<double>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Mdp);
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("all_coins_equal_0")));
|
|
EXPECT_EQ(77ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(149ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("all_coins_equal_0")));
|
|
EXPECT_EQ(74ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(198ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("all_coins_equal_1")));
|
|
EXPECT_EQ(94ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(33ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("all_coins_equal_1")));
|
|
EXPECT_EQ(83ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(35ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
program = storm::parser::PrismParser::parse(STORM_CPP_TESTS_BASE_PATH "/functional/builder/csma2-2.nm");
|
|
model = storm::builder::ExplicitPrismModelBuilder<double>::translateProgram(program);
|
|
|
|
ASSERT_TRUE(model->getType() == storm::models::ModelType::Mdp);
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Min(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("collision_max_backoff")));
|
|
EXPECT_EQ(993ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(16ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
|
|
ASSERT_NO_THROW(statesWithProbability01 = storm::utility::graph::performProb01Max(*model->as<storm::models::sparse::Mdp<double>>(), storm::storage::BitVector(model->getNumberOfStates(), true), model->getStates("collision_max_backoff")));
|
|
EXPECT_EQ(993ul, statesWithProbability01.first.getNumberOfSetBits());
|
|
EXPECT_EQ(16ul, statesWithProbability01.second.getNumberOfSetBits());
|
|
}
|