/* * Until.h * * Created on: 19.10.2012 * Author: Thomas Heinemann */ #ifndef STORM_FORMULA_LTL_UNTIL_H_ #define STORM_FORMULA_LTL_UNTIL_H_ #include "AbstractLtlFormula.h" #include "src/formula/abstract/Until.h" #include "src/formula/AbstractFormulaChecker.h" namespace storm { namespace property { namespace ltl { template class Until; /*! * @brief Interface class for model checkers that support Until. * * All model checkers that support the formula class Until must inherit * this pure virtual class. */ template class IUntilModelChecker { public: /*! * @brief Evaluates Until formula within a model checker. * * @param obj Formula object with subformulas. * @return Result of the formula for every node. */ virtual std::vector* checkUntil(const Until& obj) const = 0; }; /*! * @brief Interface class for visitors that support Until. * * All visitors that support the formula class Until must inherit * this pure virtual class. */ template class IUntilVisitor { public: /*! * @brief Visits Until formula. * * @param obj Formula object with subformulas. * @return Result of the formula for every node. */ virtual void visitUntil(const Until& obj) = 0; }; /*! * @brief * Class for an abstract (path) formula tree with an Until node as root. * * Has two Abstract LTL formulas as sub formulas/trees. * * @par Semantics * The formula holds iff eventually, formula \e right (the right subtree) holds, and before, * \e left holds always. * * The subtrees are seen as part of the object and deleted with the object * (this behavior can be prevented by setting them to NULL before deletion) * * @see AbstractLtlFormula */ template class Until : public storm::property::abstract::Until>, public AbstractLtlFormula { public: /*! * Empty constructor */ Until() { // Intentionally left empty } /*! * Constructor * * @param left The left formula subtree * @param right The left formula subtree */ Until(AbstractLtlFormula* left, AbstractLtlFormula* right) : storm::property::abstract::Until>(left, right) { // Intentionally left empty } /*! * Destructor. * * Also deletes the subtrees. * (this behaviour can be prevented by setting the subtrees to NULL before deletion) */ virtual ~Until() { // Intentionally left empty } /*! * @brief Return string representation of this formula. * * In LTL, brackets are needed around the until, as Until may appear nested (in other logics, Until always is the * root of a path formula); hence this function is overwritten in this class. * * @return A string representation of the formula. */ virtual std::string toString() const { return "(" + storm::property::abstract::Until>::toString() + ")"; } /*! * Clones the called object. * * Performs a "deep copy", i.e. the subtrees of the new object are clones of the original ones * * @returns a new BoundedUntil-object that is identical the called object. */ virtual AbstractLtlFormula* clone() const { Until* result = new Until(); if (this->leftIsSet()) { result->setLeft(this->getLeft().clone()); } if (this->rightIsSet()) { result->setRight(this->getRight().clone()); } return result; } /*! * Calls the model checker to check this formula. * Needed to infer the correct type of formula class. * * @note This function should only be called in a generic check function of a model checker class. For other uses, * the methods of the model checker should be used. * * @returns A vector indicating the probability that the formula holds for each state. */ virtual std::vector *check(const storm::modelchecker::ltl::AbstractModelChecker& modelChecker) const { return modelChecker.template as()->checkUntil(*this); } virtual void visit(visitor::AbstractLtlFormulaVisitor& visitor) const { visitor.template as()->visitUntil(*this); } }; } //namespace ltl } //namespace property } //namespace storm #endif /* STORM_FORMULA_LTL_UNTIL_H_ */