Browse Source

Typos

tempestpy_adaptions
Matthias Volk 7 years ago
parent
commit
7f7778533a
  1. 6
      src/storm-dft/modelchecker/dft/DFTModelChecker.cpp
  2. 1
      src/storm-dft/storage/dft/DFT.cpp
  3. 4
      src/storm/models/sparse/MarkovAutomaton.cpp
  4. 2
      src/storm/utility/DirectEncodingExporter.cpp

6
src/storm-dft/modelchecker/dft/DFTModelChecker.cpp

@ -54,14 +54,14 @@ namespace storm {
case storm::storage::DFTElementType::AND:
STORM_LOG_TRACE("top modularisation called AND");
dfts = dft.topModularisation();
STORM_LOG_TRACE("Modularsation into " << dfts.size() << " submodules.");
STORM_LOG_TRACE("Modularisation into " << dfts.size() << " submodules.");
nrK = dfts.size();
nrM = dfts.size();
break;
case storm::storage::DFTElementType::OR:
STORM_LOG_TRACE("top modularisation called OR");
dfts = dft.topModularisation();
STORM_LOG_TRACE("Modularsation into " << dfts.size() << " submodules.");
STORM_LOG_TRACE("Modularisation into " << dfts.size() << " submodules.");
nrK = 0;
nrM = dfts.size();
invResults = true;
@ -69,7 +69,7 @@ namespace storm {
case storm::storage::DFTElementType::VOT:
STORM_LOG_TRACE("top modularisation called VOT");
dfts = dft.topModularisation();
STORM_LOG_TRACE("Modularsation into " << dfts.size() << " submodules.");
STORM_LOG_TRACE("Modularisation into " << dfts.size() << " submodules.");
nrK = std::static_pointer_cast<storm::storage::DFTVot<ValueType> const>(dft.getTopLevelGate())->threshold();
nrM = dfts.size();
if(nrK <= nrM/2) {

1
src/storm-dft/storage/dft/DFT.cpp

@ -751,7 +751,6 @@ namespace storm {
auto const& children = std::static_pointer_cast<DFTGate<ValueType>>(e)->children();
for(auto const& child : children) {
auto ISD = std::static_pointer_cast<DFTGate<ValueType>>(child)->independentSubDft(true);
// In the ISD, check for other children:

4
src/storm/models/sparse/MarkovAutomaton.cpp

@ -181,7 +181,7 @@ namespace storm {
// Get number of choices in current state
uint_fast64_t numberChoices = this->getTransitionMatrix().getRowGroupIndices()[state + 1] - this->getTransitionMatrix().getRowGroupIndices()[state];
if (isMarkovianState(state)) {
STORM_LOG_ASSERT(numberChoices == 1, "Wrong number of choices for markovian state.");
STORM_LOG_ASSERT(numberChoices == 1, "Wrong number of choices for Markovian state.");
}
if (numberChoices > 1) {
STORM_LOG_ASSERT(isProbabilisticState(state), "State is not probabilistic.");
@ -230,7 +230,7 @@ namespace storm {
// State is eliminated and can be discarded
keepStates.set(state, false);
} else {
STORM_LOG_ASSERT(this->isMarkovianState(state), "State is not markovian.");
STORM_LOG_ASSERT(this->isMarkovianState(state), "State is not Markovian.");
// Copy transitions
for (uint_fast64_t row = flexibleMatrix.getRowGroupIndices()[state]; row < flexibleMatrix.getRowGroupIndices()[state + 1]; ++row) {
for (auto const& entry : flexibleMatrix.getRow(row)) {

2
src/storm/utility/DirectEncodingExporter.cpp

@ -73,7 +73,7 @@ namespace storm {
}
if(rewardModelEntry.second.hasStateRewards()) {
os << rewardModelEntry.second.getStateRewardVector().at(group);
os << storm::utility::to_string(rewardModelEntry.second.getStateRewardVector().at(group));
} else {
os << "0";
}

Loading…
Cancel
Save