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.
129 lines
3.3 KiB
129 lines
3.3 KiB
/*
|
|
* And.h
|
|
*
|
|
* Created on: 19.10.2012
|
|
* Author: Thomas Heinemann
|
|
*/
|
|
|
|
#ifndef STORM_FORMULA_PRCTL_AND_H_
|
|
#define STORM_FORMULA_PRCTL_AND_H_
|
|
|
|
#include "AbstractStateFormula.h"
|
|
#include "src/formula/abstract/And.h"
|
|
#include "src/formula/AbstractFormulaChecker.h"
|
|
#include "src/modelchecker/ForwardDeclarations.h"
|
|
#include <string>
|
|
|
|
namespace storm {
|
|
namespace formula {
|
|
namespace prctl {
|
|
|
|
template <class T> class And;
|
|
|
|
/*!
|
|
* @brief Interface class for model checkers that support And.
|
|
*
|
|
* All model checkers that support the formula class And must inherit
|
|
* this pure virtual class.
|
|
*/
|
|
template <class T>
|
|
class IAndModelChecker {
|
|
public:
|
|
/*!
|
|
* @brief Evaluates And formula within a model checker.
|
|
*
|
|
* @param obj Formula object with subformulas.
|
|
* @return Result of the formula for every node.
|
|
*/
|
|
virtual storm::storage::BitVector* checkAnd(const And<T>& obj) const = 0;
|
|
};
|
|
|
|
/*!
|
|
* @brief
|
|
* Class for a Abstract formula tree with AND node as root.
|
|
*
|
|
* Has two Abstract state formulas as sub formulas/trees.
|
|
*
|
|
* As AND is commutative, the order is \e theoretically not important, but will influence the order in which
|
|
* the model checker works.
|
|
*
|
|
* 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 AbstractStateFormula
|
|
* @see AbstractPrctlFormula
|
|
*/
|
|
template <class T>
|
|
class And : public storm::formula::abstract::And<T, AbstractStateFormula<T>>, public AbstractStateFormula<T> {
|
|
|
|
public:
|
|
/*!
|
|
* Empty constructor.
|
|
* Will create an AND-node without subnotes. Will not represent a complete formula!
|
|
*/
|
|
And() {
|
|
//intentionally left empty
|
|
}
|
|
|
|
/*!
|
|
* Constructor.
|
|
* Creates an AND note with the parameters as subtrees.
|
|
*
|
|
* @param left The left sub formula
|
|
* @param right The right sub formula
|
|
*/
|
|
And(AbstractStateFormula<T>* left, AbstractStateFormula<T>* right)
|
|
: storm::formula::abstract::And<T, AbstractStateFormula<T>>(left, right) {
|
|
//intentionally left empty
|
|
}
|
|
|
|
/*!
|
|
* Destructor.
|
|
*
|
|
* The subtrees are deleted with the object
|
|
* (this behavior can be prevented by setting them to NULL before deletion)
|
|
*/
|
|
virtual ~And() {
|
|
//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 AND-object that is identical the called object.
|
|
*/
|
|
virtual AbstractStateFormula<T>* clone() const {
|
|
And<T>* result = new And();
|
|
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 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<IAndModelChecker>()->checkAnd(*this);
|
|
}
|
|
|
|
};
|
|
|
|
} //namespace prctl
|
|
|
|
} //namespace formula
|
|
|
|
} //namespace storm
|
|
|
|
#endif /* STORM_FORMULA_PRCTL_AND_H_ */
|