spot
1.0.2
|
Binary operator. More...
#include <ltlast/binop.hh>
Public Types | |
enum | type { Xor, Implies, Equiv, U, R, W, M, EConcat, EConcatMarked, UConcat } |
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. | |
const formula * | first () const |
Get the first operand. | |
const formula * | second () const |
Get the second operand. | |
type | op () const |
Get the type of this operator. | |
const char * | op_name () const |
Get the type of this operator, as a string. | |
virtual std::string | dump () const |
Return a canonic representation of the atomic proposition. | |
const formula * | clone () 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 const formula * | instance (type op, const formula *first, const formula *second) |
Build a unary operator with operation op and children first and second. | |
static unsigned | instance_count () |
Number of instantiated binary operators. For debugging. | |
static std::ostream & | dump_instances (std::ostream &os) |
Dump all instances. For debugging. |
Protected Types | |
typedef std::pair< const formula *, const formula * > | pairf |
typedef std::pair< type, pairf > | pair |
typedef std::map< pair, const binop * > | map |
Protected Member Functions | |
binop (type op, const formula *first, const formula *second) | |
virtual | ~binop () |
void | ref_ () const |
increment reference counter if any | |
bool | unref_ () const |
decrement reference counter if any, return true when the instance must be deleted (usually when the counter hits 0). | |
unsigned | ref_count_ () const |
Number of references to this formula. |
Protected Attributes | |
size_t | count_ |
The hash key of this formula. | |
union { | |
unsigned props | |
ltl_prop is | |
}; |
Static Protected Attributes | |
static map | instances |
Private Attributes | |
type | op_ |
const formula * | first_ |
const formula * | second_ |
Binary operator.
|
protected |
|
protected |
|
protected |
|
inherited |
Different kinds of binary opertaors
And and Or are not here. Because they are often nested we represent them as multops.
|
protectedvirtual |
|
virtual |
Entry point for spot::ltl::visitor instances.
Implements spot::ltl::formula.
|
inlineinherited |
Whether the formula accepts [*0].
References spot::ltl::formula::ltl_prop::accepting_eword, and spot::ltl::formula::is.
|
inherited |
clone this node
This increments the reference counter of this node (if one is used).
|
inherited |
release this node
This decrements the reference counter of this node (if one is used) and can free the object.
Referenced by spot::taa_tgba_labelled< std::string, string_hash >::add_acceptance_condition(), spot::explicit_graph< State, tgba >::add_condition(), spot::explicit_graph< State, tgba >::declare_acceptance_condition(), spot::destroy_key< const ltl::formula * >::destroy(), and spot::explicit_graph< State, tgba >::get_acceptance_condition().
|
virtual |
Return a canonic representation of the atomic proposition.
Implements spot::ltl::formula.
|
static |
Dump all instances. For debugging.
const formula* spot::ltl::binop::first | ( | ) | const |
Get the first operand.
|
inlineinherited |
The properties as a field of bits. For internal use.
References spot::ltl::formula::props.
|
inlineinherited |
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::lbt_atomic_props.
|
inlineinherited |
Return a hash key for the formula.
References spot::ltl::formula::count_.
Referenced by spot::ltl::formula_ptr_less_than::operator()(), and spot::ltl::formula_ptr_hash::operator()().
|
static |
Build a unary operator with operation op and children first and second.
Some reordering will be performed on arguments of commutative operators (Xor and Equiv) to ensure that for instance (a <=> b) is the same formula as (b <=> a).
Furthermore, the following trivial simplifications are performed (the left formula is rewritten as the right formula):
|
static |
Number of instantiated binary operators. For debugging.
|
inlineinherited |
Whether the formula use only boolean operators.
References spot::ltl::formula::ltl_prop::boolean, and spot::ltl::formula::is.
|
inlineinherited |
Whether the formula uses only ELTL operators.
References spot::ltl::formula::ltl_prop::eltl_formula, and spot::ltl::formula::is.
|
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.
|
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.
|
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.
|
inlineinherited |
Whether the formula uses only LTL operators.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::ltl_formula.
|
inlineinherited |
Whether the formula has an occurrence of EConcatMarked.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::not_marked.
|
inlineinherited |
Whether the formula uses only PSL operators.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::psl_formula.
|
inlineinherited |
Whether the formula uses only SERE operators.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::sere_formula.
|
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.
|
inlineinherited |
Whether the formula avoids the F and G operators.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::sugar_free_ltl.
|
inlineinherited |
Whether a PSL/LTL formula is syntactic guarantee property.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::syntactic_guarantee.
|
inlineinherited |
Whether a PSL/LTL formula is syntactic obligation property.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::syntactic_obligation.
|
inlineinherited |
Whether a PSL/LTL formula is syntactic persistence property.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::syntactic_persistence.
|
inlineinherited |
Whether a PSL/LTL formula is syntactic recurrence property.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::syntactic_recurrence.
|
inlineinherited |
Whether a PSL/LTL formula is syntactic safety property.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::syntactic_safety.
|
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.
|
inlineinherited |
Whether the formula avoids the X operator.
References spot::ltl::formula::is, and spot::ltl::formula::ltl_prop::X_free.
|
inlineinherited |
Return the kind of the top-level operator.
References spot::ltl::formula::kind_.
Referenced by spot::ltl::is_atomic_prop(), spot::ltl::is_binop(), spot::ltl::is_bunop(), spot::ltl::is_constant(), spot::ltl::is_multop(), and spot::ltl::is_unop().
type spot::ltl::binop::op | ( | ) | const |
Get the type of this operator.
const char* spot::ltl::binop::op_name | ( | ) | const |
Get the type of this operator, as a string.
|
protectedvirtualinherited |
increment reference counter if any
Reimplemented from spot::ltl::formula.
|
protectedinherited |
Number of references to this formula.
const formula* spot::ltl::binop::second | ( | ) | const |
Get the second operand.
|
protectedvirtualinherited |
decrement reference counter if any, return true when the instance must be deleted (usually when the counter hits 0).
Reimplemented from spot::ltl::formula.
union { ... } |
|
protectedinherited |
The hash key of this formula.
Referenced by spot::ltl::formula::hash().
|
private |
|
staticprotected |
|
inherited |
Referenced by spot::ltl::formula::accepts_eword(), spot::ltl::formula::has_lbt_atomic_props(), spot::ltl::formula::is_boolean(), spot::ltl::formula::is_eltl_formula(), spot::ltl::formula::is_eventual(), spot::ltl::formula::is_finite(), spot::ltl::formula::is_in_nenoform(), spot::ltl::formula::is_ltl_formula(), spot::ltl::formula::is_marked(), spot::ltl::formula::is_psl_formula(), spot::ltl::formula::is_sere_formula(), spot::ltl::formula::is_sugar_free_boolean(), spot::ltl::formula::is_sugar_free_ltl(), spot::ltl::formula::is_syntactic_guarantee(), spot::ltl::formula::is_syntactic_obligation(), spot::ltl::formula::is_syntactic_persistence(), spot::ltl::formula::is_syntactic_recurrence(), spot::ltl::formula::is_syntactic_safety(), spot::ltl::formula::is_universal(), and spot::ltl::formula::is_X_free().
|
private |
|
inherited |
Referenced by spot::ltl::formula::get_props().
|
private |