NEWS 27.7 KB
Newer Older
1
2
New in spot 0.9a:

3
4
5
  * Bug fixes:
    - The random SERE generator was using the wrong operators
      for "and" and "or", mistaking And/Or with AndRat/OrRat.
6
7
    - The translation of !{r} was incorrect when this subformula
      was recurring (e.g. in G!{r}) and r had loops.
8

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
9
New in spot 0.9 (2012-05-09):
10

11
  * New features:
12
13
14
15
16
17
18
19
20
    - Operators from the linear fragment of PSL are supported.  This
      basically extends LTL with Sequential Extended Regulat
      Expressions (SERE), and a couple of operators to bridge SERE and
      LTL.  See doc/tl/tl.pdf for the list of operators and their
      semantics.
    - Formula rewritings have been completely revamped, and augmented
      with rules for PSL operators (and some new LTL rules as well).
      See doc/tl/tl.pdf for the list of the rewritings implemented.
    - Some of these rewritings that may produce larger formulas
21
      (for instance to rewrite "{a;b;c}" into "a & X(b & Xc)")
22
23
24
25
26
27
28
29
      may be explicitely disabled with a new option.
    - The src/ltltest/randltl tool can now generate random SEREs
      and random PSL formulae.
    - Only one translator (ltl2tgba_fm) has been augmented to
      translate the new SERE and PSL operators.  The internal
      translation from SERE to DFA is likely to be rewriten in a
      future version.
    - A new function, length_boolone(), computes the size of an
30
31
32
33
34
35
36
      LTL/PSL formula while considering that any Boolean term has
      length 1.
    - The LTL/PSL parser recognizes some UTF-8 characters (like ◇ or
      ∧) as operators, and some output routines now have an UTF-8
      output mode.  Tools like randltl and ltl2tgba have gained an -8
      option to enable such output.  See doc/tl/tl.pdf for the list
      of recognized codepoints.
37
    - A new direct simulation reduction has been implemented.  It
38
      works directly on TGBAs.  It is in src/tgbaalgos/simlation.hh,
39
      and it can be tested via ltl2tgba's -RDS option.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
40
    - unabbreviate_wm() is a function that rewrites the W and M operators
41
42
43
44
45
      of LTL formulae using R and U.  This is called whenever we output
      a formula in Spin syntax.  By combining this with the aforementioned
      PSL rewriting rules, many PSL formulae that use simple SERE can be
      converted into LTL formulae that can be feed to tools that only
      understand U and R.  The web interface will let you do this.
46
47
48
    - changes to the on-line translator:
      + SVG output is available
      + can display some properties of a formula
49
50
      + new options for direct simulation, larger rewritings, and
        utf-8 output
51
52
53
54
    - configure --without-included-lbtt will prevent LBTT from being
      configured and built.  This helps on systems (such as MinGW)
      where LBTT cannot be built.  The test-suite will skip any
      LBTT-based test if LBTT is missing.
55
  * Interface changes:
56
    - Operators ->, <->, U, W, R, and M are now parsed as
57
      right-associative to better match the PSL standard.
58
59
60
61
62
63
64
65
66
67
68
69
70
71
    - The constructors for temporal formulae will perform some trivial
      simplifications based on associativity, commutativity,
      idempotence, and neutral elements.  See doc/tl/tl.pdf for the
      list of such simplifications.
    - Formula instances now have many methods to inspect their
      properties (membership to syntactic classes, absence of X
      operator, etc...) in constant time.
    - LTL/PSL formulae are now handled everywhere as 'const formula*'
      and not just 'formula*'.  This reflects the true nature of these
      (immutable) formula objects, and cleanups a lot of code.
      Unfortunately, it is a backward incompatible change: you may have
      to add 'const' to a couple of lines in your code, and change
      'ltl::const_vistitor' into 'ltl::visitor' if you have written a
      custom visitor.
72
73
74
75
    - The new entry point for LTL/PSL simplifications is the function
      ltl_simplifier::simplify() declared in src/ltlvisit/simplify.hh.
      The ltl_simplifier class implements a cache.
      Functions such as reduce() or reduce_tau03() are deprecated.
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
    - The old game-theory-based implementations for direct and delayed
      simulation reductions have been removed.  The old direct
      simulation would only work on degeneralized automata, and yet
      produce results inferior to the new direct simulation introduced
      in this release.  The implementation of delayed simulation was
      unreliable.  The function reduc_tgba_sim() has been kept
      for compatibility (it calls the new direct simulation whatever
      the type of simulation requested) and marked as deprecated.
      ltl2tgba's options -Rd, -RD are gone.  Options -R1t, -R1s,
      -R2s, and -R2t are deprecated and all made equivalent to -RDS.
    - The tgba_explicit hierarchy has been reorganized in order to
      make room for sba_explicit classes that share most of the code.
      The main consequence is that the tgba_explicit type no longuer
      exists.  However the tgba_explicit_number,
      tgba_explicit_formula, and tgba_explicit_string still do.
91

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
92
New in spot 0.8.3 (2012-03-09):
93

94
95
  * Support for both Python 2.x and Python 3.x.
    (Previous versions would only work with Python 2.x.)
96
97
  * The online ltl2tgba.html now stores its state in the URL so that
    history is preserved, and links to particular setups can be sent.
98
99
100
101
  * Bug fixes:
    - Fix a segfault in the compression code used by the -Z
      option of dve2check.
    - Fix a race condition in the CGI script.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
102
    - Fix a segfault in the CGI script when computing a Büchi run.
103

104
New in spot 0.8.2 (2012-01-19):
105

106
107
  * configure now has a --disable-python option to disable
    the compilation of Python bindings.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
108
  * Minor speedups in the Safra complementation.
109
  * Better memory management for the on-the-fly degeneralization
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
110
    algorithm.  This mostly benefits to the Safra complementation.
111
112
113
  * Bug fixes:
    - spot::ltl::length() forgot to count the '&' and '|' operators
      in an LTL formula.
114
115
    - minimize_wdba() could fail to mark some transiant SCCs as accepting,
      producing an automaton that was not fully minimized.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
116
    - minimize_dfa() could produce incorrect automata, but it is not
117
118
119
      clear whether this could have had an inpact on WDBA minimization
      (the worse case is that some TGBA would not have been minimized
      when they could).
120
    - Fix a Python syntax error in the CGI script.
121
122
    - Fix compilation with g++ 4.0.
    - Fix a make check failure when valgrind is missing.
123

124
New in spot 0.8.1 (2011-12-18):
125

126
127
128
129
130
131
132
133
  * Only bug fixes:
    - When ltl2tgba is set to perform both WDBA minimization and
      degeneralization, do the latter only if the former failed.
      In previous version, automata were (uselessly) degeneralized
      before WDBA minimization, causing important slowdowns.
    - Fix compilation with Clang 3.0.
    - Fix a Makefile setup causing a "make check" failure on MacOS X.
    - Fix an mkdir error in the CGI script.
134

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
135
New in spot 0.8 (2011-11-28):
136

137
138
  * Major new features:
    - Spot can read DiVinE models.  See iface/dve2/README for details.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
139
    - The genltl tool can now output 20 different LTL formula families.
140
      It also replaces the LTLcounter Perl scripts.
141
    - There is a printer and parser for Kripke structures in text format.
142
143
144
145
146
  * 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.
147
    - The experimental Nips interface has been removed.
148
149
150
151
152
153
  * 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.
154
155
156
    - The dotty_reachable() function will also display transition
      annotations (as returned by the tgba::transitition_annotation()).
      This can be useful when displaying (small) state spaces.
157
158
159
    - Identifiers used to name atomic proposition can contain dots.
      E.g.: X.Y is now an atomic proposition, while it was understood
      as X&Y in previous versions.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
160
    - The Doxygen documentation is no longer built as a PDF file.
161
162
163
  * Internal improvements:
    - The on-line ltl2tgba CGI script uses a cache to produce faster
      answers.
164
165
166
    - Better memory management for the states of explicit automata.
      Thanks to the aforementioned ->destroy() change, we can avoid
      cloning explicit states.
167
168
169
170
    - 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.
171
172
173
174
175
    - More useless acceptance conditions are removed by SCC simplifications.
  * Bug fixes:
    - Safra complementation has been fixed in cases where more than
      one acceptance conditions where needed to convert the
      deterministic Streett automaton as a TGBA.
176
    - The degeneralization is now idempotent.  Previously, degeneralizing
177
178
179
180
      an already degeneralized automaton could add some states.
    - The degeneralization now has a deterministic behavior.  Previously
      it was possible to obtain different output depending on the
      memory layout.
181
182
183
184
185
186
187
188
    - Spot now outputs neverclaims with fully parenthesized guards.
      I.e., instead of
         (!x && y) -> goto S1
      it now outputs
         ((!(x)) && (y)) -> goto S1
      This prevents problems when the model defines `x' as
         #define x flag==0
      because !x then evaluated to (!flag)==0 instead of !(flag==0).
189

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
190
New in spot 0.7.1 (2011-02-07):
191

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
192
193
194
195
196
197
  * The LTL parser will accept operator ~ (for not) as well
    as --> and <--> (for implication and equivalence), allowing
    formulae from the Büchi Store to be read directly.
  * The neverclaim parser will accept guards of the form
        :: !(...) -> goto ...
    instead of the more commonly used
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
198
        :: (!(...)) -> goto ...
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
199
200
    This makes it possible to read neverclaims provided by the Büchi Store.
  * A new ltl2tgba option, -kt, will count the number of "sub-transitions".
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
201
    I.e., a transition labelled by "true" counts for 4 "sub-transitions"
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
202
203
204
    if the automaton uses 2 atomic propositions.
  * Bugs fixed:
    - Fix segfault during WDBA minimization on automata with useless states.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
205
    - Use the included BuDDy library if the one already installed
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
206
207
      is older than the one distributed with Spot 0.7.
    - Fix two typos in the code of the CGI scripts.
208

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
209
New in spot 0.7 (2011-02-01):
210

211
212
213
214
215
  * Spot is now able to read an automaton expressed as a Spin neverclaim.
  * The "experimental" Kripke structure introduced in Spot 0.5 has
    been rewritten, and is no longer experimental.  We have a
    developement version of checkpn using it, and it should be
    released shortly after Spot 0.7.
216
217
218
  * The function to_spin_string(), that outputs an LTL formula using
    Spin's syntax, now takes an optional argument to request
    parentheses at all levels.
219
220
  * src/ltltest/genltl is a new tool that generates some interesting
    families of LTL formulae, for testing purpose.
221
  * bench/ltlclasses/ uses the above tool to conduct the same benchmark
222
    as in the DepCoS'09 paper by Cichoń et al.  The resulting benchmark
223
224
    completes in 12min, while it tooks days (or exhausted the memory)
    when the paper was written (they used Spot 0.4).
225
  * Degeneralization has again been improved in two ways:
226
    - It will merge degeneralized transitions that can be merged.
227
    - It uses a cache to speed up the improvement introduced in 0.6.
228
229
  * An implementation of Dax et al.'s paper for minimizing obligation
    formulae has been integrated.  Use ltl2tgba -Rm to enable this
230
231
    optimization from the command-line; it will have no effect if the
    property is not an obligation.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
232
233
  * bench/wdba/ conducts a benchmark similar to the one on Dax's
    webpage, comparing the size of the automata expressing obligation
234
235
    formula before and after minimization.  See bench/wdba/README for
    results.
236
  * Using similar code, Spot can now construct deterministic monitors.
237
238
239
240
  * New ltl2tgba options:
    -XN: read an input automaton as a neverclaim.
    -C, -CR: Compute (and display) a counterexample after running the
             emptiness check.  With -CR, the counterexample will be
241
242
             replayed on the automaton to ensure it is correct
	     (previous version would always compute a replay a
243
244
	     counterexample when emptiness-check was enabled)
    -ks: traverse the automaton to compute its number of states and
245
         transitions (this is faster than -k which will also count
246
         SCCs and paths).
247
    -M: Build a deterministic monitor.
248
249
250
    -O: Tell whether a formula represents a safety, guarantee, or
        obligation property.
    -Rm: Minimize automata representing obligation properties.
251
252
253
  * The on-line tool to translate LTL formulae into automata
    has been rewritten and is now at http://spot.lip6.fr/ltl2tgba.html
    It requires a javascript-enabled browser.
254
255
256
257
258
  * Bug fixes:
    - Location of the errors messages in the TGBA parser where inaccurate.
    - Various warning fixes for different versions of GCC and Clang.
    - The neverclaim output with ltl2tgba -N or -NN used to ignore any
      automaton simplification performed after degeneralization.
259
    - The formula simplification based on universality and eventuality
260
      had a quadratic run-time.
261

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
262
New in spot 0.6 (2010-04-16):
263

264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
  * Several optimizations to improve some auxiliary steps
    of the LTL translation (not the core of the translation):
    - Better degeneralization
    - SCC simplifications has been tuned for degeneralization
      (ltl2tgba now has two options -R3 and -R3f: the latter will
      remove every acceptance condition that used to be removed
      in Spot 0.5 while the former will leave useless acceptance conditions
      going to accepting SCC.  Experience shows that -R3 is more
      favorable to degeneralization).
    - ltl2tgba will perform SCC optimizations before degeneralization
      and not the converse
    - We added a syntactic simplification rule to rewrite F(a)|F(b) as F(a|b).
      We only had a rule for the more specific FG(a)|FG(b) = F(Ga|Gb).
    - The syntactic simplification rule for F(a&GF(b)) = F(a)&GF(b) has
      be disabled because the latter formula is in fact harder to translate
      efficiently.
280
281
282
283
284
285
286
287
288
289
290
291
  * New LTL operators: W (weak until) and its dual M (strong release)
    - Weak until allows many LTL specification to be specified more
      compactly.
    - All LTL translation algorithms have been updated to
      support these operators.
    - Although they do not add any expressive power, translating
      "a W b" is more efficient (read smaller output automaton) than
      translating the equivalent form using the U operator.
    - Basic syntactic rewriting rules will automatically rewrite "a U
      (b | G(a))" and "(a U b)|G(a)" as "a W b", so you will benefit
      from the new operators even if you do not use them.  Similar
      rewriting rules exist for R and M, although they are less used.
292
293
294
295
296
297
298
  * New options have been added to the CGI script for
    - SVG output
    - SCC simplifications
  * Bug fixes:
    - The precedence of the "->" and "<->" Boolean operators has been
      adjusted to better match other tools.
      Spot <= 0.5 used to parse "a & b -> c & d" as "a & (b -> c) & d";
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
299
      Spot >= 0.6 will parse it as "(a & b) -> (c & d)".
300
301
302
    - The random graph generator was fixed (again!) not to produce
      dead states as documented.
    - Locations in the error messages of the LTL parser were off by one.
303

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
304
New in spot 0.5 (2010-02-01):
305
306
307
308
309

  * We have setup two mailing lists:
    - <spot-announce@lrde.epita.fr> is read-only and will be used to
      announce new releases.  You may subscribe at
      https://www.lrde.epita.fr/mailman/listinfo/spot-announce
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
310
    - <spot@lrde.epita.fr> can be used to discuss anything related
311
312
313
      to Spot.  You may subscribe at
      https://www.lrde.epita.fr/mailman/listinfo/spot-announce
  * Two new LTL translations have been implemented:
314
315
316
317
318
    - eltl_to_tgba_lacim() is a symbolic translation for ELTL based on
      Couvreur's LaCIM'00 paper.  For this translation (available with
      ltl2tgba's option -le), all operators are described as finite
      automata.  A default set of operators is provided for LTL
      (option -lo) and user may add more automaton operators.
319
320
    - ltl_to_taa() is a translation based on Tauriainen's PhD thesis.
      LTL is translated to "self-loop" alternating automata
321
322
      and then to Transition-based Generalized Automata.  (ltl2tgba's
      option -taa).
323
324
325
326
327
    The "Couvreur/FM" translation remains the best LTL translation
    available in Spot.
  * The data structures used to represent LTL formulae have been
    overhauled, and it resulted in a big performence improvement
    (in time and memory consumption) for the LTL translation.
328
  * Two complementation algorithms for state-based Büchi automata
329
    have been implemented:
330
    - tgba_kv_complement is an on-the-fly implementation of the
331
332
333
      Kupferman-Vardi construction (TCS'05) for generalized acceptance
      conditions.
    - tgba_safra_complement is an implementation of Safra's
334
335
      complementation.  This algorithm takes a degeneralized Büchi
      automaton as input, but our implementation for the Streett->Büchi
336
337
338
      step will produce a generalized automaton in the end.
  * ltl2tgba has gained several options and the help text has been
    reorganized.  Please run src/tgbatest/ltl2tgba without arguments
339
    for details.  Couvreur/FM is now the default translation.
340
  * The ltl2tgba.py CGI script can now run standalone.  It also offers
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
341
342
    the Tauriainen/TAA translation, and some options for SCC-based
    reductions.
343
344
345
346
347
  * Automata using BDD-encoded transitions relation can now be pruned
    for useless states symbolically using the delete_unaccepting_scc()
    function.  This is ltl2tgba's -R3b option.
  * The SCC-based simplification (ltl2tgba's -R3 option) has been
    rewritten and improved.
348
349
350
  * The "*" symbol, previously parsed as a synonym for "&" is no
    longer recognized.  This makes room for an upcoming support of
    rational operators.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
351
  * More benchmarks in the bench/ directory:
352
353
354
355
356
357
358
    - gspn-ssp/    some benchmarks published at ACSD'07,
    - ltlcounter/  translation of a class of LTL formulae used by
                     Rozier & Vardi at SPIN'07
    - scc-stats/   SCC statistics after translation of LTL formulae
    - split-product/ parallelizing gain after splitting LTL automata
  * An experimental Kripke interface has been developed to simplify
    the integration of third party tools that do not use acceptance
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
359
    conditions and that have label on states instead of transitions.
360
    This interface has not been used yet.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
361
  * Experimental interface with the Nips virtual machine.
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
    It is not very useful as Spot isn't able to retrieve any property
    information from the model.  This will just check assertions.
  * Distribution:
    - The Boost C++ library is now required.
    - Update to Autoconf 2.65, Automake 1.11.1, Libtool 2.2.6b,
      Bison 2.4.1, and Swig 1.3.40.
    - Thanks to the newest Automake, "make check" will now
      run in parallel if you use "make -j2 check" or more.
  * Bug fixes:
    - Disable warnings from the garbage collection of BuDDy, it
      could break the standard output of ltl2tgba.
    - Fix several C++ constructs to ensure Spot will build with
      GCC 4.3, 4.4, and older 3.x releases, as well as with Intel's
      ICC compiler.
    - A very old bug in the hash function for LTL formulae caused Spot
      to sometimes (but very rarely) consider two different LTL formulae
      as equal.
379

380
New in spot 0.4 (2007-07-17):
381

382
383
384
385
386
387
388
389
390
391
392
  * Upgrade to Autoconf 2.61, Automake 1.10, Bison 2.3, and Swig 1.3.31.
  * Better LTL simplifications.
  * Don't initialize Buddy if it has already been initialized (in case
    the client software is already using Buddy).
  * Lots of work in the greatspn interface for our ACSD'05 paper.
  * Bug fixes:
    - Fix the random graph generator not to produce dead states as documented.
    - Fix synchronized product in case both side use acceptance conditions.
    - Fix some syntax errors with newer versions of GCC.

New in spot 0.3 (2006-01-25):
393
394
395
396
397
398
399

  * lbtt 1.2.0
  * The CGI script for LTL translation also offers emptiness check algorithms.
  * tau03_opt_search implements the "ordering heuristic".
    (Submitted by Heikki Tauriainen.)
  * A couple of bugs were fixed into the LTL or automata simplifications.

400
401
402
403
404
405
406
407
408
409
410
411
New in spot 0.2 (2005-04-08):

  * Emptiness checks:
    - the new spot::option_map class is used to pass options to
      emptiness-check algorithms.
    - the new emptiness_check_instantiator class is used to turn a
      string such as `algorithm(option1, option2)' into an actual
      instance of this emptiness-check algorithm with the given
      options.  All tools use this.
    - tau03_opt_search implements the "condition heuristic".
      (Suggested by Heikki Tauriainen.)
  * Minor bug fixes.
412

413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
New in spot 0.1 (2005-01-31):

  * Emptiness checks:
    - They all follow the same interface, and gather statistical data.
    - New algorithms: gv04.hh, se05.hh, tau03.hh, tau03opt.hh
    - New options for couvreur99: poprem and group.
    - reduce_run() try to reduce accepting runs produced by emptiness checks.
    - replay_run() ensure accepting runs are actually accepting runs.
  * New testing tools:
    - ltltest/randltl: Generate random LTL formulae.
    - tgbatest/randtgba: Generate random TGBAs.  Optionally multiply them
        against random LTL formulae.  Optionally check them for emptiness
        with all available algorithms.  Optionally gather statistics.
  * bench/emptchk/: Contains scripts that benchmark emptiness-checks.
  * Split the degeneralization proxy in two:
    - tgba_tba_proxy  uses at most max(N,1) copies
    - tgba_sba_proxy  uses at most 1+max(N,1) copies and has a
                      state_is_accepting() method
  * tgba::transition_annotation annotate a transition with some string.
    This comes handy to associate that transition to its high-level name.
  * Preliminary support for Event-based GBA (the evtgba*/ directories).
    This might as well disappear in a future release.
  * LTL formulae are now sorting using their string representation, instead
    of their memory address (which is still unique).  This makes the output
    of the various functions more deterministic.
  * The Doxygen documentation is now organized using modules.
439

440
441
442
443
444
445
446
447
448
New in spot 0.0x (2004-08-13):

  * New atomic_prop_collect() function: collect atomic propositions
    in an LTL formula.
  * Fix several typos in documentation, and some warnings in the code.
  * Now compiles on Darwin and Cygwin.
  * Upgrade to Automake 1.9.1, and lbtt 1.1.2.
    (And drop support for older lbtt versions.)
  * Support newer versions of Valgrind (>= 2.1.0).
449

450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
New in spot 0.0v (2004-06-29):

  * LTL formula simplifications using basic rewriting rules,
    a-la Wring syntactic approximations, and Etessami's universal
    and existential classes.
     - Function reduce() in ltlvisit/reduce.hh is the main interface.
     - Can be tested with the CGI script.
  * TGBA simplifications using direct simulation, delayed simulation,
    and SCC-based simplifications.  This is still experimental.
  * The LTL parser will now read LTL formulae written using Wring's syntax.
  * ltl2tgba_fm() now has options for on-the-fly fair-loop approximations,
    and Modella-like branching-postponement.
  * GreatSPN interface:
     - The `declarative_environment' is now part of Spot itself rather than
       part of the interface with GreatSPN.
     - the RG and SRG interface can deal with dead markings in three
       ways (omit deadlocks from the state graph, stutter on the deadlock
       and consider as a regular behavior, or stutter and distinguish the
       deadlock with a property).
     - update SSP interface to Soheib Baarir latest work.
  * Preliminary Python bindings for BuDDy's FDD and BVEC.
  * Upgrade to BuDDy 2.3.
472

473
474
475
476
477
478
479
480
481
482
483
New in spot 0.0t (2004-04-23):

  * `emptiness_check':
      - fix two bugs in the computation of the counter example,
      - revamp the interface for better customization.
  * `never_claim_reachable': new function.
  * Introduce annonymous BDD variables in `bdd_dict', and start
    to use it in `ltl_to_tgba_fm'.
  * Offer never claim in the CGI script.
  * Rename EESRG as SSP, and offer specialized variants of the
    emptiness_check.
484

485
486
487
488
489
490
491
492
493
New in spot 0.0r (2004-03-08):

  * In ltl_to_tgba_fm:
    - New option `exprop' to optimize determinism.
    - Make the `symbolic indentification' from 0.0p optional.
  * `nonacceptant_lbtt_reachable' new function to help getting
    accurate statistics from LBTT.
  * Revamp the cgi script's user interface.
  * Upgrade to lbtt 1.0.3, swig 1.3.21, automake 1.8.3
494

495
496
497
498
499
500
501
502
New in spot 0.0p (2004-02-03):

  * In ltl_to_tgba_fm:
    - identify states with identical symbolic expansions
      (i.e., identical continuations)
    - use Acc[b] as acceptance condition for Fb, not Acc[Fb].
  * Update and speed-up the cgi script.
  * Improve degeneralization.
503

504
505
506
507
508
509
510
511
512
513
514
515
New in spot 0.0n (2004-01-13):

  * 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.
516

517
New in spot 0.0l (2003-12-01):
518
519
520
521
522
523
524
525

  * Computation of prime implicants.  This simplify the output of
    ltl_to_tgba_fm, and allows conditions to be output as some of
    product in dot output.
  * Optimize translation of GFy in ltl_to_tgba_fm.
  * tgba_explicit supports arbitrary binary formulae on transitions
    (only conjunctions were allowed).

526
New in spot 0.0j (2003-11-03):
527
528
529
530
531
532
533
534

  * Use hash_map's instead of map's almost everywhere.
  * New emptiness check, based on Couvreur's algorithm.
  * LTL propositions can be put inside doublequotes to disambiguate
    some constructions.
  * Preliminary support for GreatSPN's EESRG.
  * Various bug fixes.

535
536
537
538
539
New in spot 0.0h (2003-08-18):

  * More python bindings:
    - "import buddy" works (see wrap/python/tests/bddnqueen.py for an example),
    - almost all the Spot API is now available via "import spot".
540
  * wrap/python/cgi/ltl2tgba.py is an LTL-to-Büchi translator that
541
542
543
    work as as a cgi script.
  * Couvreur's FM'99 ltl-to-tgba translation.

544
545
546
547
548
549
550
New in spot 0.0f (2003-08-01):

  * More python bindings, still only for the spot::ltl:: namespace.
  * Functional GSPN interface.  (Enable with --with-gspn=directory.)
  * The LTL scanner recognizes /\, \/, and xor.
  * Upgrade to lbtt 1.0.2.
  * tgba_tba_proxy is an on-the-fly degeneralizer.
551
  * Implements the "magic search" algorithm.
552
553
554
555
556
557
558
    (Works only on a tgba_tba_proxy.)
  * Tgba's output algorithms (save(), dotty()) now non-recursive.
  * During products, succ_iter will optimize its set of successors
    using information computed from the current product state.
  * BDD dictionnaries are now shared between automata and.  This
    gets rid of all the BDD-variable translating machinery.

559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
New in spot 0.0d (2003-07-13):

  * Optimize translation of G operators occurring at the root
    of a formula (or its immediate children when the root is a
    conjunction).  This saves two BDD variables per G operator.
  * Distribute lbtt, and run it during `make check'.
  * First sketch of GSPN interface.
  * succ_iter_concreate::next() completely rewritten.
  * Transitions are now labelled by boolean formulae (not only
    conjunctions).
  * Documentation:
    - Output collaboration diagrams.
    - Build and distribute PDF manual.
  * Many bug fixes.

New in spot 0.0b (2003-06-26):

  * Everything.