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.
178 lines
8.8 KiB
178 lines
8.8 KiB
#include "gtest/gtest.h"
|
|
#include "storm-config.h"
|
|
#include "storm/parser/AutoParser.h"
|
|
#include "storm/storage/MaximalEndComponentDecomposition.h"
|
|
#include "storm/models/sparse/MarkovAutomaton.h"
|
|
#include "storm/models/sparse/Mdp.h"
|
|
#include "storm/models/sparse/StandardRewardModel.h"
|
|
#include "storm/builder/ExplicitModelBuilder.h"
|
|
#include "storm/storage/SymbolicModelDescription.h"
|
|
#include "storm/parser/PrismParser.h"
|
|
|
|
TEST(MaximalEndComponentDecomposition, FullSystem1) {
|
|
std::shared_ptr<storm::models::sparse::Model<double>> abstractModel = storm::parser::AutoParser<>::parseModel(STORM_TEST_RESOURCES_DIR "/tra/tiny1.tra", STORM_TEST_RESOURCES_DIR "/lab/tiny1.lab", "", "");
|
|
|
|
std::shared_ptr<storm::models::sparse::MarkovAutomaton<double>> markovAutomaton = abstractModel->as<storm::models::sparse::MarkovAutomaton<double>>();
|
|
|
|
storm::storage::MaximalEndComponentDecomposition<double> mecDecomposition;
|
|
ASSERT_NO_THROW(mecDecomposition = storm::storage::MaximalEndComponentDecomposition<double>(*markovAutomaton));
|
|
|
|
ASSERT_EQ(2ul, mecDecomposition.size());
|
|
|
|
// Now, because there is no ordering we have to check the contents of the MECs in a symmetrical way.
|
|
storm::storage::MaximalEndComponent const& mec1 = mecDecomposition[0];
|
|
if (mec1.containsState(3)) {
|
|
ASSERT_TRUE(mec1.containsState(8));
|
|
ASSERT_TRUE(mec1.containsState(9));
|
|
ASSERT_TRUE(mec1.containsState(10));
|
|
ASSERT_FALSE(mec1.containsState(0));
|
|
ASSERT_FALSE(mec1.containsState(1));
|
|
ASSERT_FALSE(mec1.containsState(2));
|
|
ASSERT_FALSE(mec1.containsState(4));
|
|
ASSERT_FALSE(mec1.containsState(5));
|
|
ASSERT_FALSE(mec1.containsState(6));
|
|
ASSERT_FALSE(mec1.containsState(7));
|
|
} else if (mec1.containsState(4)) {
|
|
ASSERT_TRUE(mec1.containsState(5));
|
|
ASSERT_TRUE(mec1.containsState(6));
|
|
ASSERT_TRUE(mec1.containsState(7));
|
|
ASSERT_FALSE(mec1.containsState(0));
|
|
ASSERT_FALSE(mec1.containsState(1));
|
|
ASSERT_FALSE(mec1.containsState(2));
|
|
ASSERT_FALSE(mec1.containsState(3));
|
|
ASSERT_FALSE(mec1.containsState(8));
|
|
ASSERT_FALSE(mec1.containsState(9));
|
|
ASSERT_FALSE(mec1.containsState(10));
|
|
} else {
|
|
// This case must never happen as the only two existing MECs contain either 3 or 4.
|
|
ASSERT_TRUE(false);
|
|
}
|
|
|
|
storm::storage::MaximalEndComponent const& mec2 = mecDecomposition[1];
|
|
if (mec2.containsState(3)) {
|
|
ASSERT_TRUE(mec2.containsState(8));
|
|
ASSERT_TRUE(mec2.containsState(9));
|
|
ASSERT_TRUE(mec2.containsState(10));
|
|
ASSERT_FALSE(mec2.containsState(0));
|
|
ASSERT_FALSE(mec2.containsState(1));
|
|
ASSERT_FALSE(mec2.containsState(2));
|
|
ASSERT_FALSE(mec2.containsState(4));
|
|
ASSERT_FALSE(mec2.containsState(5));
|
|
ASSERT_FALSE(mec2.containsState(6));
|
|
ASSERT_FALSE(mec2.containsState(7));
|
|
} else if (mec2.containsState(4)) {
|
|
ASSERT_TRUE(mec2.containsState(5));
|
|
ASSERT_TRUE(mec2.containsState(6));
|
|
ASSERT_TRUE(mec2.containsState(7));
|
|
ASSERT_FALSE(mec2.containsState(0));
|
|
ASSERT_FALSE(mec2.containsState(1));
|
|
ASSERT_FALSE(mec2.containsState(2));
|
|
ASSERT_FALSE(mec2.containsState(3));
|
|
ASSERT_FALSE(mec2.containsState(8));
|
|
ASSERT_FALSE(mec2.containsState(9));
|
|
ASSERT_FALSE(mec2.containsState(10));
|
|
} else {
|
|
// This case must never happen as the only two existing MECs contain either 3 or 4.
|
|
ASSERT_TRUE(false);
|
|
}
|
|
}
|
|
|
|
TEST(MaximalEndComponentDecomposition, FullSystem2) {
|
|
std::shared_ptr<storm::models::sparse::Model<double>> abstractModel = storm::parser::AutoParser<>::parseModel(STORM_TEST_RESOURCES_DIR "/tra/tiny2.tra", STORM_TEST_RESOURCES_DIR "/lab/tiny2.lab", "", "");
|
|
|
|
std::shared_ptr<storm::models::sparse::MarkovAutomaton<double>> markovAutomaton = abstractModel->as<storm::models::sparse::MarkovAutomaton<double>>();
|
|
|
|
storm::storage::MaximalEndComponentDecomposition<double> mecDecomposition;
|
|
ASSERT_NO_THROW(mecDecomposition = storm::storage::MaximalEndComponentDecomposition<double>(*markovAutomaton));
|
|
|
|
ASSERT_EQ(1ul, mecDecomposition.size());
|
|
|
|
// Now, because there is no ordering we have to check the contents of the MECs in a symmetrical way.
|
|
storm::storage::MaximalEndComponent const& mec1 = mecDecomposition[0];
|
|
if (mec1.containsState(4)) {
|
|
ASSERT_TRUE(mec1.containsState(5));
|
|
ASSERT_TRUE(mec1.containsState(6));
|
|
ASSERT_TRUE(mec1.containsState(7));
|
|
ASSERT_FALSE(mec1.containsState(0));
|
|
ASSERT_FALSE(mec1.containsState(1));
|
|
ASSERT_FALSE(mec1.containsState(2));
|
|
ASSERT_FALSE(mec1.containsState(3));
|
|
ASSERT_FALSE(mec1.containsState(8));
|
|
ASSERT_FALSE(mec1.containsState(9));
|
|
ASSERT_FALSE(mec1.containsState(10));
|
|
} else {
|
|
// This case must never happen as the only two existing MECs contain 4.
|
|
ASSERT_TRUE(false);
|
|
}
|
|
}
|
|
|
|
TEST(MaximalEndComponentDecomposition, Subsystem) {
|
|
std::shared_ptr<storm::models::sparse::Model<double>> abstractModel = storm::parser::AutoParser<>::parseModel(STORM_TEST_RESOURCES_DIR "/tra/tiny1.tra", STORM_TEST_RESOURCES_DIR "/lab/tiny1.lab", "", "");
|
|
|
|
std::shared_ptr<storm::models::sparse::MarkovAutomaton<double>> markovAutomaton = abstractModel->as<storm::models::sparse::MarkovAutomaton<double>>();
|
|
|
|
storm::storage::BitVector subsystem(markovAutomaton->getNumberOfStates(), true);
|
|
subsystem.set(7, false);
|
|
|
|
storm::storage::MaximalEndComponentDecomposition<double> mecDecomposition;
|
|
ASSERT_NO_THROW(mecDecomposition = storm::storage::MaximalEndComponentDecomposition<double>(*markovAutomaton, subsystem));
|
|
|
|
ASSERT_EQ(1ul, mecDecomposition.size());
|
|
|
|
storm::storage::MaximalEndComponent const& mec1 = mecDecomposition[0];
|
|
|
|
if (mec1.containsState(3)) {
|
|
ASSERT_TRUE(mec1.containsState(8));
|
|
ASSERT_TRUE(mec1.containsState(9));
|
|
ASSERT_TRUE(mec1.containsState(10));
|
|
ASSERT_FALSE(mec1.containsState(0));
|
|
ASSERT_FALSE(mec1.containsState(1));
|
|
ASSERT_FALSE(mec1.containsState(2));
|
|
ASSERT_FALSE(mec1.containsState(4));
|
|
ASSERT_FALSE(mec1.containsState(5));
|
|
ASSERT_FALSE(mec1.containsState(6));
|
|
ASSERT_FALSE(mec1.containsState(7));
|
|
} else {
|
|
// This case must never happen as the only two existing MEC contains 3.
|
|
ASSERT_TRUE(false);
|
|
}
|
|
}
|
|
|
|
TEST(MaximalEndComponentDecomposition, Example1) {
|
|
std::string prismModelPath = STORM_TEST_RESOURCES_DIR "/mdp/prism-mec-example1.nm";
|
|
storm::storage::SymbolicModelDescription modelDescription = storm::parser::PrismParser::parse(prismModelPath);
|
|
storm::prism::Program program = modelDescription.preprocess().asPrismProgram();
|
|
|
|
std::shared_ptr<storm::models::sparse::Model<double>> model = storm::builder::ExplicitModelBuilder<double>(program).build();
|
|
std::shared_ptr<storm::models::sparse::Mdp<double>> mdp = model->as<storm::models::sparse::Mdp<double>>();
|
|
|
|
storm::storage::MaximalEndComponentDecomposition<double> mecDecomposition(*mdp);
|
|
|
|
EXPECT_EQ(mecDecomposition.size(), 2);
|
|
|
|
ASSERT_TRUE(mecDecomposition[0].getStateSet() == storm::storage::MaximalEndComponent::set_type{2});
|
|
EXPECT_TRUE(mecDecomposition[0].getChoicesForState(2) == storm::storage::MaximalEndComponent::set_type{3});
|
|
|
|
ASSERT_TRUE(mecDecomposition[1].getStateSet() == storm::storage::MaximalEndComponent::set_type{0});
|
|
EXPECT_TRUE(mecDecomposition[1].getChoicesForState(0) == storm::storage::MaximalEndComponent::set_type{0});
|
|
}
|
|
|
|
TEST(MaximalEndComponentDecomposition, Example2) {
|
|
std::string prismModelPath = STORM_TEST_RESOURCES_DIR "/mdp/prism-mec-example2.nm";
|
|
storm::storage::SymbolicModelDescription modelDescription = storm::parser::PrismParser::parse(prismModelPath);
|
|
storm::prism::Program program = modelDescription.preprocess().asPrismProgram();
|
|
|
|
std::shared_ptr<storm::models::sparse::Model<double>> model = storm::builder::ExplicitModelBuilder<double>(program).build();
|
|
std::shared_ptr<storm::models::sparse::Mdp<double>> mdp = model->as<storm::models::sparse::Mdp<double>>();
|
|
|
|
storm::storage::MaximalEndComponentDecomposition<double> mecDecomposition(*mdp);
|
|
|
|
EXPECT_EQ(mecDecomposition.size(), 2);
|
|
|
|
ASSERT_TRUE(mecDecomposition[0].getStateSet() == storm::storage::MaximalEndComponent::set_type{2});
|
|
EXPECT_TRUE(mecDecomposition[0].getChoicesForState(2) == storm::storage::MaximalEndComponent::set_type{4});
|
|
|
|
ASSERT_TRUE((mecDecomposition[1].getStateSet() == storm::storage::MaximalEndComponent::set_type{0, 1}));
|
|
EXPECT_TRUE((mecDecomposition[1].getChoicesForState(0) == storm::storage::MaximalEndComponent::set_type{0, 1}));
|
|
EXPECT_TRUE((mecDecomposition[1].getChoicesForState(1) == storm::storage::MaximalEndComponent::set_type{3}));
|
|
}
|