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.
125 lines
3.3 KiB
125 lines
3.3 KiB
/*
|
|
* Until.h
|
|
*
|
|
* Created on: 19.10.2012
|
|
* Author: Thomas Heinemann
|
|
*/
|
|
|
|
#ifndef STORM_FORMULA_CSL_UNTIL_H_
|
|
#define STORM_FORMULA_CSL_UNTIL_H_
|
|
|
|
#include "AbstractPathFormula.h"
|
|
#include "AbstractStateFormula.h"
|
|
#include "src/formula/abstract/Until.h"
|
|
#include "src/formula/AbstractFormulaChecker.h"
|
|
|
|
namespace storm {
|
|
namespace property {
|
|
namespace csl {
|
|
|
|
template <class T> 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 T>
|
|
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<T>* checkUntil(const Until<T>& obj, bool qualitative) const = 0;
|
|
};
|
|
|
|
/*!
|
|
* @brief
|
|
* Class for an abstract (path) formula tree with an Until node as root.
|
|
*
|
|
* Has two Abstract state 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 AbstractPathFormula
|
|
* @see AbstractCslFormula
|
|
*/
|
|
template <class T>
|
|
class Until : public storm::property::abstract::Until<T, AbstractStateFormula<T>>,
|
|
public AbstractPathFormula<T> {
|
|
|
|
public:
|
|
/*!
|
|
* Empty constructor
|
|
*/
|
|
Until() {
|
|
// Intentionally left empty
|
|
}
|
|
|
|
/*!
|
|
* Constructor
|
|
*
|
|
* @param left The left formula subtree
|
|
* @param right The left formula subtree
|
|
*/
|
|
Until(AbstractStateFormula<T>* left, AbstractStateFormula<T>* right)
|
|
: storm::property::abstract::Until<T, AbstractStateFormula<T>>(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
|
|
}
|
|
|
|
/*!
|
|
* 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 AbstractPathFormula<T>* clone() const override {
|
|
Until<T>* 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<T>* check(const storm::modelchecker::csl::AbstractModelChecker<T>& modelChecker, bool qualitative) const override {
|
|
return modelChecker.template as<IUntilModelChecker>()->checkUntil(*this, qualitative);
|
|
}
|
|
};
|
|
|
|
} //namespace csl
|
|
} //namespace property
|
|
} //namespace storm
|
|
|
|
#endif /* STORM_FORMULA_CSL_UNTIL_H_ */
|