ExtractMaximalStateFormulasVisitor.cpp

Go to the documentation of this file.

#include "storm/logic/ExtractMaximalStateFormulasVisitor.h"
#include <boost/any.hpp>
#include <optional>
 
#include "storm/logic/Formulas.h"
 
#include "storm/exceptions/InvalidOperationException.h"
 
namespace storm {
namespace logic {
 
ExtractMaximalStateFormulasVisitor::ExtractMaximalStateFormulasVisitor(ApToFormulaMap& extractedFormulas)
    : extractedFormulas(extractedFormulas), nestingLevel(0) {}
 
std::shared_ptr<Formula> ExtractMaximalStateFormulasVisitor::extract(PathFormula const& f, ApToFormulaMap& extractedFormulas) {
    ExtractMaximalStateFormulasVisitor visitor(extractedFormulas);
    boost::any result = f.accept(visitor, boost::any());
    return boost::any_cast<std::shared_ptr<Formula>>(result);
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(BinaryBooleanPathFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    std::shared_ptr<Formula> left = boost::any_cast<std::shared_ptr<Formula>>(f.getLeftSubformula().accept(*this, data));
    if (left->hasQualitativeResult()) {
        left = extract(left);
    }
 
    std::shared_ptr<Formula> right = boost::any_cast<std::shared_ptr<Formula>>(f.getRightSubformula().accept(*this, data));
    if (right->hasQualitativeResult()) {
        right = extract(right);
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<BinaryBooleanPathFormula>(f.getOperator(), left, right));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(BoundedUntilFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    STORM_LOG_THROW(!f.hasMultiDimensionalSubformulas(), storm::exceptions::InvalidOperationException,
                    "Can not extract maximal state formulas for multi-dimensional bounded until.");
 
    std::shared_ptr<Formula> left = boost::any_cast<std::shared_ptr<Formula>>(f.getLeftSubformula().accept(*this, data));
    if (left->hasQualitativeResult()) {
        left = extract(left);
    }
 
    std::shared_ptr<Formula> right = boost::any_cast<std::shared_ptr<Formula>>(f.getRightSubformula().accept(*this, data));
    if (right->hasQualitativeResult()) {
        right = extract(right);
    }
 
    // Copy bound information
    std::vector<std::optional<TimeBound>> lowerBounds, upperBounds;
    std::vector<TimeBoundReference> timeBoundReferences;
    for (uint64_t i = 0; i < f.getDimension(); ++i) {
        if (f.hasLowerBound(i)) {
            lowerBounds.emplace_back(TimeBound(f.isLowerBoundStrict(i), f.getLowerBound(i)));
        } else {
            lowerBounds.emplace_back();
        }
        if (f.hasUpperBound(i)) {
            upperBounds.emplace_back(TimeBound(f.isUpperBoundStrict(i), f.getUpperBound(i)));
        } else {
            upperBounds.emplace_back();
        }
        timeBoundReferences.push_back(f.getTimeBoundReference(i));
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<BoundedUntilFormula>(left, right, lowerBounds, upperBounds, timeBoundReferences));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(EventuallyFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    std::shared_ptr<Formula> sub = boost::any_cast<std::shared_ptr<Formula>>(f.getSubformula().accept(*this, data));
    if (sub->hasQualitativeResult()) {
        sub = extract(sub);
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<EventuallyFormula>(sub));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(GloballyFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    std::shared_ptr<Formula> sub = boost::any_cast<std::shared_ptr<Formula>>(f.getSubformula().accept(*this, data));
    if (sub->hasQualitativeResult()) {
        sub = extract(sub);
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<GloballyFormula>(sub));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(NextFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    std::shared_ptr<Formula> sub = boost::any_cast<std::shared_ptr<Formula>>(f.getSubformula().accept(*this, data));
    if (sub->hasQualitativeResult()) {
        sub = extract(sub);
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<NextFormula>(sub));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(UnaryBooleanPathFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    std::shared_ptr<Formula> sub = boost::any_cast<std::shared_ptr<Formula>>(f.getSubformula().accept(*this, data));
    if (sub->hasQualitativeResult()) {
        sub = extract(sub);
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<UnaryBooleanPathFormula>(f.getOperator(), sub));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(UntilFormula const& f, boost::any const& data) const {
    if (nestingLevel > 0) {
        return CloneVisitor::visit(f, data);
    }
 
    std::shared_ptr<Formula> left = boost::any_cast<std::shared_ptr<Formula>>(f.getLeftSubformula().accept(*this, data));
    if (left->hasQualitativeResult()) {
        left = extract(left);
    }
 
    std::shared_ptr<Formula> right = boost::any_cast<std::shared_ptr<Formula>>(f.getRightSubformula().accept(*this, data));
    if (right->hasQualitativeResult()) {
        right = extract(right);
    }
 
    return std::static_pointer_cast<Formula>(std::make_shared<UntilFormula>(left, right));
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(TimeOperatorFormula const& f, boost::any const& data) const {
    incrementNestingLevel();
    boost::any result = CloneVisitor::visit(f, data);
    decrementNestingLevel();
    return result;
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(LongRunAverageOperatorFormula const& f, boost::any const& data) const {
    incrementNestingLevel();
    boost::any result = CloneVisitor::visit(f, data);
    decrementNestingLevel();
    return result;
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(MultiObjectiveFormula const& f, boost::any const& data) const {
    incrementNestingLevel();
    boost::any result = CloneVisitor::visit(f, data);
    decrementNestingLevel();
    return result;
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(ProbabilityOperatorFormula const& f, boost::any const& data) const {
    incrementNestingLevel();
    boost::any result = CloneVisitor::visit(f, data);
    decrementNestingLevel();
    return result;
}
 
boost::any ExtractMaximalStateFormulasVisitor::visit(RewardOperatorFormula const& f, boost::any const& data) const {
    incrementNestingLevel();
    boost::any result = CloneVisitor::visit(f, data);
    decrementNestingLevel();
    return result;
}
 
std::shared_ptr<Formula> ExtractMaximalStateFormulasVisitor::extract(std::shared_ptr<Formula> f) const {
    // We use the string representation of formulae to check if they are equivalent.
    // Of course, this could be made more elegant if there were an actual operator< and/or operator== for formulae
 
    std::string label;
 
    // Find equivalent formula in cache
    auto it = cachedFormulas.find(f->toString());
    if (it != cachedFormulas.end()) {
        // Reuse label of equivalent formula
        label = it->second;
    } else {
        // Create new label
        label = "p" + std::to_string(extractedFormulas.size());
        extractedFormulas[label] = f;
        // Update cache
        cachedFormulas[f->toString()] = label;
    }
 
    return std::make_shared<storm::logic::AtomicLabelFormula>(label);
}
 
void ExtractMaximalStateFormulasVisitor::incrementNestingLevel() const {
    const_cast<std::size_t&>(nestingLevel)++;
}
void ExtractMaximalStateFormulasVisitor::decrementNestingLevel() const {
    STORM_LOG_ASSERT(nestingLevel > 0, "Illegal nesting level decrement.");
    const_cast<std::size_t&>(nestingLevel)--;
}
 
}  // namespace logic
}  // namespace storm