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

* configure.ac: Bump version to 0.0n.

Browse source 
* NEWS: Update.
This commit is contained in:
Alexandre Duret-Lutz 2004-01-13 17:37:06 +00:00
parent 5b8ff7fb35
commit 770943adc3
3 changed files with 19 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

3
ChangeLog
View file

@ -1,5 +1,8 @@
2004-01-13 Alexandre Duret-Lutz <adl@src.lip6.fr> 2004-01-13 Alexandre Duret-Lutz <adl@src.lip6.fr>
* configure.ac: Bump version to 0.0n.
* NEWS: Update.
* src/tgbaalgos/emptinesscheck.hh (emptiness_check::check, * src/tgbaalgos/emptinesscheck.hh (emptiness_check::check,
emptiness_check::check2): Document them. emptiness_check::check2): Document them.

17
NEWS
View file

@ -1,6 +1,17 @@
New in spot 0.0m New in spot 0.0n (2004-01-13):
New in spot 0.0l (2003-11-01): * emptiness_check::check2() is a variant of Couvreur's emptiness check that
explores visited states first.
* Build the EESRG supporting code condinally, as the associated
GreatSPN changes have not yet been contributed to GreatSPN.
* Add a powerset algorithm (determinize TGBA ignoring acceptance
conditions, i.e., as if they were used to recognize finite languages).
* tgba_explicit::merge_transitions: merge transitions with same source,
destination, and acceptance condition.
* Run test cases within valgrind.
* Various bug fixes.
New in spot 0.0l (2003-12-01):
* Computation of prime implicants. This simplify the output of * Computation of prime implicants. This simplify the output of
ltl_to_tgba_fm, and allows conditions to be output as some of ltl_to_tgba_fm, and allows conditions to be output as some of
@ -9,7 +20,7 @@ New in spot 0.0l (2003-11-01):
* tgba_explicit supports arbitrary binary formulae on transitions * tgba_explicit supports arbitrary binary formulae on transitions
(only conjunctions were allowed). (only conjunctions were allowed).
New in spot 0.0j (2003-10-03): New in spot 0.0j (2003-11-03):
* Use hash_map's instead of map's almost everywhere. * Use hash_map's instead of map's almost everywhere.
* New emptiness check, based on Couvreur's algorithm. * New emptiness check, based on Couvreur's algorithm.

4
configure.ac
View file

@ -1,4 +1,4 @@
# Copyright (C) 2003 Laboratoire d'Informatique de Paris 6 (LIP6), # Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
# département Systèmes Répartis Coopératifs (SRC), Université Pierre # département Systèmes Répartis Coopératifs (SRC), Université Pierre
# et Marie Curie. # et Marie Curie.
# #
@ -20,7 +20,7 @@
# 02111-1307, USA. # 02111-1307, USA.
AC_PREREQ([2.57]) AC_PREREQ([2.57])
AC_INIT([spot], [0.0m]) AC_INIT([spot], [0.0n])
AC_CONFIG_AUX_DIR([tools]) AC_CONFIG_AUX_DIR([tools])
AM_INIT_AUTOMAKE([gnits nostdinc 1.8]) AM_INIT_AUTOMAKE([gnits nostdinc 1.8])