spot  1.0.1
Public Types | Public Member Functions | Static Public Member Functions | Protected Member Functions | Protected Attributes | Private Attributes | Static Private 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.
type val () const
 Return the value of the constant.
const char * val_name () const
 Return the value of the constant as a string.
virtual std::string dump () const
 Return a canonic representation of the formula.
const formulaclone () const
 clone this node
void destroy () const
 release this node
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].
bool has_lbt_atomic_props () const
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.

Static Public Member Functions

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

Protected Member Functions

 constant (type val)
virtual ~constant ()
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

type val_

Static Private Attributes

static constant true_instance_
static constant false_instance_
static constant empty_word_instance_

Detailed Description

A constant (True or False)

Member Enumeration Documentation

Kind of a sub-formula.

Enumerator:
Constant 
AtomicProp 
UnOp 
BinOp 
MultOp 
BUnOp 
AutomatOp 
Enumerator:
False 
True 
EmptyWord 

Constructor & Destructor Documentation

spot::ltl::constant::constant ( type  val)
protected
virtual spot::ltl::constant::~constant ( )
protectedvirtual

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].

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

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
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).

References empty_word_instance_.

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

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

References false_instance_.

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

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

References spot::ltl::formula::props.

bool spot::ltl::formula::has_lbt_atomic_props ( ) const
inlineinherited
size_t spot::ltl::formula::hash ( ) const
inlineinherited
bool spot::ltl::formula::is_boolean ( ) const
inlineinherited

Whether the formula use only boolean operators.

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

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

Whether the formula uses only ELTL operators.

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

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

Whether the formula is purely eventual.

Pure eventuality formulae are defined in
@verbatim 

/// { 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 spot::ltl::formula::is.

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.

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

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.

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

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

Whether the formula uses only LTL operators.

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

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

Whether the formula has an occurrence of EConcatMarked.

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

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

Whether the formula uses only PSL operators.

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

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

Whether the formula uses only SERE operators.

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

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

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

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

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

Whether the formula avoids the F and G operators.

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

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

Whether a PSL/LTL formula is syntactic guarantee property.

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

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

Whether a PSL/LTL formula is syntactic obligation property.

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

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

Whether a PSL/LTL formula is syntactic persistence property.

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

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

Whether a PSL/LTL formula is syntactic recurrence property.

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

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

Whether a PSL/LTL formula is syntactic safety property.

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

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

Whether a formula is purely universal.

Purely universal formulae are defined in
@verbatim 

/// { 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 spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::universal.

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

Whether the formula avoids the X operator.

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

opkind spot::ltl::formula::kind ( ) const
inlineinherited
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).

References true_instance_.

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

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

union { ... }
size_t spot::ltl::formula::count_
protectedinherited

The hash key of this formula.

Referenced by spot::ltl::formula::hash().

constant spot::ltl::constant::empty_word_instance_
staticprivate

Referenced by empty_word_instance().

constant spot::ltl::constant::false_instance_
staticprivate

Referenced by false_instance().

ltl_prop spot::ltl::formula::is
inherited
unsigned spot::ltl::formula::props
inherited
constant spot::ltl::constant::true_instance_
staticprivate

Referenced by true_instance().

type spot::ltl::constant::val_
private

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 Jan 23 2013 15:00:04 for spot by doxygen 1.8.1.2