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.
176 lines
4.6 KiB
176 lines
4.6 KiB
/*
|
|
* BoundOperator.h
|
|
*
|
|
* Created on: 27.12.2012
|
|
* Author: Christian Dehnert
|
|
*/
|
|
|
|
#ifndef STORM_FORMULA_BOUNDOPERATOR_H_
|
|
#define STORM_FORMULA_BOUNDOPERATOR_H_
|
|
|
|
#include "src/formula/AbstractStateFormula.h"
|
|
#include "src/formula/AbstractPathFormula.h"
|
|
#include "src/formula/AbstractFormulaChecker.h"
|
|
#include "src/modelChecker/AbstractModelChecker.h"
|
|
#include "src/utility/ConstTemplates.h"
|
|
|
|
namespace storm {
|
|
|
|
namespace formula {
|
|
|
|
template <class T> class BoundUntil;
|
|
|
|
template <class T>
|
|
class IBoundUntilModelChecker {
|
|
public:
|
|
virtual storm::storage::BitVector* checkBoundUntil(const BoundUntil<T>& obj) const = 0;
|
|
};
|
|
|
|
/*!
|
|
* @brief
|
|
* Class for a Abstract formula tree with a P (probablistic) operator node over a probability interval
|
|
* as root.
|
|
*
|
|
* Has one Abstract path formula as sub formula/tree.
|
|
*
|
|
* @par Semantics
|
|
* The formula holds iff the probability that the path formula holds is inside the bounds
|
|
* specified in this operator
|
|
*
|
|
* The subtree is seen as part of the object and deleted with it
|
|
* (this behavior can be prevented by setting them to NULL before deletion)
|
|
*
|
|
*
|
|
* @see AbstractStateFormula
|
|
* @see AbstractPathFormula
|
|
* @see ProbabilisticOperator
|
|
* @see ProbabilisticNoBoundsOperator
|
|
* @see AbstractFormula
|
|
*/
|
|
template<class T>
|
|
class BoundOperator : public AbstractStateFormula<T> {
|
|
|
|
public:
|
|
enum ComparisonType { LESS, LESS_EQUAL, GREATER, GREATER_EQUAL };
|
|
|
|
/*!
|
|
* Constructor
|
|
*
|
|
* @param lowerBound The lower bound for the probability
|
|
* @param upperBound The upper bound for the probability
|
|
* @param pathFormula The child node
|
|
*/
|
|
BoundOperator(ComparisonType comparisonOperator, T bound, AbstractPathFormula<T>* pathFormula)
|
|
: comparisonOperator(comparisonOperator), bound(bound), pathFormula(pathFormula) {
|
|
// Intentionally left empty
|
|
}
|
|
|
|
/*!
|
|
* Destructor
|
|
*
|
|
* The subtree is deleted with the object
|
|
* (this behavior can be prevented by setting them to NULL before deletion)
|
|
*/
|
|
virtual ~BoundOperator() {
|
|
if (pathFormula != nullptr) {
|
|
delete pathFormula;
|
|
}
|
|
}
|
|
|
|
/*!
|
|
* @returns the child node (representation of a Abstract path formula)
|
|
*/
|
|
const AbstractPathFormula<T>& getPathFormula () const {
|
|
return *pathFormula;
|
|
}
|
|
|
|
/*!
|
|
* Sets the child node
|
|
*
|
|
* @param pathFormula the path formula that becomes the new child node
|
|
*/
|
|
void setPathFormula(AbstractPathFormula<T>* pathFormula) {
|
|
this->pathFormula = pathFormula;
|
|
}
|
|
|
|
/*!
|
|
* @returns the bound for the measure
|
|
*/
|
|
const T& getBound() const {
|
|
return bound;
|
|
}
|
|
|
|
/*!
|
|
* Sets the interval in which the probability that the path formula holds may lie in.
|
|
*
|
|
* @param bound The bound for the measure
|
|
*/
|
|
void setBound(T bound) {
|
|
this->bound = bound;
|
|
}
|
|
|
|
/*!
|
|
* @returns a string representation of the formula
|
|
*/
|
|
virtual std::string toString() const {
|
|
std::string result = "P ";
|
|
switch (comparisonOperator) {
|
|
case LESS: result += "<"; break;
|
|
case LESS_EQUAL: result += "<="; break;
|
|
case GREATER: result += ">"; break;
|
|
case GREATER_EQUAL: result += ">="; break;
|
|
}
|
|
result += std::to_string(bound);
|
|
result += " [";
|
|
result += pathFormula->toString();
|
|
result += "]";
|
|
return result;
|
|
}
|
|
|
|
bool meetsBound(T value) {
|
|
switch (comparisonOperator) {
|
|
case LESS: return value < bound; break;
|
|
case LESS_EQUAL: return value <= bound; break;
|
|
case GREATER: return value > bound; break;
|
|
case GREATER_EQUAL: return value >= bound; break;
|
|
default: return false;
|
|
}
|
|
}
|
|
|
|
/*!
|
|
* 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 AND-object that is identical the called object.
|
|
*/
|
|
virtual AbstractStateFormula<T>* clone() const = 0;
|
|
|
|
/*!
|
|
* 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 bit vector indicating all states that satisfy the formula represented by the called object.
|
|
*/
|
|
virtual storm::storage::BitVector *check(const storm::modelChecker::AbstractModelChecker<T>& modelChecker) const {
|
|
return modelChecker.template as<IBoundUntilModelChecker>()->checkBoundOperator(*this);
|
|
}
|
|
|
|
virtual bool conforms(const AbstractFormulaChecker<T>& checker) const {
|
|
return checker.conforms(this->pathFormula);
|
|
}
|
|
|
|
private:
|
|
ComparisonType comparisonOperator;
|
|
T bound;
|
|
AbstractPathFormula<T>* pathFormula;
|
|
};
|
|
|
|
} //namespace formula
|
|
|
|
} //namespace storm
|
|
|
|
#endif /* STORM_FORMULA_BOUNDOPERATOR_H_ */
|