NEWS 143 KB
Newer Older
1
New in spot 2.2.2.dev (Not yet released)
2

3
4
5
6
  Library:

  * A twa is required to have at least one state, the initial state.

7
8
9
10
11
12
13
  * The Couvreur emptiness check has been rewritten to use the explicit
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
    automata. Overall, this new version is roughly 4x faster on explicit
    automata than the former one. The old version has been kept for
    compatibility.

14
15
16
  * The new version of the Couvreur emptiness check is now the default
    one, used by is_empty() and accepting_run().

17
18
19
20
  * twa objects have a new property, very-weak, that can be set or
    retrieved via twa::prop_very_weak(), and that can be tested by
    is_very_weak_automaton().

21
22
  Build:

23
24
25
26
27
  * The configure script has a new option --enable-c++14, to compile in
    C++14 mode. Obviously you need a compiler that supports it. This allows
    to check that nothing breaks when we will switch to C++14. This option
    is also available in the configure script of buddy.

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

30
31
32
33
34
  Build:

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

35
36
37
38
  Bug fixes:

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

40
41
42
43
44
  * 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.

45
46
47
48
49
  * 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.

50
51
52
53
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

54
55
56
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

57
58
59
  * 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
60
New in spot 2.2.1 (2016-11-21)
61

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
62
  Bug fix:
63

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
64
65
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
66

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

69
70
71
72
73
74
  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
75
76
77
78
  * "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.

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

87
88
  Library:

89
90
91
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

92
  * is_unambiguous() was rewritten in a more efficient way.
93

94
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
95
    of a single self-loop without resorting to remove_fin() for complex
96
97
98
99
100
101
    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.
102

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
103
104
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
105
106
107
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

108
109
  * scc_filter() learned to preserve state names and highlighted states.

110
111
112
113
114
  * 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).

115
116
117
118
119
120
121
122
  * 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
123
124
125
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
126

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
127
  Bug fixes:
128

129
  * ltl2tgba was always using the highest settings for the LTL
130
131
132
133
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

134
135
136
  * 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.)
137

138
139
140
  * 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
141
  * Running the LTL parser in debug mode would crash.
142

143
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
144
    when run with use_simulation=true (the default) on non-simplified
145
146
    automata.

147
148
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
149
150
151
152
    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.
153

154
155
156
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
157
158
159
  * 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.
160

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

164
New in spot 2.1.2 (2016-10-14)
165

166
167
168
169
170
171
  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.

172
173
174
175
176
177
  * 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.

178
179
180
181
182
183
184
185
  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)).

186
187
  Bug fixes:

188
  * Fix spurious uninitialized read reported by valgrind when
189
    is_Kleene_star() is compiled by clang++.
190

191
  * Using "ltlfilt some-large-file --some-costly-filter" could take
192
193
194
195
196
197
198
    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.

199
200
201
202
  * 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.
203

204
205
  * Fix ltlcross crash when combining --no-check with --verbose.

206
207
208
  * 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
209
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
210

211
212
213
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
214
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
215
216
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
217
218
219
220
       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'

221
222
223
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

229
230
231
  Bugs fixed:

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

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

237
238
  Command-line tools:

239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
  * 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.

265
266
267
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

268
269
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
    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.
288

289
290
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
291
292
293
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

294
  * autfilt learned --remove-unused-ap to remove atomic propositions
295
296
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
297
    declare atomic propositions (HOA & DSTAR).
298

299
  * autfilt learned two options to filter automata by count of used or
300
301
302
303
    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.

304
305
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
306

307
  * autfilt learned to filter automata representing stutter-invariant
308
309
    properties with --is-stutter-invariant.

310
  * autfilt learned two new options to highlight non-determinism:
311
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
312
313
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
314

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

319
320
321
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

322
  * genltl learned three new families: --dac-patterns=1..45,
323
324
325
    --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 &
326
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
327

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

331
332
333
334
335
336
337
338
339
340
341
342
343
  * 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.

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

349
350
351
352
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

353
354
355
  * 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
356
    check is done for the arguments of autfilt --sat-minimize=...
357

358
359
360
361
362
363
364
365
366
  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.

367
368
369
370
371
372
373
  * 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

374
375
376
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

377
  * is_deterministic(), is_terminal(), is_weak(), and
378
379
380
    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
381
    their check.
382

383
384
385
386
387
388
  * 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.

389
390
391
392
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

393
394
395
  * language_containment_checker now has default values for all
    parameters of its constructor.

396
397
398
399
  * 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.

400
401
402
403
    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.

404
405
  * 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
406
    what their names suggest.  Note that twa::accepting_run(), unlike
407
408
409
    the two others, is currently restricted to automata with Fin-less
    acceptance.

410
411
412
413
414
  * 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.

415
  * New LTL and PSL simplification rules:
416
417
    - 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
418
419
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
420

421
422
423
424
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

425
426
427
428
429
  * 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.

430
431
  Python:

432
  * The __format__() method for formula supports the same
433
434
435
436
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

437
438
  * Bindings for language_containment_checker were added.

439
440
  * Bindings for randomize() were added.

441
442
443
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

449
450
451
452
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

453
454
455
456
  Documentation:

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

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

461
  * Another new page shows how to implement an on-the-fly Kripke
462
    structure for a custom state space.
463
464
    https://spot.lrde.epita.fr/tut51.html

465
466
  * The concepts.html page now lists all named properties
    used by automata.
467

468
469
470
471
472
473
  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)".

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

477
478
479
  * print_lbtt() had a memory leak when printing states without
    successors.

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

482
483
484
485
486
  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
487
488
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
489
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
490
  * The generalized testing automata displayed by the online
491
    translator were incorrect (those output by ltl2tgta were OK).
492
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
493
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
494
495
496
    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.
497

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
498
499
500
501
502
503
504
505
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.
506

507
508
509
510
  Bug fixes:

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

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

516
517
  Library:

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

521
522
523
524
525
  Documentation:

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

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

529
530
531
532
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
533
534
  Bug fixes:

535
  * The automaton parser would choke on comments like /******/.
536
  * check_strength() should also set negated properties.
537
538
539
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
540
541
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
542
  * spot::ltsmin::kripke() had the same issue.
543
544
545
546
  * 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.
547
548
549
550
551
  * 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
552
  * For Small or Deterministic preference, the postprocessor
553
554
555
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
556
557
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
558
  * Various typos and minor documentation fixes.
559

560

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

563
564
565
  Command-line tools:

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

569
570
571
  Python:

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

574
575
576
577
  Library:

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

578
579
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
580
581
582
583
584
  * 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.
585

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

588
589
  Command-line tools:

590
591
592
  * 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.
593

594
595
  Library:

596
597
598
  * 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.
599
  * twa::ap_var() renamed to twa::ap_vars().
600
601
602
603
  * 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().
604
605
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
606

607
608
609
610
  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
611
    it for (the upcoming) Spot 2.0.
612

613
614
615
616
  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
617
  * The shared libraries should now compile again on Darwin.
618

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

621
622
  Command-line tools:

623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
  * 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.

650
651
652
653
654
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

655
656
657
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

658
659
660
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

661
662
663
664
665
666
667
  * 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
668
669
670
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

671
672
673
674
675
  * 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.

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

678
679
680
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

681
682
683
684
685
  Library:

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

686
  * The load_ltsmin() function has been split in two.  Now you should
687
    first call ltsmin_model::load(filename) to create an ltsmin_model,
688
    and then call the ltsmin_model::kripke(...) method to create an
689
690
691
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
692

693
694
695
696
697
698
699
700
701
702
703
704
  * 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
705

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

709
710
711
712
  * 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.

713
714
715
716
  * 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.

717
718
719
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

720
721
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
722

723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
  * 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;
       }

749
750
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
755
756
757
758
759
  * 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).

760
761
762
763
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

764
765
766
767
768
  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
769

770
  Bug fixes:
771
772
773

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
780
New in spot 1.99.7 (2016-01-15)
781
782
783

  Command-line tools:

784
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
785
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
786
    This makes it easier to pipe several commands together.
787
788
789
790
791
792

    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
793
794
795
  * 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.
796
797
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
798

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

803
804
  * autfilt has a new option: --is-inherently-weak.

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

808
809
  Library:

810
811
812
813
814
815
816
817
818
  * 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
819
820
821
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
822
823
824
825

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

830
831
832
833
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

834
835
836
837
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

838
839
840
841
  * 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.

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

846
847
848
  * 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.
849

850
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
851
       acc_cond::sets(m)         -> use m.sets()
852
       acc_cond::has(m, u)       -> use m.has(u)
853
854
855
856
       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

857
    Additionally, the following methods/functions have been renamed:
858
859
860

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
861
       parse_acc_code()  -> acc_cond::acc_code(...)
862

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
863
  * Automata property flags (those that tell whether the automaton is
864
865
866
    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
867
868
869
870
871
872
873
874
    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.
875

876
877
  Python:

878
879
880
881
  * 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.

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

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

889
890
891
892
893
  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

894
895
896
897
898
  * 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

899
900
901
902
903
904
905
906
907
908
909
910
  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/

911
912
  Bug fixes:

913
914
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
915
916
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
917
918
  * 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
919
920
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
921

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

924
925
  Command-line tools:

926
927
928
929
  * 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.
930
931
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
932

933
934
935
936
937
938
  * 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.

939
940
941
942
943
944
945
  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
946
947
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
948
949
950
951
952
953
954
955
956

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

961
962
963
964
965
966
967
968
969
970
  * 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".
971

972
973
974
975
  * 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.

976
977
978
979
980
  * 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.

981
982
983
984
985
986
987
  * 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
988
  * The sat minimization for DTωA now does a better job at selecting
989
990
991
992
993
    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
994
  * Explicit Kripke structures (i.e., stored as explicit graphs) have
995
    been rewritten above the graph class, using an interface similar
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
996
997
    to the twa class.  The new class is called kripke_graph.  The ad
    hoc Kripke parser and printer have been removed, because we can
998
999
    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
1000
    has an option to load such an HOA file as a kripke_graph.