Storm 1.11.1.1
A Modern Probabilistic Model Checker
Loading...
Searching...
No Matches
MarkovAutomaton.cpp
Go to the documentation of this file.
2
8
9namespace storm {
10namespace models {
11namespace symbolic {
12
13template<storm::dd::DdType Type, typename ValueType>
15 std::shared_ptr<storm::dd::DdManager<Type>> manager, storm::dd::Bdd<Type> markovianMarker, storm::dd::Bdd<Type> reachableStates,
16 storm::dd::Bdd<Type> initialStates, storm::dd::Bdd<Type> deadlockStates, storm::dd::Add<Type, ValueType> transitionMatrix,
17 std::set<storm::expressions::Variable> const& rowVariables, std::shared_ptr<storm::adapters::AddExpressionAdapter<Type, ValueType>> rowExpressionAdapter,
18 std::set<storm::expressions::Variable> const& columnVariables,
19 std::vector<std::pair<storm::expressions::Variable, storm::expressions::Variable>> const& rowColumnMetaVariablePairs,
20 std::set<storm::expressions::Variable> const& nondeterminismVariables, std::map<std::string, storm::expressions::Expression> labelToExpressionMap,
21 std::unordered_map<std::string, RewardModelType> const& rewardModels)
22 : NondeterministicModel<Type, ValueType>(storm::models::ModelType::MarkovAutomaton, manager, reachableStates, initialStates, deadlockStates,
23 transitionMatrix, rowVariables, rowExpressionAdapter, columnVariables, rowColumnMetaVariablePairs,
24 nondeterminismVariables, labelToExpressionMap, rewardModels),
25 markovianMarker(markovianMarker) {
26 // Compute all Markovian info.
27 computeMarkovianInfo();
28}
29
30template<storm::dd::DdType Type, typename ValueType>
32 std::shared_ptr<storm::dd::DdManager<Type>> manager, storm::dd::Bdd<Type> markovianMarker, storm::dd::Bdd<Type> reachableStates,
33 storm::dd::Bdd<Type> initialStates, storm::dd::Bdd<Type> deadlockStates, storm::dd::Add<Type, ValueType> transitionMatrix,
34 std::set<storm::expressions::Variable> const& rowVariables, std::set<storm::expressions::Variable> const& columnVariables,
35 std::vector<std::pair<storm::expressions::Variable, storm::expressions::Variable>> const& rowColumnMetaVariablePairs,
36 std::set<storm::expressions::Variable> const& nondeterminismVariables, std::map<std::string, storm::dd::Bdd<Type>> labelToBddMap,
37 std::unordered_map<std::string, RewardModelType> const& rewardModels)
38 : NondeterministicModel<Type, ValueType>(storm::models::ModelType::MarkovAutomaton, manager, reachableStates, initialStates, deadlockStates,
39 transitionMatrix, rowVariables, columnVariables, rowColumnMetaVariablePairs, nondeterminismVariables,
40 labelToBddMap, rewardModels),
41 markovianMarker(markovianMarker) {
42 // Compute all Markovian info.
43 computeMarkovianInfo();
44}
45
46template<storm::dd::DdType Type, typename ValueType>
48 // Compute the Markovian choices.
49 this->markovianChoices = this->getQualitativeTransitionMatrix() && this->markovianMarker;
50
51 // Compute the probabilistic states.
52 std::set<storm::expressions::Variable> columnAndNondeterminsmVariables;
53 std::set_union(this->getColumnVariables().begin(), this->getColumnVariables().end(), this->getNondeterminismVariables().begin(),
54 this->getNondeterminismVariables().end(), std::inserter(columnAndNondeterminsmVariables, columnAndNondeterminsmVariables.begin()));
55 this->probabilisticStates = (this->getQualitativeTransitionMatrix() && !markovianMarker).existsAbstract(columnAndNondeterminsmVariables);
56
57 // Compute the Markovian states.
58 this->markovianStates = markovianChoices.existsAbstract(columnAndNondeterminsmVariables);
59
60 // Compute the vector of exit rates.
61 this->exitRateVector = (this->getTransitionMatrix() * this->markovianMarker.template toAdd<ValueType>()).sumAbstract(columnAndNondeterminsmVariables);
62
63 // Modify the transition matrix so all choices are probabilistic and the Markovian choices additionally
64 // have a rate.
65 this->transitionMatrix = this->transitionMatrix / this->markovianChoices.ite(this->exitRateVector, this->getManager().template getAddOne<ValueType>());
66}
67
68template<storm::dd::DdType Type, typename ValueType>
70 return this->markovianMarker;
71}
72
73template<storm::dd::DdType Type, typename ValueType>
75 return this->markovianStates;
76}
77
78template<storm::dd::DdType Type, typename ValueType>
80 return this->markovianChoices;
81}
82
83template<storm::dd::DdType Type, typename ValueType>
85 return this->markovianStates;
86}
87
88template<storm::dd::DdType Type, typename ValueType>
90 return !(this->probabilisticStates && this->markovianStates).isZero();
91}
92
93template<storm::dd::DdType Type, typename ValueType>
95 return !this->hasHybridStates();
96}
97
98template<storm::dd::DdType Type, typename ValueType>
100 // Create the new transition matrix by deleting all Markovian transitions from probabilistic states.
101 storm::dd::Add<Type, ValueType> newTransitionMatrix = this->probabilisticStates.ite(
102 this->getTransitionMatrix() * (!this->getMarkovianMarker()).template toAdd<ValueType>(), this->getTransitionMatrix() * this->getExitRateVector());
103
104 return MarkovAutomaton<Type, ValueType>(this->getManagerAsSharedPointer(), this->getMarkovianMarker(), this->getReachableStates(), this->getInitialStates(),
105 this->getDeadlockStates(), newTransitionMatrix, this->getRowVariables(), this->getRowExpressionAdapter(),
106 this->getColumnVariables(), this->getRowColumnMetaVariablePairs(), this->getNondeterminismVariables(),
107 this->getLabelToExpressionMap(), this->getRewardModels());
108}
109
110template<storm::dd::DdType Type, typename ValueType>
114
115template<storm::dd::DdType Type, typename ValueType>
116template<typename NewValueType>
117std::shared_ptr<MarkovAutomaton<Type, NewValueType>> MarkovAutomaton<Type, ValueType>::toValueType() const {
118 typedef typename NondeterministicModel<Type, NewValueType>::RewardModelType NewRewardModelType;
119 std::unordered_map<std::string, NewRewardModelType> newRewardModels;
120
121 for (auto const& e : this->getRewardModels()) {
122 newRewardModels.emplace(e.first, e.second.template toValueType<NewValueType>());
123 }
124
125 auto newLabelToBddMap = this->getLabelToBddMap();
126 newLabelToBddMap.erase("init");
127 newLabelToBddMap.erase("deadlock");
128
129 return std::make_shared<MarkovAutomaton<Type, NewValueType>>(
130 this->getManagerAsSharedPointer(), this->getMarkovianMarker(), this->getReachableStates(), this->getInitialStates(), this->getDeadlockStates(),
131 this->getTransitionMatrix().template toValueType<NewValueType>(), this->getRowVariables(), this->getColumnVariables(),
132 this->getRowColumnMetaVariablePairs(), this->getNondeterminismVariables(), newLabelToBddMap, newRewardModels);
133}
134
135// Explicitly instantiate the template class.
137
140template std::shared_ptr<MarkovAutomaton<storm::dd::DdType::Sylvan, double>> MarkovAutomaton<storm::dd::DdType::Sylvan, storm::RationalNumber>::toValueType()
141 const;
143
144} // namespace symbolic
145} // namespace models
146} // namespace storm
This class represents a discrete-time Markov decision process.
storm::dd::Bdd< Type > const & getProbabilisticStates() const
MarkovAutomaton< Type, ValueType > close()
storm::dd::Bdd< Type > const & getMarkovianStates() const
MarkovAutomaton(MarkovAutomaton< Type, ValueType > const &other)=default
storm::dd::Bdd< Type > const & getMarkovianMarker() const
std::shared_ptr< MarkovAutomaton< Type, NewValueType > > toValueType() const
storm::dd::Add< Type, ValueType > const & getExitRateVector() const
storm::dd::Bdd< Type > const & getMarkovianChoices() const
Base class for all nondeterministic symbolic models.