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.
211 lines
8.4 KiB
211 lines
8.4 KiB
/*
|
|
* MarkovAutomatonParserTest.cpp
|
|
*
|
|
* Created on: 03.12.2013
|
|
* Author: Manuel Sascha Weiand
|
|
*/
|
|
|
|
#include "gtest/gtest.h"
|
|
#include "storm-config.h"
|
|
#include "src/settings/SettingsManager.h"
|
|
|
|
#include <vector>
|
|
|
|
#include "src/parser/MarkovAutomatonSparseTransitionParser.h"
|
|
#include "src/utility/cstring.h"
|
|
#include "src/parser/MarkovAutomatonParser.h"
|
|
#include "src/settings/SettingMemento.h"
|
|
#include "src/exceptions/WrongFormatException.h"
|
|
#include "src/exceptions/FileIoException.h"
|
|
|
|
#define STATE_COUNT 6
|
|
#define CHOICE_COUNT 7
|
|
|
|
TEST(MarkovAutomatonSparseTransitionParserTest, NonExistingFile) {
|
|
|
|
// No matter what happens, please do NOT create a file with the name "nonExistingFile.not"!
|
|
ASSERT_THROW(storm::parser::MarkovAutomatonSparseTransitionParser::parseMarkovAutomatonTransitions(STORM_CPP_TESTS_BASE_PATH "/nonExistingFile.not"), storm::exceptions::FileIoException);
|
|
}
|
|
|
|
TEST(MarkovAutomatonSparseTransitionParserTest, BasicParsing) {
|
|
|
|
// The file that will be used for the test.
|
|
std::string filename = STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_general.tra";
|
|
|
|
// Execute the parser.
|
|
storm::parser::MarkovAutomatonSparseTransitionParser::Result result = storm::parser::MarkovAutomatonSparseTransitionParser::parseMarkovAutomatonTransitions(filename);
|
|
|
|
// Build the actual transition matrix.
|
|
storm::storage::SparseMatrix<double> transitionMatrix(result.transitionMatrixBuilder.build(0,0));
|
|
|
|
// Test all sizes and counts.
|
|
ASSERT_EQ(STATE_COUNT, transitionMatrix.getColumnCount());
|
|
ASSERT_EQ(CHOICE_COUNT, transitionMatrix.getRowCount());
|
|
ASSERT_EQ(12, transitionMatrix.getEntryCount());
|
|
ASSERT_EQ(6, transitionMatrix.getRowGroupCount());
|
|
ASSERT_EQ(7, transitionMatrix.getRowGroupIndices().size());
|
|
ASSERT_EQ(CHOICE_COUNT, result.markovianChoices.size());
|
|
ASSERT_EQ(STATE_COUNT, result.markovianStates.size());
|
|
ASSERT_EQ(2, result.markovianStates.getNumberOfSetBits());
|
|
ASSERT_EQ(STATE_COUNT, result.exitRates.size());
|
|
|
|
// Test the general structure of the transition system (that will be an Markov automaton).
|
|
|
|
// Test the mapping between states and transition matrix rows.
|
|
ASSERT_EQ(0, transitionMatrix.getRowGroupIndices()[0]);
|
|
ASSERT_EQ(1, transitionMatrix.getRowGroupIndices()[1]);
|
|
ASSERT_EQ(2, transitionMatrix.getRowGroupIndices()[2]);
|
|
ASSERT_EQ(3, transitionMatrix.getRowGroupIndices()[3]);
|
|
ASSERT_EQ(4, transitionMatrix.getRowGroupIndices()[4]);
|
|
ASSERT_EQ(6, transitionMatrix.getRowGroupIndices()[5]);
|
|
ASSERT_EQ(7, transitionMatrix.getRowGroupIndices()[6]);
|
|
|
|
// Test the Markovian states.
|
|
ASSERT_TRUE(result.markovianStates.get(0));
|
|
ASSERT_FALSE(result.markovianStates.get(1));
|
|
ASSERT_TRUE(result.markovianStates.get(2));
|
|
ASSERT_FALSE(result.markovianStates.get(3));
|
|
ASSERT_FALSE(result.markovianStates.get(4));
|
|
ASSERT_FALSE(result.markovianStates.get(5));
|
|
|
|
// Test the exit rates. These have to be 0 for all non-Markovian states.
|
|
ASSERT_EQ(2, result.exitRates[0]);
|
|
ASSERT_EQ(0, result.exitRates[1]);
|
|
ASSERT_EQ(15, result.exitRates[2]);
|
|
ASSERT_EQ(0, result.exitRates[3]);
|
|
ASSERT_EQ(0, result.exitRates[4]);
|
|
ASSERT_EQ(0, result.exitRates[5]);
|
|
|
|
// Finally, test the transition matrix itself.
|
|
storm::storage::SparseMatrix<double>::const_iterator cIter = transitionMatrix.begin(0);
|
|
|
|
ASSERT_EQ(2, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(2, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(4, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(8, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(transitionMatrix.end(), cIter);
|
|
}
|
|
|
|
TEST(MarkovAutomatonSparseTransitionParserTest, Whitespaces) {
|
|
// The file that will be used for the test.
|
|
std::string filename = STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_whitespaces.tra";
|
|
|
|
// Execute the parser.
|
|
storm::parser::MarkovAutomatonSparseTransitionParser::Result result = storm::parser::MarkovAutomatonSparseTransitionParser::parseMarkovAutomatonTransitions(filename);
|
|
|
|
// Build the actual transition matrix.
|
|
storm::storage::SparseMatrix<double> transitionMatrix(result.transitionMatrixBuilder.build());
|
|
|
|
// Test all sizes and counts.
|
|
ASSERT_EQ(STATE_COUNT, transitionMatrix.getColumnCount());
|
|
ASSERT_EQ(CHOICE_COUNT, transitionMatrix.getRowCount());
|
|
ASSERT_EQ(12, transitionMatrix.getEntryCount());
|
|
ASSERT_EQ(6, transitionMatrix.getRowGroupCount());
|
|
ASSERT_EQ(7, transitionMatrix.getRowGroupIndices().size());
|
|
ASSERT_EQ(CHOICE_COUNT, result.markovianChoices.size());
|
|
ASSERT_EQ(STATE_COUNT, result.markovianStates.size());
|
|
ASSERT_EQ(2, result.markovianStates.getNumberOfSetBits());
|
|
ASSERT_EQ(STATE_COUNT, result.exitRates.size());
|
|
|
|
// Test the general structure of the transition system (that will be an Markov automaton).
|
|
|
|
// Test the mapping between states and transition matrix rows.
|
|
ASSERT_EQ(0, transitionMatrix.getRowGroupIndices()[0]);
|
|
ASSERT_EQ(1, transitionMatrix.getRowGroupIndices()[1]);
|
|
ASSERT_EQ(2, transitionMatrix.getRowGroupIndices()[2]);
|
|
ASSERT_EQ(3, transitionMatrix.getRowGroupIndices()[3]);
|
|
ASSERT_EQ(4, transitionMatrix.getRowGroupIndices()[4]);
|
|
ASSERT_EQ(6, transitionMatrix.getRowGroupIndices()[5]);
|
|
ASSERT_EQ(7, transitionMatrix.getRowGroupIndices()[6]);
|
|
|
|
// Test the Markovian states.
|
|
ASSERT_TRUE(result.markovianStates.get(0));
|
|
ASSERT_FALSE(result.markovianStates.get(1));
|
|
ASSERT_TRUE(result.markovianStates.get(2));
|
|
ASSERT_FALSE(result.markovianStates.get(3));
|
|
ASSERT_FALSE(result.markovianStates.get(4));
|
|
ASSERT_FALSE(result.markovianStates.get(5));
|
|
|
|
// Test the exit rates. These have to be 0 for all non-Markovian states.
|
|
ASSERT_EQ(2, result.exitRates[0]);
|
|
ASSERT_EQ(0, result.exitRates[1]);
|
|
ASSERT_EQ(15, result.exitRates[2]);
|
|
ASSERT_EQ(0, result.exitRates[3]);
|
|
ASSERT_EQ(0, result.exitRates[4]);
|
|
ASSERT_EQ(0, result.exitRates[5]);
|
|
|
|
// Finally, test the transition matrix itself.
|
|
storm::storage::SparseMatrix<double>::const_iterator cIter = transitionMatrix.begin(0);
|
|
|
|
ASSERT_EQ(2, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(2, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(4, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(8, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(0.5, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(1, cIter->getValue());
|
|
cIter++;
|
|
ASSERT_EQ(transitionMatrix.end(), cIter);
|
|
}
|
|
|
|
TEST(MarkovAutomatonSparseTransitionParserTest, FixDeadlocks) {
|
|
// Set the fixDeadlocks flag temporarily. It is set to its old value once the deadlockOption object is destructed.
|
|
std::unique_ptr<storm::settings::SettingMemento> fixDeadlocks = storm::settings::mutableGeneralSettings().overrideDontFixDeadlocksSet(false);
|
|
|
|
// Parse a Markov Automaton transition file with the fixDeadlocks Flag set and test if it works.
|
|
storm::parser::MarkovAutomatonSparseTransitionParser::Result result = storm::parser::MarkovAutomatonSparseTransitionParser::parseMarkovAutomatonTransitions(STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_deadlock.tra");
|
|
|
|
// Test if the result is consistent with the parsed Markov Automaton.
|
|
storm::storage::SparseMatrix<double> resultMatrix(result.transitionMatrixBuilder.build());
|
|
ASSERT_EQ(STATE_COUNT + 1, resultMatrix.getColumnCount());
|
|
ASSERT_EQ(13, resultMatrix.getEntryCount());
|
|
ASSERT_EQ(7, resultMatrix.getRowGroupCount());
|
|
ASSERT_EQ(8, resultMatrix.getRowGroupIndices().size());
|
|
ASSERT_EQ(CHOICE_COUNT +1, result.markovianChoices.size());
|
|
ASSERT_EQ(STATE_COUNT +1, result.markovianStates.size());
|
|
ASSERT_EQ(2, result.markovianStates.getNumberOfSetBits());
|
|
ASSERT_EQ(STATE_COUNT + 1, result.exitRates.size());
|
|
}
|
|
|
|
TEST(MarkovAutomatonSparseTransitionParserTest, DontFixDeadlocks) {
|
|
// Try to parse a Markov Automaton transition file containing a deadlock state with the fixDeadlocksFlag unset. This should throw an exception.
|
|
std::unique_ptr<storm::settings::SettingMemento> dontFixDeadlocks = storm::settings::mutableGeneralSettings().overrideDontFixDeadlocksSet(true);
|
|
|
|
ASSERT_THROW(storm::parser::MarkovAutomatonSparseTransitionParser::parseMarkovAutomatonTransitions(STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_deadlock.tra"), storm::exceptions::WrongFormatException);
|
|
}
|