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.
156 lines
3.8 KiB
156 lines
3.8 KiB
/*
|
|
* And.h
|
|
*
|
|
* Created on: 19.10.2012
|
|
* Author: Thomas Heinemann
|
|
*/
|
|
|
|
#ifndef AND_H_
|
|
#define AND_H_
|
|
|
|
#include "PCTLStateFormula.h"
|
|
#include <string>
|
|
|
|
namespace mrmc {
|
|
|
|
namespace formula {
|
|
|
|
/*!
|
|
* @brief
|
|
* Class for a PCTL formula tree with AND node as root.
|
|
*
|
|
* Has two PCTL 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 PCTLStateFormula
|
|
* @see PCTLFormula
|
|
*/
|
|
template <class T>
|
|
class And : public PCTLStateFormula<T> {
|
|
private:
|
|
PCTLStateFormula<T>* left;
|
|
PCTLStateFormula<T>* right;
|
|
public:
|
|
/*!
|
|
* Empty constructor.
|
|
* Will create an AND-node without subnotes. Will not represent a complete formula!
|
|
*/
|
|
And() {
|
|
left = NULL;
|
|
right = NULL;
|
|
}
|
|
|
|
/*!
|
|
* Constructor.
|
|
* Creates an AND note with the parameters as subtrees.
|
|
*
|
|
* @param left The left sub formula
|
|
* @param right The right sub formula
|
|
*/
|
|
And(PCTLStateFormula<T>* left, PCTLStateFormula<T>* right) {
|
|
this->left = left;
|
|
this->right = right;
|
|
}
|
|
|
|
/*!
|
|
* Destructor.
|
|
*
|
|
* The subtrees are deleted with the object
|
|
* (this behavior can be prevented by setting them to NULL before deletion)
|
|
*/
|
|
virtual ~And() {
|
|
if (left != NULL) {
|
|
delete left;
|
|
}
|
|
if (right != NULL) {
|
|
delete right;
|
|
}
|
|
}
|
|
|
|
/*!
|
|
* Sets the left child node.
|
|
*
|
|
* @param newLeft the new left child.
|
|
*/
|
|
void setLeft(PCTLStateFormula<T>* newLeft) {
|
|
left = newLeft;
|
|
}
|
|
|
|
/*!
|
|
* Sets the right child node.
|
|
*
|
|
* @param newRight the new right child.
|
|
*/
|
|
void setRight(PCTLStateFormula<T>* newRight) {
|
|
right = newRight;
|
|
}
|
|
|
|
/*!
|
|
* @returns a pointer to the left child node
|
|
*/
|
|
PCTLStateFormula<T>* getLeft() {
|
|
return left;
|
|
}
|
|
|
|
/*!
|
|
* @returns a pointer to the right child node
|
|
*/
|
|
PCTLStateFormula<T>* getRight() {
|
|
return right;
|
|
}
|
|
|
|
/*!
|
|
* @returns a string representation of the formula
|
|
*/
|
|
virtual std::string toString() {
|
|
std::string result = "(";
|
|
result += left->toString();
|
|
result += " && ";
|
|
result += right->toString();
|
|
result += ")";
|
|
return result;
|
|
}
|
|
|
|
/*!
|
|
* 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 PCTLStateFormula<T>* clone() {
|
|
And<T>* result = new And();
|
|
if (this->left != NULL) {
|
|
result->setLeft(left->clone());
|
|
}
|
|
if (this->right != NULL) {
|
|
result->setRight(right->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 mrmc::storage::BitVector *check(mrmc::modelChecker::DtmcPrctlModelChecker<T>* modelChecker) {
|
|
return modelChecker->checkAnd(this);
|
|
}
|
|
|
|
};
|
|
|
|
} //namespace formula
|
|
|
|
} //namespace mrmc
|
|
|
|
#endif /* AND_H_ */
|