#include "ltlast/formula.hh"
#include "ltlast/visitor.hh"
Include dependency graph for reduce.hh:
Go to the source code of this file.
Namespaces | |
namespace | spot |
namespace | spot::ltl |
Enumerations | |
enum | reduce_options { Reduce_None = 0, Reduce_Basics = 1, Reduce_Syntactic_Implications = 2, Reduce_Eventuality_And_Universality = 4, Reduce_All = -1U } |
Options for spot::ltl::reduce. More... | |
Functions | |
formula * | reduce (const formula *f, int opt=Reduce_All) |
Reduce a formula f. | |
bool | is_eventual (const formula *f) |
Check whether a formula is eventual. | |
bool | is_universal (const formula *f) |
Check whether a formula is universal. |
|
Options for spot::ltl::reduce.
|
|
Check whether a formula is eventual. This comes from @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} } |
|
Check whether a formula is universal. FIXME: Describe what universal formulae are. Cite paper. |
|
Reduce a formula f.
|