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

* NEWS: Minor rewritings.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2011-01-27 15:08:57 +01:00
parent 0c9c9fc639
commit 14b701b54d
2 changed files with 14 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

4
ChangeLog
View file

@ -1,3 +1,7 @@
2011-01-27 Alexandre Duret-Lutz <adl@lrde.epita.fr>
* NEWS: Minor rewritings.
2011-01-27 Alexandre Duret-Lutz <adl@lrde.epita.fr> 2011-01-27 Alexandre Duret-Lutz <adl@lrde.epita.fr>
Replace delete by destroy in comments dealing with states. Replace delete by destroy in comments dealing with states.

19
NEWS
View file

@ -5,26 +5,27 @@ New in spot 0.6a:
been rewritten, and is no longer experimental. We have a been rewritten, and is no longer experimental. We have a
developement version of checkpn using it, and it should be developement version of checkpn using it, and it should be
released shortly after Spot 0.7. released shortly after Spot 0.7.
* The function to_spin_string(), used to output an LTL formula using * The function to_spin_string(), that outputs an LTL formula using
Spin's syntax, now takes an optional argument to request full Spin's syntax, now takes an optional argument to request
parenthesis. parentheses at all levels.
* src/ltltest/genltl is a new tool that generates some interesting * src/ltltest/genltl is a new tool that generates some interesting
families of LTL formulae, for testing purpose. families of LTL formulae, for testing purpose.
* bench/ltlclasses/ uses the above tool to conduct the same benchmark * bench/ltlclasses/ uses the above tool to conduct the same benchmark
as in the DepCoS'09 paper by Cichoń et al. The resulting benchmark as in the DepCoS'09 paper by Cichoń et al. The resulting benchmark
completes in 12min, while it tooks days (or crashed) when the paper completes in 12min, while it tooks days (or exhausted the memory)
was written (using Spot 0.4). when the paper was written (they used Spot 0.4).
* Degeneralization has again been improved in two ways: * Degeneralization has again been improved in two ways:
- It will merge the degeneralized transitions that can be merged. - It will merge degeneralized transitions that can be merged.
- It uses a cache to speed up the improvement introduced in 0.6. - It uses a cache to speed up the improvement introduced in 0.6.
* An implementation of Dax et al.'s paper for minimizing obligation * An implementation of Dax et al.'s paper for minimizing obligation
formulae has been integrated. Use ltl2tgba -Rm to enable this formulae has been integrated. Use ltl2tgba -Rm to enable this
optimization; it will have no effect if the property is not an optimization from the command-line; it will have no effect if the
obligation. property is not an obligation.
* bench/wdba/ conducts a benchmark similar to the one on Dax's * bench/wdba/ conducts a benchmark similar to the one on Dax's
webpage, comparing the size of the automata expressing obligation webpage, comparing the size of the automata expressing obligation
formula before and after minimization. See bench/wdba/README for formula before and after minimization. See bench/wdba/README for
results. results.
* Using similar code, Spot can now construct deterministic monitors.
* New ltl2tgba options: * New ltl2tgba options:
-XN: read an input automaton as a neverclaim. -XN: read an input automaton as a neverclaim.
-C, -CR: Compute (and display) a counterexample after running the -C, -CR: Compute (and display) a counterexample after running the
@ -33,7 +34,7 @@ New in spot 0.6a:
(previous version would always compute a replay a (previous version would always compute a replay a
counterexample when emptiness-check was enabled) counterexample when emptiness-check was enabled)
-ks: traverse the automaton to compute its number of states and -ks: traverse the automaton to compute its number of states and
transitions (this is faster than -k whichi will also count transitions (this is faster than -k which will also count
SCCs and paths). SCCs and paths).
-Rn: Minimize automata for obligation formulae. -Rn: Minimize automata for obligation formulae.
-M: Build a deterministic monitor. -M: Build a deterministic monitor.