spot
0.9.1
|
Typedefs | |
typedef std::set< const atomic_prop *, formula_ptr_less_than > | spot::ltl::atomic_prop_set |
Set of atomic propositions. | |
Functions | |
atomic_prop_set * | spot::ltl::atomic_prop_collect (const formula *f, atomic_prop_set *s=0) |
Return the set of atomic propositions occurring in a formula. | |
int | spot::ltl::length (const formula *f) |
Compute the length of a formula.The length of a formula is the number of atomic propositions, constants, and operators (logical and temporal) occurring in the formula. spot::ltl::multop instances with n arguments count for n-1; for instance a | b | c has length 5, even if there is only as single | node internally. | |
int | spot::ltl::length_boolone (const formula *f) |
Compute the length of a formula, squashing Boolean formulaeThis is similar to spot::ltl::length(), except all Boolean formulae are assumed to have length one. | |
bool | spot::ltl::is_eventual (const formula *f) |
Check whether a formula is a pure eventuality.Pure eventuality formulae are defined in. | |
bool | spot::ltl::is_universal (const formula *f) |
Check whether a formula is purely universal.Purely universal formulae are defined in. |
typedef std::set<const atomic_prop*, formula_ptr_less_than> spot::ltl::atomic_prop_set |
Set of atomic propositions.
atomic_prop_set* spot::ltl::atomic_prop_collect | ( | const formula * | f, |
atomic_prop_set * | s = 0 |
||
) |
Return the set of atomic propositions occurring in a formula.
f | the formula to inspect |
s | an existing set to fill with atomic_propositions discovered, or 0 if the set should be allocated by the function. |
s
, augmented with atomic propositions occurring in f
; or a newly allocated set containing all these atomic propositions if s
is 0. bool spot::ltl::is_eventual | ( | const formula * | f | ) |
Check whether a formula is a pure eventuality.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::is_universal | ( | const formula * | f | ) |
Check 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 if purely universal formula also satisfies the formula.
int spot::ltl::length | ( | const formula * | f | ) |
Compute the length of a formula.The length of a formula is the number of atomic propositions, constants, and operators (logical and temporal) occurring in the formula. spot::ltl::multop instances with n arguments count for n-1; for instance a | b | c
has length 5, even if there is only as single |
node internally.
If squash_boolean is set, all Boolean formulae are assumed to have length one.
int spot::ltl::length_boolone | ( | const formula * | f | ) |
Compute the length of a formula, squashing Boolean formulaeThis is similar to spot::ltl::length(), except all Boolean formulae are assumed to have length one.