spot  1.2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Types | Public Member Functions | Static Public Member Functions | Protected Member Functions | Protected Attributes | List of all members
spot::ltl::constant Class Reference

A constant (True or False) More...

#include <ltlast/constant.hh>

Inheritance diagram for spot::ltl::constant:
Inheritance graph
Collaboration diagram for spot::ltl::constant:
Collaboration graph

Public Types

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

Public Member Functions

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

Static Public Member Functions

static constanttrue_instance ()
 Get the sole instance of spot::ltl::constant::constant(True). More...
 
static constantfalse_instance ()
 Get the sole instance of spot::ltl::constant::constant(False). More...
 
static constantempty_word_instance ()
 Get the sole instance of spot::ltl::constant::constant(EmptyWord). More...
 

Protected Member Functions

 constant (type val)
 
virtual void ref_ () const
 increment reference counter if any More...
 
virtual bool unref_ () const
 decrement reference counter if any, return true when the instance must be deleted (usually when the counter hits 0). More...
 

Protected Attributes

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

Detailed Description

A constant (True or False)

Member Enumeration Documentation

Kind of a sub-formula.

Member Function Documentation

virtual void spot::ltl::constant::accept ( visitor v) const
virtual

Entry point for spot::ltl::visitor instances.

Implements spot::ltl::formula.

bool spot::ltl::formula::accepts_eword ( ) const
inlineinherited

Whether the formula accepts [*0].

const formula* spot::ltl::formula::clone ( ) const
inherited

clone this node

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

void spot::ltl::formula::destroy ( ) const
inherited

release this node

This decrements the reference counter of this node (if one is used) and can free the object.

virtual std::string spot::ltl::constant::dump ( ) const
virtual

Return a canonic representation of the formula.

Implements spot::ltl::formula.

static constant* spot::ltl::constant::empty_word_instance ( )
inlinestatic

Get the sole instance of spot::ltl::constant::constant(EmptyWord).

static constant* spot::ltl::constant::false_instance ( )
inlinestatic

Get the sole instance of spot::ltl::constant::constant(False).

unsigned spot::ltl::formula::get_props ( ) const
inlineinherited

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

size_t spot::ltl::formula::hash ( ) const
inlineinherited

Return a hash key for the formula.

bool spot::ltl::formula::is_boolean ( ) const
inlineinherited

Whether the formula use only boolean operators.

bool spot::ltl::formula::is_eltl_formula ( ) const
inlineinherited

Whether the formula uses only ELTL operators.

bool spot::ltl::formula::is_eventual ( ) const
inlineinherited

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.

bool spot::ltl::formula::is_finite ( ) const
inlineinherited

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

bool spot::ltl::formula::is_in_nenoform ( ) const
inlineinherited

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.

bool spot::ltl::formula::is_ltl_formula ( ) const
inlineinherited

Whether the formula uses only LTL operators.

bool spot::ltl::formula::is_marked ( ) const
inlineinherited

Whether the formula has an occurrence of EConcatMarked.

bool spot::ltl::formula::is_psl_formula ( ) const
inlineinherited

Whether the formula uses only PSL operators.

bool spot::ltl::formula::is_sere_formula ( ) const
inlineinherited

Whether the formula uses only SERE operators.

bool spot::ltl::formula::is_sugar_free_boolean ( ) const
inlineinherited

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

bool spot::ltl::formula::is_sugar_free_ltl ( ) const
inlineinherited

Whether the formula avoids the F and G operators.

bool spot::ltl::formula::is_syntactic_guarantee ( ) const
inlineinherited

Whether a PSL/LTL formula is syntactic guarantee property.

bool spot::ltl::formula::is_syntactic_obligation ( ) const
inlineinherited

Whether a PSL/LTL formula is syntactic obligation property.

bool spot::ltl::formula::is_syntactic_persistence ( ) const
inlineinherited

Whether a PSL/LTL formula is syntactic persistence property.

bool spot::ltl::formula::is_syntactic_recurrence ( ) const
inlineinherited

Whether a PSL/LTL formula is syntactic recurrence property.

bool spot::ltl::formula::is_syntactic_safety ( ) const
inlineinherited

Whether a PSL/LTL formula is syntactic safety property.

bool spot::ltl::formula::is_universal ( ) const
inlineinherited

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.

bool spot::ltl::formula::is_X_free ( ) const
inlineinherited

Whether the formula avoids the X operator.

opkind spot::ltl::formula::kind ( ) const
inlineinherited

Return the kind of the top-level operator.

virtual void spot::ltl::formula::ref_ ( ) const
protectedvirtualinherited

increment reference counter if any

Reimplemented in spot::ltl::ref_formula.

static constant* spot::ltl::constant::true_instance ( )
inlinestatic

Get the sole instance of spot::ltl::constant::constant(True).

Referenced by spot::ltl::bunop::one_star().

virtual bool spot::ltl::formula::unref_ ( ) const
protectedvirtualinherited

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.

type spot::ltl::constant::val ( ) const
inline

Return the value of the constant.

const char* spot::ltl::constant::val_name ( ) const

Return the value of the constant as a string.

Member Data Documentation

size_t spot::ltl::formula::count_
protectedinherited

The hash key of this formula.


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

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Thu May 15 2014 11:04:12 for spot by doxygen 1.8.4