Documentation of formula classes

src/formula/Csl/And.h

@@ -40,7 +40,7 @@ class IAndModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with AND node as root.
+ * Class for an abstract formula tree with AND node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Csl/Ap.h

@@ -39,7 +39,7 @@ class IApModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with atomic proposition as root.
+ * Class for an abstract formula tree with atomic proposition as root.
  *
  * This class represents the leaves in the formula tree.
  *

src/formula/Csl/Eventually.h

@@ -39,7 +39,7 @@ class IEventuallyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Eventually node as root.
+ * Class for an abstract (path) formula tree with an Eventually node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Csl/Globally.h

@@ -40,7 +40,7 @@ class IGloballyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Globally node as root.
+ * Class for an abstract (path) formula tree with a Globally node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Csl/Next.h

@@ -39,7 +39,7 @@ class INextModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Next node as root.
+ * Class for an abstract (path) formula tree with a Next node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Csl/Not.h

@@ -39,7 +39,7 @@ class INotModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with NOT node as root.
+ * Class for an abstract formula tree with NOT node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Csl/Or.h

@@ -38,7 +38,7 @@ class IOrModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with OR node as root.
+ * Class for an abstract formula tree with OR node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Csl/ProbabilisticBoundOperator.h

@@ -33,7 +33,7 @@ class IProbabilisticBoundOperatorModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator node over a probability interval
+ * Class for an abstract formula tree with a P (probablistic) operator node over a probability interval
  * as root.
  *
  * Has one Abstract path formula as sub formula/tree.

src/formula/Csl/ProbabilisticNoBoundOperator.h

@@ -18,7 +18,7 @@ namespace csl {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator without declaration of probabilities
+ * Class for an abstract formula tree with a P (probablistic) operator without declaration of probabilities
  * as root.
  *
  * Checking a formula with this operator as root returns the probabilities that the path formula holds

src/formula/Csl/Until.h

@@ -39,7 +39,7 @@ class IUntilModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Until node as root.
+ * Class for an abstract (path) formula tree with an Until node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Ltl/AbstractLtlFormula.h

@@ -16,6 +16,9 @@ namespace storm {
 namespace formula {
 namespace ltl {
 
+/*!
+ * Interface class for all LTL root formulas.
+ */
 template <class T>
 class AbstractLtlFormula : public virtual storm::formula::abstract::AbstractFormula<T> {
 public:

src/formula/Ltl/And.h

@@ -40,9 +40,9 @@ class IAndModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with AND node as root.
+ * Class for an abstract formula tree with AND node as root.
  *
- * Has two Abstract state formulas as sub formulas/trees.
+ * Has two Abstract LTL 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.
@@ -51,7 +51,6 @@ class IAndModelChecker {
  * (this behavior can be prevented by setting them to NULL before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class And : public storm::formula::abstract::And<T, AbstractLtlFormula<T>>, public AbstractLtlFormula<T> {

src/formula/Ltl/Ap.h

@@ -35,6 +35,14 @@ class IApModelChecker {
 		virtual std::vector<T>* checkAp(const Ap<T>& obj) const = 0;
 };
 
+/*!
+ * @brief
+ * Class for an abstract formula tree with atomic proposition as root.
+ *
+ * This class represents the leaves in the formula tree.
+ *
+ * @see AbstractLtlFormula
+ */
 template <class T>
 class Ap: public storm::formula::abstract::Ap<T>,
 		    public storm::formula::ltl::AbstractLtlFormula<T> {

src/formula/Ltl/BoundedEventually.h

@@ -41,9 +41,9 @@ class IBoundedEventuallyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedEventually node as root.
+ * Class for an abstract (path) formula tree with a BoundedEventually node as root.
  *
- * Has one Abstract state formulas as sub formula/tree.
+ * Has one Abstract LTL formulas as sub formula/tree.
  *
  * @par Semantics
  * The formula holds iff in at most \e bound steps, formula \e child holds.
@@ -52,7 +52,6 @@ class IBoundedEventuallyModelChecker {
  * (this behavior can be prevented by setting them to NULL before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class BoundedEventually : public storm::formula::abstract::BoundedEventually<T, AbstractLtlFormula<T>>,

src/formula/Ltl/BoundedUntil.h

@@ -40,9 +40,9 @@ class IBoundedUntilModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedUntil node as root.
+ * Class for an abstract (path) formula tree with a BoundedUntil node as root.
  *
- * Has two Abstract state formulas as sub formulas/trees.
+ * Has two Abstract LTL formulas as sub formulas/trees.
  *
  * @par Semantics
  * The formula holds iff in at most \e bound steps, formula \e right (the right subtree) holds, and before,
@@ -52,7 +52,6 @@ class IBoundedUntilModelChecker {
  * (this behavior can be prevented by setting them to NULL before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class BoundedUntil : public storm::formula::abstract::BoundedUntil<T, AbstractLtlFormula<T>>,

src/formula/Ltl/Eventually.h

@@ -38,9 +38,9 @@ class IEventuallyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Eventually node as root.
+ * Class for an abstract (path) formula tree with an Eventually node as root.
  *
- * Has one Abstract state formula as sub formula/tree.
+ * Has one Abstract LTL formula as sub formula/tree.
  *
  * @par Semantics
  * The formula holds iff eventually \e child holds.
@@ -49,7 +49,6 @@ class IEventuallyModelChecker {
  * (this behavior can be prevented by setting them to nullptr before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class Eventually : public storm::formula::abstract::Eventually<T, AbstractLtlFormula<T>>,

src/formula/Ltl/Globally.h

@@ -39,9 +39,9 @@ class IGloballyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Globally node as root.
+ * Class for an abstract (path) formula tree with a Globally node as root.
  *
- * Has one Abstract state formula as sub formula/tree.
+ * Has one Abstract LTL formula as sub formula/tree.
  *
  * @par Semantics
  * The formula holds iff globally \e child holds.
@@ -50,7 +50,6 @@ class IGloballyModelChecker {
  * (this behavior can be prevented by setting them to nullptr before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class Globally : public storm::formula::abstract::Globally<T, AbstractLtlFormula<T>>,

src/formula/Ltl/Next.h

@@ -38,9 +38,9 @@ class INextModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Next node as root.
+ * Class for an abstract (path) formula tree with a Next node as root.
  *
- * Has two Abstract state formulas as sub formulas/trees.
+ * Has two Abstract LTL formulas as sub formulas/trees.
  *
  * @par Semantics
  * The formula holds iff in the next step, \e child holds
@@ -49,7 +49,6 @@ class INextModelChecker {
  * (this behavior can be prevented by setting them to NULL before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class Next : public storm::formula::abstract::Next<T, AbstractLtlFormula<T>>,

src/formula/Ltl/Not.h

@@ -38,15 +38,14 @@ class INotModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with NOT node as root.
+ * Class for an abstract formula tree with NOT node as root.
  *
- * Has one Abstract state formula as sub formula/tree.
+ * Has one Abstract LTL 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 NULL before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class Not : public storm::formula::abstract::Not<T, AbstractLtlFormula<T>>,

src/formula/Ltl/Or.h

@@ -35,6 +35,20 @@ class IOrModelChecker {
 		virtual std::vector<T>* checkOr(const Or<T>& obj) const = 0;
 };
 
+/*!
+ * @brief
+ * Class for an abstract formula tree with OR node as root.
+ *
+ * Has two LTL formulas as sub formulas/trees.
+ *
+ * As OR 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 AbstractLtlFormula
+ */
 template <class T>
 class Or: public storm::formula::abstract::Or<T, AbstractLtlFormula<T>>,
 			 public storm::formula::ltl::AbstractLtlFormula<T> {

src/formula/Ltl/Until.h

@@ -38,9 +38,9 @@ class IUntilModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Until node as root.
+ * Class for an abstract (path) formula tree with an Until node as root.
  *
- * Has two Abstract state formulas as sub formulas/trees.
+ * Has two Abstract LTL formulas as sub formulas/trees.
  *
  * @par Semantics
  * The formula holds iff eventually, formula \e right (the right subtree) holds, and before,
@@ -50,7 +50,6 @@ class IUntilModelChecker {
  * (this behavior can be prevented by setting them to NULL before deletion)
  *
  * @see AbstractLtlFormula
- * @see AbstractFormula
  */
 template <class T>
 class Until : public storm::formula::abstract::Until<T, AbstractLtlFormula<T>>,

src/formula/Prctl/And.h

@@ -40,7 +40,7 @@ class IAndModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with AND node as root.
+ * Class for an abstract formula tree with AND node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Prctl/Ap.h

@@ -39,7 +39,7 @@ class IApModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with atomic proposition as root.
+ * Class for an abstract formula tree with atomic proposition as root.
  *
  * This class represents the leaves in the formula tree.
  *

src/formula/Prctl/BoundedEventually.h

@@ -42,7 +42,7 @@ class IBoundedEventuallyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedEventually node as root.
+ * Class for an abstract (path) formula tree with a BoundedEventually node as root.
  *
  * Has one Abstract state formulas as sub formula/tree.
  *

src/formula/Prctl/BoundedNaryUntil.h

@@ -45,7 +45,7 @@ class IBoundedNaryUntilModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedNaryUntil node as root.
+ * Class for an abstract (path) formula tree with a BoundedNaryUntil node as root.
  *
  * Has at least two Abstract state formulas as sub formulas and an interval
  * associated with all but the first sub formula. We'll call the first one

src/formula/Prctl/BoundedUntil.h

@@ -41,7 +41,7 @@ class IBoundedUntilModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedUntil node as root.
+ * Class for an abstract (path) formula tree with a BoundedUntil node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Prctl/CumulativeReward.h

@@ -40,7 +40,7 @@ class ICumulativeRewardModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Cumulative Reward node as root.
+ * Class for an abstract (path) formula tree with a Cumulative Reward node as root.
  *
  * 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)

src/formula/Prctl/Eventually.h

@@ -39,7 +39,7 @@ class IEventuallyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Eventually node as root.
+ * Class for an abstract (path) formula tree with an Eventually node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Prctl/Globally.h

@@ -40,7 +40,7 @@ class IGloballyModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Globally node as root.
+ * Class for an abstract (path) formula tree with a Globally node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Prctl/InstantaneousReward.h

@@ -41,7 +41,7 @@ class IInstantaneousRewardModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Instantaneous Reward node as root.
+ * Class for an abstract (path) formula tree with a Instantaneous Reward node as root.
  *
  * 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)

src/formula/Prctl/Next.h

@@ -39,7 +39,7 @@ class INextModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Next node as root.
+ * Class for an abstract (path) formula tree with a Next node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Prctl/Not.h

@@ -39,7 +39,7 @@ class INotModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with NOT node as root.
+ * Class for an abstract formula tree with NOT node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Prctl/Or.h

@@ -38,7 +38,7 @@ class IOrModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with OR node as root.
+ * Class for an abstract formula tree with OR node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/Prctl/ProbabilisticBoundOperator.h

@@ -33,7 +33,7 @@ class IProbabilisticBoundOperatorModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator node over a probability interval
+ * Class for an abstract formula tree with a P (probablistic) operator node over a probability interval
  * as root.
  *
  * Has one Abstract path formula as sub formula/tree.

src/formula/Prctl/ProbabilisticNoBoundOperator.h

@@ -18,7 +18,7 @@ namespace prctl {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator without declaration of probabilities
+ * Class for an abstract formula tree with a P (probablistic) operator without declaration of probabilities
  * as root.
  *
  * Checking a formula with this operator as root returns the probabilities that the path formula holds

src/formula/Prctl/ReachabilityReward.h

@@ -39,7 +39,7 @@ class IReachabilityRewardModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Reachability Reward node as root.
+ * Class for an abstract (path) formula tree with an Reachability Reward node as root.
  *
  * Has one Abstract state formula as sub formula/tree.
  *

src/formula/Prctl/RewardBoundOperator.h

@@ -33,7 +33,7 @@ class IRewardBoundOperatorModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a R (reward) operator node over a reward interval as root.
+ * Class for an abstract formula tree with a R (reward) operator node over a reward interval as root.
  *
  * Has a reward path formula as sub formula/tree.
  *

src/formula/Prctl/RewardNoBoundOperator.h

@@ -18,7 +18,7 @@ namespace prctl {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a R (reward) operator without declaration of reward values
+ * Class for an abstract formula tree with a R (reward) operator without declaration of reward values
  * as root.
  *
  * Checking a formula with this operator as root returns the reward for the reward path formula for

src/formula/Prctl/SteadyStateReward.h

@@ -40,7 +40,7 @@ class ISteadyStateRewardModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Steady State Reward node as root.
+ * Class for an abstract (path) formula tree with a Steady State Reward node as root.
  *
  * @see AbstractPathFormula
  * @see AbstractPrctlFormula

src/formula/Prctl/Until.h

@@ -39,7 +39,7 @@ class IUntilModelChecker {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Until node as root.
+ * Class for an abstract (path) formula tree with an Until node as root.
  *
  * Has two Abstract state formulas as sub formulas/trees.
  *

src/formula/abstract/And.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Logic-abstract Class for a Abstract formula tree with AND node as root.
+ * Logic-abstract Class for an abstract formula tree with AND node as root.
  *
  * Has two formulas as sub formulas/trees; the type is the template parameter FormulaType
  *

src/formula/abstract/BoundedEventually.h

@@ -22,7 +22,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedEventually node as root.
+ * Class for an abstract (path) formula tree with a BoundedEventually node as root.
  *
  * Has one formula as sub formula/tree.
  *

src/formula/abstract/BoundedNaryUntil.h

@@ -22,7 +22,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedNaryUntil node as root.
+ * Class for an abstract (path) formula tree with a BoundedNaryUntil node as root.
  *
  * Has at least two formulas as sub formulas and an interval
  * associated with all but the first sub formula. We'll call the first one

src/formula/abstract/BoundedUntil.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a BoundedUntil node as root.
+ * Class for an abstract (path) formula tree with a BoundedUntil node as root.
  *
  * Has two formulas as sub formulas/trees.
  *

src/formula/abstract/CumulativeReward.h

@@ -18,7 +18,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Cumulative Reward node as root.
+ * Class for an abstract (path) formula tree with a Cumulative Reward node as root.
  *
  * 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)

src/formula/abstract/Eventually.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Eventually node as root.
+ * Class for an abstract (path) formula tree with an Eventually node as root.
  *
  * Has one formula as sub formula/tree.
  *

src/formula/abstract/Globally.h

@@ -20,7 +20,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a Globally node as root.
+ * Class for an abstract formula tree with a Globally node as root.
  *
  * Has one formula as sub formula/tree.
  *

src/formula/abstract/InstantaneousReward.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Instantaneous Reward node as root.
+ * Class for an abstract (path) formula tree with a Instantaneous Reward node as root.
  *
  * 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)

src/formula/abstract/Next.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Next node as root.
+ * Class for an abstract (path) formula tree with a Next node as root.
  *
  * Has two formulas as sub formulas/trees.
  *

src/formula/abstract/Not.h

@@ -20,7 +20,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with NOT node as root.
+ * Class for an abstract formula tree with NOT node as root.
  *
  * Has one formula as sub formula/tree.
  *

src/formula/abstract/PathBoundOperator.h

@@ -26,7 +26,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator node over a probability interval
+ * Class for an abstract formula tree with a P (probablistic) operator node over a probability interval
  * as root.
  *
  * Has one formula as sub formula/tree.

src/formula/abstract/PathNoBoundOperator.h

@@ -21,7 +21,7 @@ namespace formula {
 namespace abstract {
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator without declaration of probabilities
+ * Class for an abstract formula tree with a P (probablistic) operator without declaration of probabilities
  * as root.
  *
  * Checking a formula with this operator as root returns the probabilities that the path formula holds
@@ -91,7 +91,7 @@ public:
 	}
 
 	/*!
-	 * @returns the child node (representation of a Abstract path formula)
+	 * @returns the child node (representation of an abstract path formula)
 	 */
 	const FormulaType& getPathFormula () const {
 		return *pathFormula;

src/formula/abstract/ProbabilisticBoundOperator.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator node over a probability interval
+ * Class for an abstract formula tree with a P (probablistic) operator node over a probability interval
  * as root.
  *
  * Has one Abstract path formula as sub formula/tree.

src/formula/abstract/ProbabilisticNoBoundOperator.h

@@ -18,7 +18,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator without declaration of probabilities
+ * Class for an abstract formula tree with a P (probablistic) operator without declaration of probabilities
  * as root.
  *
  * Checking a formula with this operator as root returns the probabilities that the path formula holds

src/formula/abstract/RewardBoundOperator.h

@@ -17,7 +17,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a R (reward) operator node over a reward interval as root.
+ * Class for an abstract formula tree with a R (reward) operator node over a reward interval as root.
  *
  * Has a reward path formula as sub formula/tree.
  *

src/formula/abstract/RewardNoBoundOperator.h

@@ -17,7 +17,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a R (reward) operator without declaration of reward values
+ * Class for an abstract formula tree with a R (reward) operator without declaration of reward values
  * as root.
  *
  * Checking a formula with this operator as root returns the reward for the reward path formula for

src/formula/abstract/StateBoundOperator.h

@@ -21,7 +21,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a P (probablistic) operator node over a probability interval
+ * Class for an abstract formula tree with a P (probablistic) operator node over a probability interval
  * as root.
  *
  * Has one formula as sub formula/tree.

src/formula/abstract/StateNoBoundOperator.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with an operator without declaration of bounds.
+ * Class for an abstract formula tree with an operator without declaration of bounds.
  * as root.
  *
  * Checking a formula with this operator as root returns the probabilities that the path formula holds

src/formula/abstract/SteadyStateReward.h

@@ -18,7 +18,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with a Steady State Reward node as root.
+ * Class for an abstract (path) formula tree with a Steady State Reward node as root.
  *
  * @see AbstractFormula
  */

src/formula/abstract/TimeBoundedOperator.h

@@ -19,7 +19,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract formula tree with a operator node as root that uses a time interval
+ * Class for an abstract formula tree with a operator node as root that uses a time interval
  * (with upper and lower bound)
  *
  * This class does not provide support for sub formulas; this has to be done in concrete subclasses of this abstract class.

src/formula/abstract/TimeBoundedUntil.h

@@ -17,7 +17,7 @@ namespace abstract {
 
 /**
  * @brief
- * Class for a Abstract formula tree with an time bounded until operator as root.
+ * Class for an abstract formula tree with an time bounded until operator as root.
  *
  * @tparam FormulaType The type of the subformula.
  * 		  The instantiation of FormulaType should be a subclass of AbstractFormula, as the functions

src/formula/abstract/Until.h

@@ -18,7 +18,7 @@ namespace abstract {
 
 /*!
  * @brief
- * Class for a Abstract (path) formula tree with an Until node as root.
+ * Class for an abstract (path) formula tree with an Until node as root.
  *
  * Has two formulas as sub formulas/trees.
  *