spot  0.9.1
Classes | Public Types | Public Member Functions | Protected Member Functions | Protected Attributes | Private Attributes | Static Private Attributes
spot::ltl::formula Class Reference

An LTL formula.The only way you can work with a formula is to build a spot::ltl::visitor or spot::ltl::const_visitor. More...

#include <ltlast/formula.hh>

Inheritance diagram for spot::ltl::formula:
Inheritance graph
[legend]
Collaboration diagram for spot::ltl::formula:
Collaboration graph
[legend]

List of all members.

Classes

struct  ltl_prop

Public Types

enum  opkind {
  Constant, AtomicProp, UnOp, BinOp,
  MultOp, BUnOp, AutomatOp
}
 Kind of a sub-formula. More...

Public Member Functions

virtual void accept (visitor &v) const =0
 Entry point for spot::ltl::visitor instances.
const formulaclone () const
 clone this node
void destroy () const
 release this node
virtual std::string dump () const =0
 Return a canonic representation of the formula.
opkind kind () const
 Return the kind of the top-level operator.
bool is_boolean () const
 Whether the formula use only boolean operators.
bool is_sugar_free_boolean () const
 Whether the formula use only AND, OR, and NOT operators.
bool is_in_nenoform () const
 Whether the formula is in negative normal form.
bool is_X_free () const
 Whether the formula avoids the X operator.
bool is_sugar_free_ltl () const
 Whether the formula avoids the F and G operators.
bool is_ltl_formula () const
 Whether the formula uses only LTL operators.
bool is_eltl_formula () const
 Whether the formula uses only ELTL operators.
bool is_psl_formula () const
 Whether the formula uses only PSL operators.
bool is_sere_formula () const
 Whether the formula uses only SERE operators.
bool is_finite () const
bool is_eventual () const
 Whether the formula is purely eventual.
bool is_universal () const
 Whether a formula is purely universal.
bool is_syntactic_safety () const
 Whether a PSL/LTL formula is syntactic safety property.
bool is_syntactic_guarantee () const
 Whether a PSL/LTL formula is syntactic guarantee property.
bool is_syntactic_obligation () const
 Whether a PSL/LTL formula is syntactic obligation property.
bool is_syntactic_recurrence () const
 Whether a PSL/LTL formula is syntactic recurrence property.
bool is_syntactic_persistence () const
 Whether a PSL/LTL formula is syntactic persistence property.
bool is_marked () const
 Whether the formula has an occurrence of EConcatMarked.
bool accepts_eword () const
 Whether the formula accepts [*0].
unsigned get_props () const
 The properties as a field of bits. For internal use.
size_t hash () const
 Return a hash key for the formula.

Protected Member Functions

 formula (opkind k)
virtual ~formula ()
virtual void ref_ () const
 increment reference counter if any
virtual bool unref_ () const
 decrement reference counter if any, return true when the instance must be deleted (usually when the counter hits 0).

Protected Attributes

size_t count_
 The hash key of this formula.
union {
   unsigned   props
   ltl_prop   is
}; 

Private Attributes

opkind kind_

Static Private Attributes

static size_t max_count
 Number of formulae created so far.

Detailed Description

An LTL formula.

The only way you can work with a formula is to build a spot::ltl::visitor or spot::ltl::const_visitor.


Member Enumeration Documentation

Kind of a sub-formula.

Enumerator:
Constant 
AtomicProp 
UnOp 
BinOp 
MultOp 
BUnOp 
AutomatOp 

Constructor & Destructor Documentation

spot::ltl::formula::formula ( opkind  k) [inline, protected]

References max_count.

virtual spot::ltl::formula::~formula ( ) [protected, virtual]

Member Function Documentation

virtual void spot::ltl::formula::accept ( visitor v) const [pure virtual]
bool spot::ltl::formula::accepts_eword ( ) const [inline]

Whether the formula accepts [*0].

References spot::ltl::formula::ltl_prop::accepting_eword, and is.

clone this node

This increments the reference counter of this node (if one is used).

virtual std::string spot::ltl::formula::dump ( ) const [pure virtual]
unsigned spot::ltl::formula::get_props ( ) const [inline]

The properties as a field of bits. For internal use.

References props.

size_t spot::ltl::formula::hash ( ) const [inline]

Return a hash key for the formula.

References count_.

Referenced by spot::ltl::formula_ptr_less_than::operator()(), and spot::ltl::formula_ptr_hash::operator()().

bool spot::ltl::formula::is_boolean ( ) const [inline]

Whether the formula use only boolean operators.

References spot::ltl::formula::ltl_prop::boolean, and is.

bool spot::ltl::formula::is_eltl_formula ( ) const [inline]

Whether the formula uses only ELTL operators.

References spot::ltl::formula::ltl_prop::eltl_formula, and is.

bool spot::ltl::formula::is_eventual ( ) const [inline]

Whether the formula is purely eventual.

Pure eventuality formulae are defined in

      /// @InProceedings{	  etessami.00.concur,
      /// author  	= {Kousha Etessami and Gerard J. Holzmann},
      /// title		= {Optimizing {B\"u}chi Automata},
      /// booktitle	= {Proceedings of the 11th International Conference on
      /// 		  Concurrency Theory (Concur'2000)},
      /// pages		= {153--167},
      /// year		= {2000},
      /// editor  	= {C. Palamidessi},
      /// volume  	= {1877},
      /// series  	= {Lecture Notes in Computer Science},
      /// publisher	= {Springer-Verlag}
      /// }
      /// 

A word that satisfies a pure eventuality can be prefixed by anything and still satisfies the formula.

References spot::ltl::formula::ltl_prop::eventual, and is.

bool spot::ltl::formula::is_finite ( ) const [inline]

Whether a SERE describes a finite language, or an LTL formula uses no temporal operator but X.

References spot::ltl::formula::ltl_prop::finite, and is.

bool spot::ltl::formula::is_in_nenoform ( ) const [inline]

Whether the formula is in negative normal form.

A formula is in negative normal form if the not operators occur only in front of atomic propositions.

References spot::ltl::formula::ltl_prop::in_nenoform, and is.

bool spot::ltl::formula::is_ltl_formula ( ) const [inline]

Whether the formula uses only LTL operators.

References is, and spot::ltl::formula::ltl_prop::ltl_formula.

bool spot::ltl::formula::is_marked ( ) const [inline]

Whether the formula has an occurrence of EConcatMarked.

References is, and spot::ltl::formula::ltl_prop::not_marked.

bool spot::ltl::formula::is_psl_formula ( ) const [inline]

Whether the formula uses only PSL operators.

References is, and spot::ltl::formula::ltl_prop::psl_formula.

bool spot::ltl::formula::is_sere_formula ( ) const [inline]

Whether the formula uses only SERE operators.

References is, and spot::ltl::formula::ltl_prop::sere_formula.

Whether the formula use only AND, OR, and NOT operators.

References is, and spot::ltl::formula::ltl_prop::sugar_free_boolean.

bool spot::ltl::formula::is_sugar_free_ltl ( ) const [inline]

Whether the formula avoids the F and G operators.

References is, and spot::ltl::formula::ltl_prop::sugar_free_ltl.

Whether a PSL/LTL formula is syntactic guarantee property.

References is, and spot::ltl::formula::ltl_prop::syntactic_guarantee.

Whether a PSL/LTL formula is syntactic obligation property.

References is, and spot::ltl::formula::ltl_prop::syntactic_obligation.

Whether a PSL/LTL formula is syntactic persistence property.

References is, and spot::ltl::formula::ltl_prop::syntactic_persistence.

Whether a PSL/LTL formula is syntactic recurrence property.

References is, and spot::ltl::formula::ltl_prop::syntactic_recurrence.

bool spot::ltl::formula::is_syntactic_safety ( ) const [inline]

Whether a PSL/LTL formula is syntactic safety property.

References is, and spot::ltl::formula::ltl_prop::syntactic_safety.

bool spot::ltl::formula::is_universal ( ) const [inline]

Whether a formula is purely universal.

Purely universal formulae are defined in

      /// @InProceedings{	  etessami.00.concur,
      /// author  	= {Kousha Etessami and Gerard J. Holzmann},
      /// title		= {Optimizing {B\"u}chi Automata},
      /// booktitle	= {Proceedings of the 11th International Conference on
      /// 		  Concurrency Theory (Concur'2000)},
      /// pages		= {153--167},
      /// year		= {2000},
      /// editor  	= {C. Palamidessi},
      /// volume  	= {1877},
      /// series  	= {Lecture Notes in Computer Science},
      /// publisher	= {Springer-Verlag}
      /// }
      /// 

Any (non-empty) suffix of a word that satisfies a purely universal formula also satisfies the formula.

References is, and spot::ltl::formula::ltl_prop::universal.

bool spot::ltl::formula::is_X_free ( ) const [inline]

Whether the formula avoids the X operator.

References is, and spot::ltl::formula::ltl_prop::X_free.

opkind spot::ltl::formula::kind ( ) const [inline]
virtual void spot::ltl::formula::ref_ ( ) const [protected, virtual]

increment reference counter if any

Reimplemented in spot::ltl::ref_formula.

virtual bool spot::ltl::formula::unref_ ( ) const [protected, virtual]

decrement reference counter if any, return true when the instance must be deleted (usually when the counter hits 0).

Reimplemented in spot::ltl::ref_formula.


Member Data Documentation

union { ... } [protected]
size_t spot::ltl::formula::count_ [protected]

The hash key of this formula.

Referenced by hash().

Referenced by kind().

size_t spot::ltl::formula::max_count [static, private]

Number of formulae created so far.

Referenced by formula().

Referenced by get_props().


The documentation for this class was generated from the following file:

Please comment this page and report errors about it on the RefDocComments page.
Generated on Wed May 23 2012 12:06:47 for spot by doxygen 1.7.6.1