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

3
4
5
6
7
8
  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.

9
10
11
12
13
14
15
  Bugs fixed:

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

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

17
18
19
20
21
22
  - 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.

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

25
26
27
28
29
30
31
32
33
34
35
  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.

36
37
38
  * The development Debian packages for Spot now install static
    libraries as well.

39
40
  * We now install configuration files for users of pkg-config.

41
42
  Tools:

43
44
45
  * 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
46
47
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.
48

49
50
51
52
53
54
  * 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.

55
56
57
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

58
59
  * the --check option of autfilt/ltl2tgba/ltldo/dstar2tgba can now
    take "semi-determinism" as argument.
60

61
  * autfilt --highlight-languages will color states that recognize
62
    identical languages.  (Only works for deterministic automata.)
63

64
65
66
67
68
  * '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/.
69

70
71
72
73
  * 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
74
    See https://spot.lrde.epita.fr/hierarchy.html
75

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

80
81
82
83
84
85
  * 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.

86
87
88
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

89
90
91
  Library:

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

95
  * Couvreur's emptiness check has been rewritten to use the explicit
96
97
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
98
99
100
    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.
101

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

106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
  * 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.

124
    - scc_info has been adjusted to handle universal edges as if they
125
126
127
      were existential edges.  As a consequence, acceptance
      information is not accurate.

128
129
130
131
132
133
134
    - 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
135
136
137
    - 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.
138

139
140
141
142
  * 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().
143

144
145
146
147
148
149
  * 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.

150
  * language_map() and highlight_languages() are new functions that
151
    implement autfilt's --highlight-languages option mentionned above.
152

153
  * dtgba_sat_minimize_dichotomy() and dwba_sat_minimize_dichotomy()
154
    use language_map() to estimate a lower bound for binary search.
155

156
  * The encoding part of SAT-based minimization consumes less memory.
157

158
159
160
161
  * 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.
162

163
164
165
166
  * 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).
167

168
169
170
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

171
172
173
174
175
176
177
178
179
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.

180
Bugs fixed:
181
182
183
184
185
186
187
188

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

189
190
191
192
  * 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.

193
194
195
196
  * 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.

197
198
199
  * 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
200
New in spot 2.2.2 (2016-12-16)
201

202
203
204
205
206
  Build:

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

207
208
209
210
  Bug fixes:

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

212
213
214
215
216
  * 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.

217
218
219
220
221
  * 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.

222
223
224
225
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

226
227
228
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

229
230
231
  * 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
232
New in spot 2.2.1 (2016-11-21)
233

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
234
  Bug fix:
235

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
236
237
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
238

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

241
242
243
244
245
246
  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
247
248
249
250
  * "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.

251
252
253
  * 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
254
255
256
257
    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
258

259
260
  Library:

261
262
263
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

264
  * is_unambiguous() was rewritten in a more efficient way.
265

266
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
267
    of a single self-loop without resorting to remove_fin() for complex
268
269
270
271
272
273
    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.
274

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
275
276
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
277
278
279
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

280
281
  * scc_filter() learned to preserve state names and highlighted states.

282
283
284
285
286
  * 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).

287
288
289
290
291
292
293
294
  * 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
295
296
297
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
298

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
299
  Bug fixes:
300

301
  * ltl2tgba was always using the highest settings for the LTL
302
303
304
305
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

306
307
308
  * 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.)
309

310
311
312
  * 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
313
  * Running the LTL parser in debug mode would crash.
314

315
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
316
    when run with use_simulation=true (the default) on non-simplified
317
318
    automata.

319
320
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
321
322
323
324
    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.
325

326
327
328
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
329
330
331
  * 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.
332

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

336
New in spot 2.1.2 (2016-10-14)
337

338
339
340
341
342
343
  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.

344
345
346
347
348
349
  * 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.

350
351
352
353
354
355
356
357
  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)).

358
359
  Bug fixes:

360
  * Fix spurious uninitialized read reported by valgrind when
361
    is_Kleene_star() is compiled by clang++.
362

363
  * Using "ltlfilt some-large-file --some-costly-filter" could take
364
365
366
367
368
369
370
    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.

371
372
373
374
  * 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.
375

376
377
  * Fix ltlcross crash when combining --no-check with --verbose.

378
379
380
  * 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
381
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
382

383
384
385
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
386
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
387
388
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
389
390
391
392
       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'

393
394
395
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

401
402
403
  Bugs fixed:

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

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

409
410
  Command-line tools:

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

437
438
439
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

440
441
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
    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.
460

461
462
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
463
464
465
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

466
  * autfilt learned --remove-unused-ap to remove atomic propositions
467
468
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
469
    declare atomic propositions (HOA & DSTAR).
470

471
  * autfilt learned two options to filter automata by count of used or
472
473
474
475
    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.

476
477
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
478

479
  * autfilt learned to filter automata representing stutter-invariant
480
481
    properties with --is-stutter-invariant.

482
  * autfilt learned two new options to highlight non-determinism:
483
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
484
485
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
486

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

491
492
493
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

494
  * genltl learned three new families: --dac-patterns=1..45,
495
496
497
    --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 &
498
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
499

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

503
504
505
506
507
508
509
510
511
512
513
514
515
  * 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.

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

521
522
523
524
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

525
526
527
  * 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
528
    check is done for the arguments of autfilt --sat-minimize=...
529

530
531
532
533
534
535
536
537
538
  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.

539
540
541
542
543
544
545
  * 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

546
547
548
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

549
  * is_deterministic(), is_terminal(), is_weak(), and
550
551
552
    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
553
    their check.
554

555
556
557
558
559
560
  * 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.

561
562
563
564
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

565
566
567
  * language_containment_checker now has default values for all
    parameters of its constructor.

568
569
570
571
  * 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.

572
573
574
575
    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.

576
577
  * 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
578
    what their names suggest.  Note that twa::accepting_run(), unlike
579
580
581
    the two others, is currently restricted to automata with Fin-less
    acceptance.

582
583
584
585
586
  * 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.

587
  * New LTL and PSL simplification rules:
588
589
    - 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
590
591
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
592

593
594
595
596
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

597
598
599
600
601
  * 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.

602
603
  Python:

604
  * The __format__() method for formula supports the same
605
606
607
608
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

609
610
  * Bindings for language_containment_checker were added.

611
612
  * Bindings for randomize() were added.

613
614
615
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

621
622
623
624
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

625
626
627
628
  Documentation:

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

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

633
  * Another new page shows how to implement an on-the-fly Kripke
634
    structure for a custom state space.
635
636
    https://spot.lrde.epita.fr/tut51.html

637
638
  * The concepts.html page now lists all named properties
    used by automata.
639

640
641
642
643
644
645
  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)".

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

649
650
651
  * print_lbtt() had a memory leak when printing states without
    successors.

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

654
655
656
657
658
  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
659
660
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
661
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
662
  * The generalized testing automata displayed by the online
663
    translator were incorrect (those output by ltl2tgta were OK).
664
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
665
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
666
667
668
    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.
669

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
670
671
672
673
674
675
676
677
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.
678

679
680
681
682
  Bug fixes:

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

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

688
689
  Library:

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

693
694
695
696
697
  Documentation:

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

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

701
702
703
704
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
705
706
  Bug fixes:

707
  * The automaton parser would choke on comments like /******/.
708
  * check_strength() should also set negated properties.
709
710
711
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
712
713
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
714
  * spot::ltsmin::kripke() had the same issue.
715
716
717
718
  * 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.
719
720
721
722
723
  * 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
724
  * For Small or Deterministic preference, the postprocessor
725
726
727
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
728
729
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
730
  * Various typos and minor documentation fixes.
731

732

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

735
736
737
  Command-line tools:

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

741
742
743
  Python:

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

746
747
748
749
  Library:

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

750
751
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
752
753
754
755
756
  * 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.
757

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

760
761
  Command-line tools:

762
763
764
  * 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.
765

766
767
  Library:

768
769
770
  * 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.
771
  * twa::ap_var() renamed to twa::ap_vars().
772
773
774
775
  * 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().
776
777
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
778

779
780
781
782
  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
783
    it for (the upcoming) Spot 2.0.
784

785
786
787
788
  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
789
  * The shared libraries should now compile again on Darwin.
790

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

793
794
  Command-line tools:

795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
  * 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.

822
823
824
825
826
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

827
828
829
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

830
831
832
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

833
834
835
836
837
838
839
  * 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
840
841
842
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

843
844
845
846
847
  * 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.

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

850
851
852
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

853
854
855
856
857
  Library:

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

858
  * The load_ltsmin() function has been split in two.  Now you should
859
    first call ltsmin_model::load(filename) to create an ltsmin_model,
860
    and then call the ltsmin_model::kripke(...) method to create an
861
862
863
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
864

865
866
867
868
869
870
871
872
873
874
875
876
  * 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
877

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

881
882
883
884
  * 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.

885
886
887
888
  * 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.

889
890
891
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

892
893
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
894

895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
  * 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;
       }

921
922
  Python:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
923
924
925
  * 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.
926

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
927
928
929
930
931
  * 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).

932
933
934
935
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

936
937
938
939
940
  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
941

942
  Bug fixes:
943
944
945

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
952
New in spot 1.99.7 (2016-01-15)
953
954
955

  Command-line tools:

956
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
957
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
958
    This makes it easier to pipe several commands together.
959
960
961
962
963
964

    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
965
966
967
  * 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.
968
969
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
970

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

975
976
  * autfilt has a new option: --is-inherently-weak.

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

980
981
  Library:

982
983
984
985
986
987
988
989
990
  * 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
991
992
993
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
994
995
996
997

    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
998
999
    non-installed version of Spot.  Similarly, iface/ltsmin/ has been
    renamed to spot/ltsmin/, so that installed and non-installed
1000
    directories can be used similarly.
1001

1002
1003
1004
1005
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

1006
1007
1008
1009
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

1010
1011
1012
1013
  * 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.

1014
1015
1016
1017
  * 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.

1018
1019
1020
  * 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.
1021

1022
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
1023
       acc_cond::sets(m)         -> use m.sets()
1024
       acc_cond::has(m, u)       -> use m.has(u)
1025
1026
1027
1028
       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

1029
    Additionally, the following methods/functions have been renamed:
1030
1031
1032

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
1033
       parse_acc_code()  -> acc_cond::acc_code(...)
1034

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1035
  * Automata property flags (those that tell whether the automaton is
1036
1037
1038
    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
1039
1040
1041
1042
1043
1044
1045
1046
    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.
1047

1048
1049
  Python:

1050
1051
1052
1053
  * 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.

1054
1055
1056
1057
  * 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.

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

1061
1062
1063
1064
1065
  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

1066
1067
1068
1069
1070
  * 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

1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
  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/

1083
1084
  Bug fixes:

1085
1086
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
1087
1088
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
1089
1090
  * 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
1091
1092
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
1093

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

1096
1097
  Command-line tools:

1098
1099
1100
1101
  * 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.
1102
1103
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
1104

1105
1106
1107
1108
1109
1110
  * 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.

1111
1112
1113
1114
1115
1116
1117
  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
1118
1119
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
1120
1121
1122
1123
1124
1125
1126
1127
1128

    - 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
1129
    The setters have the same names as the getters, except they take a
1130
1131
1132
    Boolean argument.  This argument used to be optionnal (defaulting
    to True), but it no longer is.

1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
  * 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".
1143

1144
1145
1146
1147
  * 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.

1148
1149
1150
1151
1152
  * 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.

1153
1154
1155
1156
1157
1158
1159
  * 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
1160
  * The sat minimization for DTωA now does a better job at selecting
1161
1162
1163
1164
1165
    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
1166
  * Explicit Kripke structures (i.e., stored as explicit graphs) have
1167
    been rewritten above the graph class, using an interface similar
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1168
1169
    to the twa class.  The new class is called kripke_graph.  The ad
    hoc Kripke parser and printer have been removed, because we can
1170
1171
    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
1172
    has an option to load such an HOA file as a kripke_graph.
1173

1174
1175
1176
1177
  * The HOA parser now accepts identifier, aliases, and headernames
    containing dots, as this will be allowed in the next version of
    the HOA format.

1178
1179
  * Renamings:
    is_guarantee_automaton() -> is_terminal_automaton()
1180
    tgba_run -> twa_run
1181
    twa_word::print -> operator<<
1182
1183
    dtgba_sat_synthetize() -> dtwa_sat_synthetize()
    dtgba_sat_synthetize_dichotomy() -> dtwa_sat_synthetize_dichotomy()
1184

1185
  Python:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1186

1187
  * Add bindings for is_unambiguous().
1188
  * Better interface for sat_minimize().
1189

1190
  Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1191

1192
  * the HOA parser was ignoring the "unambiguous" property.
1193
1194
  * --dot=Bb should work like --dot=b, allowing us to disable
    a B option set via an environment variable.
1195

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

1198
1199
1200
  Command-line tools:

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

1203
  * By default, autfilt does not simplify automata (this has not
1204
    changed), as if the --low --any options were used.  But now, if
1205
1206
1207
    one of --small, --deterministic, or --any is given, the
    optimization level automatically defaults to --high (unless
    specified otherwise).  For symmetry, if one of --low, --medium, or
1208
    --high is given, then the translation intent defaults to --small
1209
1210
    (unless specified otherwise).

1211
1212
1213
1214
  * autfilt, dstar2tgba, ltlcross, and ltldo now trust the (supported)
    automaton properties declared in any HOA file they read.  This can
    be disabled with option --trust-hoa=no.

1215
1216
1217
  * ltlgrind FILENAME[/COL] is now the same as
    ltlgrind -F FILENAME[/COL] for consistency with ltlfilt.

1218
1219
  Library:

1220
1221
1222
1223
1224
  * dtgba_complement() was renamed to dtwa_complement(), moved to
    complement.hh, and its purpose was restricted to just completing
    the automaton and complementing its acceptance condition.  Any
    further acceptance condition transformation can be done with
    to_generalized_buchi() or remove_fin().
1225
1226
1227
1228
1229

  * The remove_fin() has learnt how to better deal with automata that
    are declared as weak.  This code was previously in
    dtgba_complement().

1230
1231
1232
1233
1234
  * scc_filter_states() has learnt to remove useless acceptance marks
    that are on transitions between SCCs, while preserving state-based
    acceptance.  The most visible effect is in the output of "ltl2tgba
    -s XXXa": it used to have 5 accepting states, it now has only one.
    (Changing removing acceptance of those 4 states has no effect on
1235
    the language, but it speeds up some algorithms like NDFS-based
1236
1237
    emptiness checks, as discussed in our Spin'15 paper.)

1238
1239
1240