NEWS 152 KB
Newer Older
1
2
New in spot 2.3.1.dev (not yet released)

3
4
5
6
7
  Tools:

  - In tools that output automata the number of atomic propositions
    can be output using --stats=%x (output automaton) or --stats=%X
    (input automaton).
8

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
9
New in spot 2.3.1 (2017-02-20)
10

11
12
13
14
15
16
  Tools:

  - ltldo learnt to act like a portfolio: --smallest and --greatest
    will select the best output automaton for each formula translated.
    See https://spot.lrde.epita.fr/ltldo.html#portfolio for examples.

17
18
19
  - The colors used in the output of ltlcross have been adjusted to
    work better with white backgrounds and black backgrounds.

20
21
22
  - The option (y) has been added to --dot. It splits the universal
    edges with the same targets but different colors.

23
24
25
26
27
  - genltl learnt three new families for formulas: --kr-n2=RANGE,
    --kr-nlogn=RANGE, and --kr-n=RANGE.  These formulas, from
    Kupferman & Rosenberg [MoChArt'10] are recognizable by
    deterministic Büchi automata with at least 2^2^n states.

28
29
30
31
32
  - autfilt has a new transformation: --decompose-scc, which allows
    decomposition of automata through their accepting SCCs.
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html

33
34
35
36
  Library:

  - spot::twa_run::as_twa() has an option to preserve state names.

37
38
39
40
  - the method spot::twa::is_alternating(), introduced in Spot 2.3 was
    badly named and has been deprecated.  Use the negation of the new
    spot::twa::is_existential() instead.

41
42
43
44
45
46
47
  Bugs fixed:

  - spot::otf_product() was incorrectly registering atomic
    propositions.

  - spot::ltsmin_model::kripke() forgot to register the "dead"
    proposition.
48

49
50
51
52
53
54
  - The spot::acc_word type (used to construct acceptance condition)
    was using some non-standard anonymous struct.  It is unlikely that
    this type was actually used outside Spot, but if you do use it,
    spot::acc_word::op and spot::acc_word::type had to be renamed as
    spot::acc_word::sub.op and spot::acc_word::sub.type.

55
56
57
  - alternation_removal() was not always reporting the unsupported
    non-weak automata.

58
59
60
61
  - a long-standing typo in the configure code checking for Python
    caused any user-defined CPPFLAGS to be ignored while building
    Spot.

62
63
64
65
  - The display of clusters with universal edges was confused, because the
    intermediate node was not in the cluster even if one of the target was
    in the same one.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
66
New in spot 2.3 (2017-01-19)
67

68
69
70
71
72
73
74
75
76
77
78
  Build:

  * While Spot only relies on C++11 features, the configure script
    learned --enable-c++14 to compile in C++14 mode.  This allows us
    check that nothing breaks when we will switch to C++14.

  * Spot is now distributed with PicoSAT 965, and uses it for
    SAT-based minimization of automata without relying on temporary
    files.  It is still possible to use an external SAT solver by
    setting the SPOT_SATSOLVER environment variable.

79
80
81
  * The development Debian packages for Spot now install static
    libraries as well.

82
83
  * We now install configuration files for users of pkg-config.

84
85
  Tools:

86
87
88
  * ltlcross supports translators that output alternating automata in
    the HOA format.  Cross-comparison checks will only work with weak
    alternating automata (not necessarily *very* weak), but "ltlcross
89
90
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.
91

92
93
94
95
96
97
  * autfilt can read alternating automata.  This is still experimental
    (see below). Some of the algorithms proposed by autfilt will
    refuse to work because they have not yet been updated to work with
    alternating automata, but in any case they should display a
    diagnostic: if you see a crash, please report it.

98
99
100
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

101
102
  * the --check option of autfilt/ltl2tgba/ltldo/dstar2tgba can now
    take "semi-determinism" as argument.
103

104
  * autfilt --highlight-languages will color states that recognize
105
    identical languages.  (Only works for deterministic automata.)
106

107
108
109
110
111
  * 'autfilt --sat-minimize' and 'ltl2tgba -x sat-minimize' have
    undergone some backward incompatible changes.  They use binary
    search by default, and support different options than they used
    too.  See spot-x(7) for details.  The defaults are those that were
    best for the benchmark in bench/dtgbasat/.
112

113
114
115
116
  * ltlfilt learned --recurrence and --persistence to match formulas
    belonging to these two classes of the temporal hierarchy.  Unlike
    --syntactic-recurrence and --syntactic-persistence, the new checks
    are automata-based and will also match pathological formulas.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
117
    See https://spot.lrde.epita.fr/hierarchy.html
118

119
  * The --format option of ltlfilt/genltl/randltl/ltlgrind learned to
120
    print the class of a formula in the temporal hierarchy of Manna &
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
121
    Pnueli using %h.  See https://spot.lrde.epita.fr/hierarchy.html
122

123
124
125
126
127
128
  * ltldo and ltlcross learned a --relabel option to force the
    relabeling of atomic propositions to p0, p1, etc.  This is more
    useful with ltldo, as it allows calling a tool that restricts the
    atomic propositions it supports, and the output automaton will
    then be fixed to use the original atomic propositions.

129
130
131
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

132
133
134
  Library:

  * A twa is required to have at least one state, the initial state.
135
136
    An automaton can only be empty while it is being constructed,
    but should not be passed to other algorithms.
137

138
  * Couvreur's emptiness check has been rewritten to use the explicit
139
140
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
141
142
143
    automata.  Overall, this new version is roughly 4x faster on
    explicit automata than the former one.  The old version has been
    kept for backward compatibility, but will be removed eventually.
144

145
  * The new version of the Couvreur emptiness check is now the default
146
147
    one, used by twa::is_empty() and twa::accepting_run().  Always
    prefer these functions over an explicit call to Couvreur.
148

149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
  * experimental support for alternating automata:

    - twa_graph objects can now represent alternating automata.  Use
      twa_graph::new_univ_edge() and twa_graph::set_univ_init_state()
      to create universal edges an initial states; and use
      twa_graph::univ_dests() to iterate over the universal
      destinations of an edge.

    - the automaton parser will now read alternating automata in the
      HOA format.  The HOA and dot printers can output them.

    - the file twaalgos/alternation.hh contains a few algorithms
      specific to alternating automata:
      + remove_alternation() will transform *weak* alternating automata
        into TGBA.
      + the class outedge_combiner can be used to perform "and" and "or"
        on the outgoing edges of some alternating automaton.

167
    - scc_info has been adjusted to handle universal edges as if they
168
169
170
      were existential edges.  As a consequence, acceptance
      information is not accurate.

171
172
173
174
175
176
177
    - postprocessor will call remove_alternation() right away, so
      it can be used as a way to transform alternating automata
      into different sub-types of (generalized) Büchi automata.
      Note that although prostprocessor optimize the resulting
      automata, it still has no simplification algorithms that work
      at the alternating automaton level.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
178
179
180
    - See https://spot.lrde.epita.fr/tut23.html
      https://spot.lrde.epita.fr/tut24.html and
      https://spot.lrde.epita.fr/tut31.html for some code examples.
181

182
183
184
185
  * twa objects have two new properties, very-weak and
    semi-deterministic, that can be set or retrieved via
    twa::prop_very_weak()/twa::prop_semi_deterministic(), and that can
    be tested by is_very_weak_automaton()/is_semi_deterministic().
186

187
188
189
190
191
192
  * twa::prop_set has a new attribute used in twa::prop_copy() and
    twa::prop_keep() to indicate that determinism may be improved by
    an algorithm.  In other words properties like
    deterministic/semi-deterministic/unambiguous should be preserved
    only if they are positive.

193
  * language_map() and highlight_languages() are new functions that
194
    implement autfilt's --highlight-languages option mentionned above.
195

196
  * dtgba_sat_minimize_dichotomy() and dwba_sat_minimize_dichotomy()
197
    use language_map() to estimate a lower bound for binary search.
198

199
  * The encoding part of SAT-based minimization consumes less memory.
200

201
202
203
204
  * SAT-based minimization of automata can now be done using two
    incremental techniques that take a solved minimization and attempt
    to forbid the use of some states.  This is done either by adding
    clauses, or by using assumptions.
205

206
207
208
209
  * If the environment variable "SPOT_XCNF" is set during incremental
    SAT-based minimization, XCNF files suitable for the incremental SAT
    competition will be generated.  This requires the use of an exteral
    SAT solver, setup with "SPOT_SATSOLVER".  See spot-x(7).
210

211
212
213
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

214
215
216
217
218
219
220
221
222
Python:

  * spot.show_mp_hierarchy() can be used to display the membership of
    a formula to the Manna & Pnueli hierarchy, in notebooks.  An
    example is in https://spot.lrde.epita.fr/ipynb/formulas.html

  * The on-line translator will now display the temporal hierarchy
    in the "Formula > property information" output.

223
Bugs fixed:
224
225
226
227
228
229
230
231

  * The minimize_wdba() function was not correctly minimizing automata
    with useless SCCs.  This was not an issue for the LTL translation
    (where useless SCCs are always removed first), but it was an issue
    when deciding if a formula was safety or guarantee.  As a
    consequence, some tricky safety or guarantee properties were only
    recognized as obligations.

232
233
234
235
  * When ltlcross was running a translator taking the Spin syntax as
    input (%s) it would not automatically relabel any unsupported
    atomic propositions as ltldo already do.

236
237
238
239
  * When running "autfilt --sat-minimize" on a automaton representing
    an obligation property, the result would always be a complete
    automaton even without the -C option.

240
241
242
  * ltlcross --products=0 --csv should not output any product-related
    column in the CSV output since it has nothing to display there.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
243
New in spot 2.2.2 (2016-12-16)
244

245
246
247
248
249
  Build:

  * If the system has an installed libltdl library, use it instead of
    the one we distribute.

250
251
252
253
  Bug fixes:

  * scc_filter() had a left-over print statement that would print
    "names" when copying the name of the states.
254

255
256
257
258
259
  * is_terminal() should reject automata that have accepting
    transitions going into rejecting SCCs.  The whole point of
    being a terminal automaton is that reaching an accepting
    transition guarantees that any suffix will be accepted.

260
261
262
263
264
  * The HOA parser incorrectly read "Acceptance: 1 Bar(0)" as a valid
    way to specify "Acceptance: 1 Fin(0)" because it assumed that
    everything that was not Inf was Fin.  These errors are now
    diagnosed.

265
266
267
268
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

269
270
271
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

272
273
274
  * the on-line translator had a bug where a long ltl3ba process would
    continue running even after the script had timeout'ed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
275
New in spot 2.2.1 (2016-11-21)
276

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
277
  Bug fix:
278

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
279
280
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
281

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
282
New in spot 2.2 (2016-11-14)
283

284
285
286
287
288
289
  Command-line tools:

  * ltlfilt has a new option --from-ltlf to help reducing LTLf (i.e.,
    LTL over finite words) model checking to LTL model checking.  This
    is based on a transformation by De Giacomo & Vardi (IJCAI'13).

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
290
291
292
293
  * "ltldo --stats=%R", which used to display the serial number of the
    formula processed, was renamed to "ltldo --stats=%#" to free %R
    for the following feature.

294
295
296
  * autfilt, dstar2tgba, ltl2tgba, ltlcross, ltldo learned to measure
    cpu-time (as opposed to wall-time) using --stats=%R.  User or
    system time, for children or parent, can be measured separately by
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
297
298
299
300
    adding additional %[LETTER]R options.  The difference between %r
    (wall-clock time) and %R (CPU time) can also be used to detect
    unreliable measurements.  See
      https://spot.lrde.epita.fr/oaut.html#timing
301

302
303
  Library:

304
305
306
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

307
  * is_unambiguous() was rewritten in a more efficient way.
308

309
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
310
    of a single self-loop without resorting to remove_fin() for complex
311
312
313
314
315
316
    acceptance conditions.

  * remove_fin() has been improved to better deal with automata with
    "unclean" acceptance, i.e., acceptance sets that are declared but
    not used.  In particular, this helps scc_info to be more efficient
    at deciding the acceptance of SCCs in presence of Fin acceptance.
317

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
318
319
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
320
321
322
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

323
324
  * scc_filter() learned to preserve state names and highlighted states.

325
326
327
328
329
  * The BuDDy library has been slightly optimized: the initial setup
    of the unicity table can now be vectorized by GCC, and all calls
    to setjmp are now avoided when variable reordering is disabled
    (the default).

330
331
332
333
334
335
336
337
  * The twa class has three new methods:
      aut->intersects(other)
      aut->intersecting_run(other)
      aut->intersecting_word(other)
    currently these are just convenient wrappers around
      !otf_product(aut, other)->is_empty()
      otf_product(aut, other)->accepting_run()->project(aut)
      otf_product(aut, other)->accepting_word()
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
338
339
340
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
341

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
342
  Bug fixes:
343

344
  * ltl2tgba was always using the highest settings for the LTL
345
346
347
348
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

349
350
351
  * The int-vector compression code could encode 6 and 22 in the
    same way, causing inevitable issues in our LTSmin interface.
    (This affects tests/ltsmin/modelcheck with option -z, not -Z.)
352

353
354
355
  * str_sere() and str_utf8_sere() were not returning the same
    string that print_sere() and print_utf8_sere() would print.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
356
  * Running the LTL parser in debug mode would crash.
357

358
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
359
    when run with use_simulation=true (the default) on non-simplified
360
361
    automata.

362
363
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
364
365
366
367
    anymore.  Before that the spot.automata() python function used to
    close a file descriptor twice when reading from a pipe, and this
    led to crashes of the 0MQ library used by Jupyter, killing the
    Python kernel.
368

369
370
371
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
372
373
374
  * calling set_acceptance() several times on an automaton could
    result in unexpected behaviors, because set_acceptance(0,...)
    used to set the state-based acceptance flag automatically.
375

376
  * Some buffering issue caused syntax errors to be displayed out
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
377
    of place by the on-line translator.
378

379
New in spot 2.1.2 (2016-10-14)
380

381
382
383
384
385
386
  Command-line tools:

  * genltl learned 5 new families of formulas
    (--tv-f1, --tv-f2, --tv-g1, --tv-g2, --tv-uu)
    defined in Tabakov & Vardi's RV'10 paper.

387
388
389
390
391
392
  * ltlcross's --csv and --json output was changed to not include
    information about the ambiguity or strength of the automata by
    default.   Computing those can be costly and not needed by
    every user, so it should now be requested explicitely using
    options --strength and --ambiguous.

393
394
395
396
397
398
399
400
  Library:

  * New LTL simplification rule:

    - GF(f & q) = G(F(f) & q) if q is
      purely universal and a pure eventuality.  In particular
      GF(f & GF(g)) now ultimately simplifies to G(F(f) & F(g)).

401
402
  Bug fixes:

403
  * Fix spurious uninitialized read reported by valgrind when
404
    is_Kleene_star() is compiled by clang++.
405

406
  * Using "ltlfilt some-large-file --some-costly-filter" could take
407
408
409
410
411
412
413
    to a lot of time before displaying the first results, because the
    output of ltlfilt is buffered: the buffer had to fill up before
    being flushed.  The issue did not manifest when the input is
    standard input, because of the C++ feature that reading std::cin
    should flush std::cout; however it was well visible when reading
    from files.  Flushing is now done more regularly.

414
415
416
417
  * Fix compilation warnings when -Wimplicit-fallthrough it enabled.

  * Fix python errors on Darwin when using methods from the spot module
    inside of the spot.ltsmin submodule.
418

419
420
  * Fix ltlcross crash when combining --no-check with --verbose.

421
422
423
  * Adjust paths and options used in bench/dtgbasat/ to match the
    changes introduced in Spot 2.0.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
424
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
425

426
427
428
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
429
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
430
431
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
432
433
434
435
       genltl --dac --format='%s,%f' | sort -n | cut -d, -f2
    or to group formulas by number of atomic propositions:
       genltl --dac --output='ap-%a.ltl'

436
437
438
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

439
  * The --stats %c option of ltl2tgba, autfilt, ltldo, and dstar2tgba
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
440
    now accepts options to filter the SCCs to count.  For instance
441
442
443
    --stats='%[awT]c' will count the SCCs that are (a)ccepting and
    (w)eak, but (not t)erminal.  See --help for all supported filters.

444
445
446
  Bugs fixed:

  * Fix several cases where command-line tools would fail to diagnose
447
    write errors (e.g. when writing to a filesystem that is full).
448
  * Typos in genltl --help and in the man page spot-x(7).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
449

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
450
New in spot 2.1 (2016-08-08)
451

452
453
  Command-line tools:

454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
  * All tools that input formulas or automata (i.e., autfilt,
    dstar2tgba, ltl2tgba, ltl2tgta, ltlcross, ltldo, ltlfilt,
    ltlgrind) now have a more homogeneous handling of the default
    input.

    - If no formula/automaton have been specified, and the standard
    input is a not a tty, then the default is to read that. This is a
    change for ltl2tgba and ltl2tgta.  In particular, it simplifies

        genltl --dac | ltl2tgba -F- | autfilt ...

    into

        genltl --dac | ltl2tgba | autfilt ...

    - If standard input is a tty and no other input has been
    specified, then an error message is printed.  This is a change for
    autfilt, dstar2tgba, ltlcross, ltldo, ltlfilt, ltlgrind, that used
    to expect the user to type formula or automata at the terminal,
    confusing people.

    - All tools now accept - as a shorthand for -F-, to force reading
    input from the standard input (regardless of whether it is a tty
    or not).  This is a change for ltl2tgba, ltl2tgta, ltlcross, and
    ltldo.

480
481
482
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

483
484
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
    arguments, and redirection of stdin and stdout, but nothing more).

  * ltlcross and ltldo learned a new syntax to specify that an input
    formula should be written in some given syntax after rewriting
    some operators away.  For instance the defaults arguments passed
    to ltl2dstar have been changed from
         --output-format=hoa %L %O
    into
         --output-format=hoa %[WM]L %O
    where [WM] specifies that operators W and M should be rewritten
    away.  As a consequence running
         ltldo ltl2dstar -f 'a M b'
    will now work and call ltl2dstar on the equivalent formula
    'b U (a & b)' instead.  The operators that can be listed between
    brackets are the same as those of ltlfilt --unabbreviate option.

  * ltlcross learned to show some counterexamples when diagnosing
    failures of cross-comparison checks against random state spaces.
503

504
505
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
506
507
508
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

509
  * autfilt learned --remove-unused-ap to remove atomic propositions
510
511
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
512
    declare atomic propositions (HOA & DSTAR).
513

514
  * autfilt learned two options to filter automata by count of used or
515
516
517
518
    unused atomic propositions: --used-ap=RANGE --unused-ap=RANGE.
    These differ from --ap=RANGE that only consider *declared* atomic
    propositions, regardless of whether they are actually used.

519
520
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
521

522
  * autfilt learned to filter automata representing stutter-invariant
523
524
    properties with --is-stutter-invariant.

525
  * autfilt learned two new options to highlight non-determinism:
526
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
527
528
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
529

530
  * autfilt learned to highlight a run matching a given word using the
531
532
533
    --highlight-word=[NUM,]WORD option.  However currently this only
    work on automata with Fin-less acceptance.

534
535
536
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

537
  * genltl learned three new families: --dac-patterns=1..45,
538
539
540
    --eh-patterns=1..12, and --sb-patterns=1..27.  Unlike other options
    these do not output scalable patterns, but simply a list of formulas
    appearing in these three papers: Dwyer et al (FMSP'98), Etessami &
541
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
542

543
544
  * genltl learned two options, --positive and --negative, to control
    wether formulas should be output after negation or not (or both).
545

546
547
548
549
550
551
552
553
554
555
556
557
558
  * The formater used by --format (for ltlfilt, ltlgrind, genltl,
    randltl) or --stats (for autfilt, dstar2tgba, ltl2tgba, ltldo,
    randaut) learned to recognize double-quoted fields and double the
    double-quotes output inbetween as expected from RFC4180-compliant
    CSV files.  For instance
      ltl2tgba -f 'a U "b+c"' --stats='"%f",%s'
    will output
      "a U ""b+c""",2

  * The --csv-escape option of genltl, ltlfilt, ltlgrind, and randltl
    is now deprecated.  The option is still here, but hidden and
    undocumented.

559
560
  * The --stats option of autfilt, dstar2tgba, ltl2tgba, ltldo,
    randaut learned to display the output (or input if that makes
561
    sense) automaton as a HOA one-liner using %h (or %H), helping to
562
563
    create CSV files contained automata.

564
565
566
567
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

568
569
570
  * Arguments passed to -x (in ltl2tgba, ltl2tgta, autfilt, dstar2tgba)
    that are not used are now reported as they might be typos.
    This ocurred a couple of times in our test-suite.  A similar
571
    check is done for the arguments of autfilt --sat-minimize=...
572

573
574
575
576
577
578
579
580
581
  Library:

  * The print_hoa() function will now output version 1.1 of the HOA
    format when passed the "1.1" option (i.e., use -H1.1 from any
    command-line tool).  As far as Spot is concerned, this allows
    negated properties to be expressed.  Version 1 of the HOA format
    is still the default, but we plan to default to version 1.1 in the
    future.

582
583
584
585
586
587
588
  * The "highlight-states" and "highlight-edges" named properties,
    which were introduced in 1.99.8, will now be output using
    "spot.highlight.edges:" and "spot.highlight.states:" headers if
    version 1.1 of the HOA format is selected.  The automaton parser
    was secretly able of reading that since 1.99.8, but that is now
    documented at https://spot.lrde.epita.fr/hoa.html#extensions

589
590
591
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

592
  * is_deterministic(), is_terminal(), is_weak(), and
593
594
595
    is_inherently_weak(), count_nondet_states(),
    highlight_nondet_edges(), highlight_nondet_states() will update
    the corresponding properties of the automaton as a side-effect of
596
    their check.
597

598
599
600
601
602
603
  * the sbacc() function, used by "ltl2tgba -S" and "autfilt -S" to
    convert automata to state-based acceptance, learned some tricks
    (using SCCs, pulling accepting marks common to all outgoing edges,
    and pushing acceptance marks common to all incoming edges) to
    reduce the number of additional states needed.

604
605
606
607
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

608
609
610
  * language_containment_checker now has default values for all
    parameters of its constructor.

611
612
613
614
  * spot::twa_run has a new method, project(), that can be used to
    project a run found in a product onto one of the original operand.
    This is for instance used by autfilt --highlight-word.

615
616
617
618
    The old spot::project_twa_run() function has been removed: it was
    not used anywhere in Spot, and had an obvious bug in its
    implementation, so it cannot be missed by anyone.

619
620
  * spot::twa has two new methods that supplement is_empty():
    twa::accepting_run() and twa::accepting_word().  They compute
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
621
    what their names suggest.  Note that twa::accepting_run(), unlike
622
623
624
    the two others, is currently restricted to automata with Fin-less
    acceptance.

625
626
627
628
629
  * spot::check_stutter_invariance() can now work on non-deterministic
    automata for which no corresponding formula is known.  This
    implies that "autfilt --check=stutter" will now label all
    automata, not just deterministic automata.

630
  * New LTL and PSL simplification rules:
631
632
    - if e is pure eventuality and g => e, then e U g = Fg
    - if u is purely universal and u => g, then u R g = Gg
633
634
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
635

636
637
638
639
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

640
641
642
643
644
  * spot::fair_kripke::state_acceptance_conditions() renamed to
    spot::fair_kripke::state_acceptance_mark() for consistency.  This
    is backward incompatible, but we are not aware of any actual use
    of this method.

645
646
  Python:

647
  * The __format__() method for formula supports the same
648
649
650
651
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

652
653
  * Bindings for language_containment_checker were added.

654
655
  * Bindings for randomize() were added.

656
657
658
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

659
  * Under IPython the spot.ltsmin module now offers a
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
660
    %%pml magic to define promela models, compile them
661
662
663
    with spins, and dynamically load them.   This is
    akin to the %%dve magic that was already supported.

664
665
666
667
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

668
669
670
671
  Documentation:

  * A new example page shows how to test the equivalence of
    two LTL/PSL formulas.  https://spot.lrde.epita.fr/tut04.html
672

673
674
  * A new page discusses explicit vs. on-the-fly interfaces for
    exploring automata in C++.  https://spot.lrde.epita.fr/tut50.html
675

676
  * Another new page shows how to implement an on-the-fly Kripke
677
    structure for a custom state space.
678
679
    https://spot.lrde.epita.fr/tut51.html

680
681
  * The concepts.html page now lists all named properties
    used by automata.
682

683
684
685
686
687
688
  Bug fixes:

  * When ltlcross found a bug using a product of complemented
    automata, the error message would report "Comp(Ni)*Comp(Pj)" as
    non-empty while the actual culprit was "Comp(Nj)*Comp(Pi)".

689
690
691
  * Fix some non-deterministic execution of minimize_wdba(), causing
    test-suite failures with the future G++ 7, and clang 3.9.

692
693
694
  * print_lbtt() had a memory leak when printing states without
    successors.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
695
New in spot 2.0.3 (2016-07-11)
696

697
698
699
700
701
  Bug fixes:

  * The degen-lcache=1 option of the degeneralization algorithm (which
    is a default option) did not behave exactly as documented: instead
    of reusing the first level ever created for a state where the
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
702
703
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
704
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
705
  * The generalized testing automata displayed by the online
706
    translator were incorrect (those output by ltl2tgta were OK).
707
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
708
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
709
710
711
    propositions even when they were still used in the output (e.g.,
    if a&p0 is relabeled to p0&p1).  This could cause ltldo and the
    online translator to report errors.
712

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
713
714
715
716
717
718
719
720
New in spot 2.0.2 (2016-06-17)

  Documentation:

  * We now have a citing page at https://spot.lrde.epita.fr/citing.html
    providing a list of references about Spot.
  * The Python examples have been augmented with the two examples
    from our ATVA'16 tool paper.
721

722
723
724
725
  Bug fixes:

  * Fix compilation error observed with Clang++ 3.7.1 and GCC 6.1.1
    headers.
726
  * Fix an infinite recursion in relabel_bse().
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
727
  * Various small typos and cosmetic cleanups.
728

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
729
New in spot 2.0.1 (2016-05-09)
730

731
732
  Library:

733
  * twa::unregister_ap() and twa_graph::remove_unused_ap() are new
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
734
    methods introduced to fix some of the bugs listed below.
735

736
737
738
739
740
  Documentation:

  * Add missing documentation for the option string passed to
    spot::make_emptiness_check_instantiator().

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
741
  * There is now a spot(7) man page listing all installed
742
743
    command-line tools.

744
745
746
747
  Python:

  * The tgba_determinize() function is now accessible in Python.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
748
749
  Bug fixes:

750
  * The automaton parser would choke on comments like /******/.
751
  * check_strength() should also set negated properties.
752
753
754
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
755
756
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
757
  * spot::ltsmin::kripke() had the same issue.
758
759
760
761
  * The sub_stats_reachable() function used to count the number
    of transitions based on the number of atomic propositions
    actually *used* by the automaton instead of using the number
    of AP declared.
762
763
764
765
766
  * print_hoa() will now output all the atomic propositions that have
    been registered, not only those that are used in the automaton.
    (Note that it will also throw an exception if the automaton uses
    an unregistered AP; this is how some of the above bugs were
    found.)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
767
  * For Small or Deterministic preference, the postprocessor
768
769
770
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
771
772
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
773
  * Various typos and minor documentation fixes.
774

775

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
776
New in spot 2.0 (2016-04-11)
777

778
779
780
  Command-line tools:

  * ltlfilt now also support the --accept-word=WORD and
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
781
782
    --reject-word=WORD options that were introduced in autfilt in the
    previous version.
783

784
785
786
  Python:

  * The output of spot.atomic_prop_collect() is printable and
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
787
    can now be passed directly to spot.ltsmin.model.kripke().
788

789
790
791
792
  Library:

  * digraph::valid_trans() renamed to digraph::is_valid_edge().

793
794
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
795
796
797
798
799
  * The concepts page (https://spot.lrde.epita.fr/concepts.html) now
    includes a highlevel description of the architecture, and some
    notes aboute automata properties.

  * More Doxygen documentation for spot::formula and spot::digraph.
800

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
801
New in spot 1.99.9 (2016-03-14)
802

803
804
  Command-line tools:

805
806
807
  * autfilt has two new options: --accept-word=WORD and
    --reject-word=WORD for filtering automata that accept or reject
    some word.  The option may be used multiple times.
808

809
810
  Library:

811
812
813
  * The parse_word() function can be used to parse a lasso-shaped
    word and build a twa_word.  The twa_word::as_automaton()
    method can be used to create an automaton out of that.
814
  * twa::ap_var() renamed to twa::ap_vars().
815
816
817
818
  * emptiness_check_instantiator::min_acceptance_conditions() and
    emptiness_check_instantiator::max_acceptance_conditions() renamed
    to emptiness_check_instantiator::min_sets() and
    emptiness_check_instantiator::max_sets().
819
820
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
821

822
823
824
825
  Documentation:

  * The page https://spot.lrde.epita.fr/upgrade2.html should help
    people migrating old C++ code written for Spot 1.2.x, and update
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
826
    it for (the upcoming) Spot 2.0.
827

828
829
830
831
  Bug fixes:

  * spot/twaalgos/gtec/gtec.hh was incorrectly installed as
  spot/tgbaalgos/gtec/gtec.hh.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
832
  * The shared libraries should now compile again on Darwin.
833

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
834
New in spot 1.99.8 (2016-02-18)
835

836
837
  Command-line tools:

838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
  * ltl2tgba now also support the --generic option (already supported
    by ltldo and autfilt) to lift any restriction on the acceptance
    condition produced.  This option now has a short version: -G.

  * ltl2tgba and autfilt have learnt how to determinize automata.
    For this to work, --generic acceptance should be enabled (this
    is the default for autfilt, but not for ltl2tgba).

    "ltl2tgba -G -D" will now always outpout a deterministic automaton.
    It can be an automaton with transition-based parity acceptance in
    case Spot could not find a deterministic automaton with (maybe
    generalized) Büchi acceptance.

    "ltl2tgba -D" is unchanged (the --tgba acceptance is the default),
    and will output a deterministic automaton with (generalized) Büchi
    acceptance only if one could be found.  Otherwise a
    non-deterministic automaton is output, but this does NOT mean that
    no deterministic Büchi automaton exist for this formula.  It only
    means Spot could not find it.

    "autfilt -D" will determinize any automaton, because --generic
    acceptance is the default for autfilt.

    "autfilt -D --tgba" will behave like "ltl2tgba -D", i.e., it may
    fail to find a deterministic automaton (even if one exists) and
    return a nondeterministic automaton.

865
866
867
868
869
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

870
871
872
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

873
874
875
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

876
877
878
879
880
881
882
  * ltlcross has a new option --determinize to instruct it to
    complement non-deterministic automata via determinization.  This
    option is not enabled by default as it can potentially be slow and
    generate large automata.  When --determinize is given, option
    --product=0 is implied, since the tests based on products with
    random state-space are pointless for deterministic automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
883
884
885
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

886
887
888
889
890
  * ltlfilt's option --size-min=N, --size-max=N, --bsize-min=N, and
    --bsize-max=N have been reimplemented as --size=RANGE and
    --bsize=RANGE.  The old names are still supported for backward
    compatibility, but they are not documented anymore.

891
892
  * ltlfilt's option --ap=N can now take a RANGE as parameter.

893
894
895
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

896
897
898
899
900
  Library:

  * Building products with different dictionaries now raise an
    exception instead of using an assertion that could be disabled.

901
  * The load_ltsmin() function has been split in two.  Now you should
902
    first call ltsmin_model::load(filename) to create an ltsmin_model,
903
    and then call the ltsmin_model::kripke(...) method to create an
904
905
906
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
907

908
909
910
911
912
913
914
915
916
917
918
919
  * print_dot() now accepts several new options:
    - use "<N" to specify a maximum number of states to output.
      Incomplete states are then marked appropriately.  For a quick
      example, compare
	ltl2tgba -D 'Ga | Gb | Gc' -d'<3'
      with
        ltl2tgba -D 'Ga | Gb | Gc' -d
    - use "C(color)" to specify the color to use for filling states.
    - use "#" to display the internal number of each transition
    - use "k" to use state-based labels when possible.  This is
      similar to the "k" option already supported by print_hoa(), and
      is useful when printing Kripke structures.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
920

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
921
922
  * Option "k" is automatically used by print_dot() and print_hoa()
    when printing Kripke structures.
923

924
925
926
927
  * print_dot() also honnor two new automaton properties called
    "highlight-edges" and "highlight-states".  These are used to color
    a subset of edges or transitions.

928
929
930
931
  * There is a new tgba_determinize() function.  Despite its name, it
    in facts works on transition-based Büchi automaton, and will first
    degeneralize any automaton with generalized Büchi acceptance.

932
933
934
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

935
936
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
937

938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
  * The interface for all functions parsing formulas (LTL, PSL, SERE,
    etc.) has been changed to use an interface similar to the one used
    for parsing automata.  These function now return a parsed_formula
    object that includes both a formula and a list of syntax errors.

    Typically a function written as

       spot::formula read(std::string input)
       {
	  spot::parse_error_list pel;
	  spot::formula f = spot::parse_infix_psl(input, pel);
	  if (spot::format_parse_errors(std::cerr, input, pel))
	    exit(2);
	  return f;
       }

    should be updated to

       spot::formula read(std::string input)
       {
	  spot::parsed_formula pf = spot::parse_infix_psl(input);
	  if (pf.format_errors(std::cerr))
	    exit(2);
	  return pf.f;
       }

964
965
  Python:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
966
967
968
  * The ltsmin interface has been binded in Python.  It also
    comes with a %%dve cell magic to edit DiVinE models in the notebook.
    See https://spot.lrde.epita.fr/ipynb/ltsmin.html for a short example.
969

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
970
971
972
973
974
  * spot.setup() sets de maximum number of states to display in
    automata to 50 by default, as more states is likely to be
    unreadable (and slow to process by GraphViz).  This can be
    overridden by calling spot.setup(max_states=N).

975
976
977
978
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

979
980
981
982
983
  Documentation:

  * There is a new page giving informal illustrations (and extra
    pointers) for some concepts used in Spot.
    See https://spot.lrde.epita.fr/concepts.html
984

985
  Bug fixes:
986
987
988

  * Using ltl2tgba -U would fail to output the unambiguous property
    (regression introduced in 1.99.7)
989
990
  * ltlfilt, autfilt, randltl, and randaut could easily crash when
    compiled statically (i.e., with configure --disable-shared).
991
  * "1 U (a | Fb)" was not always simplified to "F(a | b)".
992
993
  * destroying the operands of an otf_product() before the product
    itself could crash.
994

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
995
New in spot 1.99.7 (2016-01-15)
996
997
998

  Command-line tools:

999
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
1000
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1001
    This makes it easier to pipe several commands together.
1002
1003
1004
1005
1006
1007

    If you have an old script that relies on GraphViz being the default
    output and that you do not want to update it, use
       export SPOT_DEFAULT_FORMAT=dot
    to get the old behavior back.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1008
1009
1010
  * Tools that output automata now accept -d as a shorthand for --dot
    since requesting the GraphViz (a.k.a. dot) output by hand is now
    more frequent.
1011
1012
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
1013

1014
  * The SPOT_DEFAULT_FORMAT environment variable can be set to 'dot'
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1015
1016
    or 'hoa' to force a default output format for automata.  Additional
    options may also be added, as in SPOT_DEFAULT_FORMAT='hoa=iv'.
1017

1018
1019
  * autfilt has a new option: --is-inherently-weak.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1020
1021
1022
  * The --check=strength option of all tools that produce automata
    will also test if an automaton is inherently weak.

1023
1024
  Library:

1025
1026
1027
1028
1029
1030
1031
1032
1033
  * Installed headers now assume that they will be included as
    #include <spot/subdir/header.hh>
    instead of
    #include <subdir/header.hh>

    This implies that when Spot headers are installed in
    /usr/include/spot/... (the default when using the Debian packages)
    or /usr/local/include/spot/... (the default when compiling from
    source), then it is no longuer necessary to add
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1034
1035
1036
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
1037
1038
1039
1040

    Inside the source distribution, the subdirectory src/ has been
    renamed to spot/, so that the root of the source tree can also be
    put on the preprocessor's search path to compile against a
1041
1042
    non-installed version of Spot.  Similarly, iface/ltsmin/ has been
    renamed to spot/ltsmin/, so that installed and non-installed
1043
    directories can be used similarly.
1044

1045
1046
1047
1048
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

1049
1050
1051
1052
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

1053
1054
1055
1056
  * decompose_strength() is now extracting inherently weak SCCs
    instead of just weak SCCs.  This gets rid of some corner cases
    that used to require ad hoc handling.

1057
1058
1059
1060
  * acc_cond::acc_code's methods append_or(), append_and(), and
    shift_left() have been replaced by operators |=, &=, <<=, and for
    completeness the operators |, &, and << have been added.

1061
1062
1063
  * Several methods have been removed from the acc_cond
    class because they were simply redundant with the methods of
    acc_cond::mark_t, and more complex to use.
1064

1065
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
1066
       acc_cond::sets(m)         -> use m.sets()
1067
       acc_cond::has(m, u)       -> use m.has(u)
1068
1069
1070
1071
       acc_cond::cup(l, r)       -> use l | r
       acc_cond::cap(l, r)       -> use l & r
       acc_cond::set_minus(l, r) -> use l - r

1072
    Additionally, the following methods/functions have been renamed:
1073
1074
1075

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
1076
       parse_acc_code()  -> acc_cond::acc_code(...)
1077

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1078
  * Automata property flags (those that tell whether the automaton is
1079
1080
1081
    deterministic, weak, stutter-invariant, etc.) are now stored using
    three-valued logic: in addition to "maybe"/"yes" they can now also
    represent "no".  This is some preparation for the upcomming
1082
1083
1084
1085
1086
1087
1088
1089
    support of the HOA v1.1 format, but it also saves time in some
    algorithms (e.g, is_deterministic() can now return immediately on
    automata marked as not deterministic).

  * The automaton parser now accept negated properties as they will be
    introduced in HOA v1.1, and will check for some inconsistencies.
    These properties are stored and used when appropriate, but they
    are not yet output by the HOA printer.
1090

1091
1092
  Python:

1093
1094
1095
1096
  * Iterating over the transitions leaving a state (the
    twa_graph::out() C++ function) is now possible in Python.  See
    https://spot.lrde.epita.fr/tut21.html for a demonstration.

1097
1098
1099
1100
  * Membership to acceptance sets can be specified using Python list
    when calling for instance the Python version of twa_graph::new_edge().
    See https://spot.lrde.epita.fr/tut22.html for a demonstration.

1101
1102
1103
  * Automaton states can be named via the set_state_names() method.
    See https://spot.lrde.epita.fr/ipynb/product.html for an example.

1104
1105
1106
1107
1108
  Documentation:

  * There is a new page explaining how to compile example programs and
    and link them with Spot.  https://spot.lrde.epita.fr/compile.html

1109
1110
1111
1112
1113
  * Python bindings for manipulating acceptance conditions are
    demonstrated by https://spot.lrde.epita.fr/ipynb/acc_cond.html,
    and a Python implementation of the product of two automata is
    illustrated by https://spot.lrde.epita.fr/ipynb/product.html

1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
  Source code reorganisation:

  * A lot of directories have been shuffled around in the
    distribution:
      src/                   ->  spot/    (see rational above)
      iface/ltsmin/  (code)  ->  spot/ltsmin/
      wrap/python/           ->  python/
      src/tests/             ->  tests/core/
      src/sanity/            ->  tests/sanity/
      iface/ltsmin/  (tests) ->  tests/ltsmin/
      wrap/python/tests      ->  tests/python/

1126
1127
  Bug fixes:

1128
1129
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
1130
1131
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
1132
1133
  * product() would incorrectly mark the product of two
    sttuter-sensitive automata as stutter-sensitive as well.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1134
1135
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
1136

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1137
New in spot 1.99.6 (2015-12-04)
1138

1139
1140
  Command-line tools:

1141
1142
1143
1144
  * autfilt has two new filters: --is-weak and --is-terminal.

  * autfilt has a new transformation: --decompose-strength,
    implementing the decomposition of our TACAS'13 paper.
1145
1146
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
1147

1148
1149
1150
1151
1152
1153
  * All tools that output HOA files accept a --check=strength option
    to request automata to be marked as "weak" or "terminal" as
    appropriate.  Without this option, these properties may only be
    set as a side-effect of running transformations that use this
    information.

1154
1155
1156
1157
1158
1159
1160
  Library:

  * Properties of automata (like the "properties:" line of the HOA
    format) are stored as bits whose interpretation is True=yes,
    False=maybe.  Having getters like "aut->is_deterministic()" or
    "aut->is_unambiguous()" was confusing, because there are separate
    functions "is_deterministic(aut)" and "is_unambiguous(aut)" that
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1161
1162
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
1163
1164
1165
1166
1167
1168
1169
1170
1171

    - twa::has_state_based_acc() -> twa::prop_state_acc()
    - twa::prop_state_based_acc(bool) -> twa::prop_state_acc(bool)
    - twa::is_inherently_weak() -> twa::prop_inherently_weak()
    - twa::is_deterministic() -> twa::prop_deterministic()
    - twa::is_unambiguous() -> twa::prop_unambiguous()
    - twa::is_stutter_invariant() -> twa::prop_stutter_invariant()
    - twa::is_stutter_sensitive() -> twa::prop_stutter_sensitive()

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1172
    The setters have the same names as the getters, except they take a
1173
1174
1175
    Boolean argument.  This argument used to be optionnal (defaulting
    to True), but it no longer is.

1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
  * Automata now support the "weak" and "terminal" properties in
    addition to the previously supported "inherently-weak".

  * By default the HOA printer tries not to bloat the output with
    properties that are redundant and probably useless.  The HOA
    printer now has a new option "v" (use "-Hv" from the command line)
    to output more verbose "properties:".  This currently includes
    outputing "no-univ-branch", outputting "unambiguous" even for
    automata already tagged as "deterministic", and "inherently-weak"
    or "weak" even for automata tagged "weak" or "terminal".
1186

1187
1188
1189
1190
  * The HOA printer has a new option "k" (use "-Hk" from the command
    line) to output automata using state labels whenever possible.
    This is useful to print Kripke structures.

1191
1192
1193
1194
1195
  * The dot output will display pair of states when displaying an
    automaton built as an explicit product.  This works in IPython
    with spot.product() or spot.product_or() and in the shell with
    autfilt's --product or --product-or options.

1196
1197
1198
1199
1200
1201
1202
  * The print_dot() function supports a new option, +N, where N is a
    positive integer that will be added to all set numbers in the
    output.  This is convenient when displaying two automata before
    building their product: use +N to shift the displayed sets of the
    second automaton by the number of acceptance sets N of the first
    one.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1203
  * The sat minimization for DTωA now does a better job at selecting
1204
1205
1206
1207
1208
    reference automata when the output acceptance is the the same as
    the input acceptance.  This can provide nice speedups when tring
    to syntethise larged automata with different acceptance
    conditions.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1209
  * Explicit Kripke structures (i.e., stored as explicit graphs) have
1210
    been rewritten above the graph class, using an interface similar
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1211
1212
    to the twa class.  The new class is called kripke_graph.  The ad
    hoc Kripke parser and printer have been removed, because we can
1213
1214
    now use print_hoa() with the "k" option to print Kripke structure
    in the HOA format, and furthermore the parse_aut() function now
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1215
    has an option to load such an HOA file as a kripke_graph.
1216

1217
1218
1219
1220
  * The HOA parser now accepts identifier, aliases, and headernames
    containing dots, as this will be allowed in the next version of
    the HOA format.

1221
1222
  * Renamings:
    is_guarantee_automaton() -> is_terminal_automaton()
1223
    tgba_run -> twa_run
1224
    twa_word::print -> operator<<
1225
1226
    dtgba_sat_synthetize() -> dtwa_sat_synthetize()
    dtgba_sat_synthetize_dichotomy() -> dtwa_sat_synthetize_dichotomy()
1227

1228
  Python:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1229

1230
  * Add bindings for is_unambiguous().
1231
  * Better interface for sat_minimize().
1232

1233
  Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1234

1235
  * the HOA parser was ignoring the "unambiguous" property.
1236
1237
  * --dot=Bb should work like --dot=b, allowing us to disable
    a B option set via an environment variable.
1238

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1239
New in spot 1.99.5 (2015-11-03)
1240

1241
1242
1243
  Command-line tools:

  * autfilt has gained a --complement option.
1244
    It currently works only for deterministic automata.