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

* NEWS: Update with recent changes.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2011-06-08 17:12:06 +02:00
parent 3216494cf6
commit d26a7f7e48
2 changed files with 30 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

4
ChangeLog
View file

@ -1,3 +1,7 @@
2011-06-08 Alexandre Duret-Lutz <adl@lrde.epita.fr>
* NEWS: Update with recent changes.
2011-06-08 Alexandre Duret-Lutz <adl@lrde.epita.fr>
Implement cache pruning in the CGI script.

31
NEWS
View file

@ -1,10 +1,31 @@
New in spot 0.7.1a:
* Spot can read DiVinE models. See iface/dve2/README for details.
* The experimental Nips interface has been removed.
* The dotty_reachable() has a new option "assume_sba" that can
be used for rendering automata with state-based acceptance. In
that case, acceptance states are displayed with a double circle.
* Major new features:
- Spot can read DiVinE models. See iface/dve2/README for details.
- The experimental Nips interface has been removed.
- The genltl tool can now output 20 differents LTL formula families.
It also replace the LTLcounter Perl scripts.
* Major interface changes:
- The destructor of all states is now private. Any code that looks like
"delete some_state;" will cause an compile error and should be
updated to "some_state->destroy();". This new syntax is supported
since version 0.7.
* Minor changes:
- The dotty_reachable() function has a new option "assume_sba" that
can be used for rendering automata with state-based acceptance.
In that case, acceptance states are displayed with a double
circle. ltl2tgba (both command line and on-line) Use it to display
degeneralized automata.
* Internal improvements:
- The on-line ltl2tgba CGI script uses a cache to produce faster
answers.
- Better memory managementmanagment for the states of explicit
automata. Thanks to the aforementioned ->destroy() change, we
can avoid cloning explicit states.
- tgba_product has learned how to be faster when one of the operands
is a Kripke structure (15% speedup).
- The reduction rule for "a M b" has been improved: it can be
reduced to "a & b" if "a" is a pure eventuallity.
New in spot 0.7.1 (2001-02-07):