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.
117 lines
3.3 KiB
117 lines
3.3 KiB
/*
|
|
* Next.h
|
|
*
|
|
* Created on: 26.12.2012
|
|
* Author: Christian Dehnert
|
|
*/
|
|
|
|
#ifndef STORM_FORMULA_PRCTL_REACHABILITYREWARD_H_
|
|
#define STORM_FORMULA_PRCTL_REACHABILITYREWARD_H_
|
|
|
|
#include "AbstractPathFormula.h"
|
|
#include "AbstractStateFormula.h"
|
|
#include "../abstract/Eventually.h"
|
|
#include "src/formula/AbstractFormulaChecker.h"
|
|
|
|
namespace storm {
|
|
namespace property {
|
|
namespace prctl {
|
|
|
|
template <class T> class ReachabilityReward;
|
|
|
|
/*!
|
|
* @brief Interface class for model checkers that support ReachabilityReward.
|
|
*
|
|
* All model checkers that support the formula class ReachabilityReward must inherit
|
|
* this pure virtual class.
|
|
*/
|
|
template <class T>
|
|
class IReachabilityRewardModelChecker {
|
|
public:
|
|
/*!
|
|
* @brief Evaluates ReachabilityReward formula within a model checker.
|
|
*
|
|
* @param obj Formula object with subformulas.
|
|
* @return Result of the formula for every node.
|
|
*/
|
|
virtual std::vector<T>* checkReachabilityReward(const ReachabilityReward<T>& obj, bool qualitative) const = 0;
|
|
};
|
|
|
|
/*!
|
|
* @brief
|
|
* Class for an abstract (path) formula tree with an Reachability Reward node as root.
|
|
*
|
|
* Has one Abstract state formula as sub formula/tree.
|
|
*
|
|
* The subtree is seen as part of the object and deleted with the object
|
|
* (this behavior can be prevented by setting them to nullptr before deletion)
|
|
*
|
|
* @see AbstractPathFormula
|
|
* @see AbstractPrctlFormula
|
|
*/
|
|
template <class T>
|
|
class ReachabilityReward : public storm::property::abstract::Eventually<T, AbstractStateFormula<T>>,
|
|
public AbstractPathFormula<T> {
|
|
|
|
public:
|
|
/*!
|
|
* Empty constructor
|
|
*/
|
|
ReachabilityReward() {
|
|
// Intentionally left empty
|
|
}
|
|
|
|
/*!
|
|
* Constructor
|
|
*
|
|
* @param child The child node
|
|
*/
|
|
ReachabilityReward(AbstractStateFormula<T>* child) :
|
|
storm::property::abstract::Eventually<T, AbstractStateFormula<T>>(child){
|
|
// Intentionally left empty
|
|
}
|
|
|
|
/*!
|
|
* Constructor.
|
|
*
|
|
* Also deletes the subtree.
|
|
* (this behaviour can be prevented by setting the subtrees to nullptr before deletion)
|
|
*/
|
|
virtual ~ReachabilityReward() {
|
|
// 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 ReachabilityReward-object that is identical the called object.
|
|
*/
|
|
virtual AbstractPathFormula<T>* clone() const override {
|
|
ReachabilityReward<T>* result = new ReachabilityReward<T>();
|
|
if (this->childIsSet()) {
|
|
result->setChild(this->getChild().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::prctl::AbstractModelChecker<T>& modelChecker, bool qualitative) const override {
|
|
return modelChecker.template as<IReachabilityRewardModelChecker>()->checkReachabilityReward(*this, qualitative);
|
|
}
|
|
};
|
|
|
|
} //namespace prctl
|
|
} //namespace property
|
|
} //namespace storm
|
|
|
|
#endif /* STORM_FORMULA_PRCTL_REACHABILITYREWARD_H_ */
|