alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

* src/ltlvisit/reduce.hh (is_eventual, is_universal): More doc.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2004-11-02 17:16:32 +00:00
parent e3de75f677
commit b6f3faba38
2 changed files with 26 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
ChangeLog
View file

@ -1,5 +1,7 @@
2004-11-02 Alexandre Duret-Lutz <adl@src.lip6.fr> 2004-11-02 Alexandre Duret-Lutz <adl@src.lip6.fr>
* src/ltlvisit/reduce.hh (is_eventual, is_universal): More doc.
* src/tgbaalgos/projrun.hh, src/tgbaalgos/projrun.cc: New files. * src/tgbaalgos/projrun.hh, src/tgbaalgos/projrun.cc: New files.
* src/tgbaalgos/Makefile.am (tgbaalgos_HEADERS, * src/tgbaalgos/Makefile.am (tgbaalgos_HEADERS,
libtgbaalgos_la_SOURCES): Add them. libtgbaalgos_la_SOURCES): Add them.

29
src/ltlvisit/reduce.hh
View file

@ -53,9 +53,9 @@ namespace spot
/// \return the reduced formula /// \return the reduced formula
formula* reduce(const formula* f, int opt = Reduce_All); formula* reduce(const formula* f, int opt = Reduce_All);
/// \brief Check whether a formula is eventual. /// \brief Check whether a formula is a pure eventuality.
/// ///
/// This comes from /// Pure eventuality formulae are defined in
/// \verbatim /// \verbatim
/// @InProceedings{ etessami.00.concur, /// @InProceedings{ etessami.00.concur,
/// author = {Kousha Etessami and Gerard J. Holzmann}, /// author = {Kousha Etessami and Gerard J. Holzmann},
@ -70,12 +70,31 @@ namespace spot
/// publisher = {Springer-Verlag} /// publisher = {Springer-Verlag}
/// } /// }
/// \endverbatim /// \endverbatim
/// FIXME: Describe what eventual formulae are. ///
/// A word that satisfies a pure eventuality can be prefixed by
/// anything and still satisfies the formula.
bool is_eventual(const formula* f); bool is_eventual(const formula* f);
/// \brief Check whether a formula is universal. /// \brief Check whether a formula is purely universal.
/// ///
/// FIXME: Describe what universal formulae are. Cite paper. /// Purely universal formulae are defined in
/// \verbatim
/// @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}
/// }
/// \endverbatim
///
/// Any (non-empty) suffix of a word that satisfies if purely
/// universal formula also satisfies the formula.
bool is_universal(const formula* f); bool is_universal(const formula* f);
} }
} }