NEWS 142 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
2
3
4
New in spot 2.2.2.dev (not yet released)

  Nothing yet.

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

7
8
9
10
11
  Build:

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

12
13
14
15
  Bug fixes:

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

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

22
23
24
25
26
  * 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.

27
28
29
30
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

31
32
33
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

34
35
36
  * 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
37
New in spot 2.2.1 (2016-11-21)
38

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
39
  Bug fix:
40

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
41
42
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
43

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

46
47
48
49
50
51
  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
52
53
54
55
  * "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.

56
57
58
  * 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
59
60
61
62
    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
63

64
65
  Library:

66
67
68
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

69
  * is_unambiguous() was rewritten in a more efficient way.
70

71
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
72
    of a single self-loop without resorting to remove_fin() for complex
73
74
75
76
77
78
    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.
79

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
80
81
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
82
83
84
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

85
86
  * scc_filter() learned to preserve state names and highlighted states.

87
88
89
90
91
  * 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).

92
93
94
95
96
97
98
99
  * 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
100
101
102
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
103

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
104
  Bug fixes:
105

106
  * ltl2tgba was always using the highest settings for the LTL
107
108
109
110
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

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

115
116
117
  * 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
118
  * Running the LTL parser in debug mode would crash.
119

120
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
121
    when run with use_simulation=true (the default) on non-simplified
122
123
    automata.

124
125
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
126
127
128
129
    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.
130

131
132
133
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
134
135
136
  * 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.
137

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

141
New in spot 2.1.2 (2016-10-14)
142

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

149
150
151
152
153
154
  * 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.

155
156
157
158
159
160
161
162
  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)).

163
164
  Bug fixes:

165
  * Fix spurious uninitialized read reported by valgrind when
166
    is_Kleene_star() is compiled by clang++.
167

168
  * Using "ltlfilt some-large-file --some-costly-filter" could take
169
170
171
172
173
174
175
    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.

176
177
178
179
  * 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.
180

181
182
  * Fix ltlcross crash when combining --no-check with --verbose.

183
184
185
  * 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
186
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
187

188
189
190
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
191
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
192
193
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
194
195
196
197
       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'

198
199
200
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

206
207
208
  Bugs fixed:

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

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

214
215
  Command-line tools:

216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
  * 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.

242
243
244
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

245
246
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
    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.
265

266
267
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
268
269
270
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

271
  * autfilt learned --remove-unused-ap to remove atomic propositions
272
273
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
274
    declare atomic propositions (HOA & DSTAR).
275

276
  * autfilt learned two options to filter automata by count of used or
277
278
279
280
    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.

281
282
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
283

284
  * autfilt learned to filter automata representing stutter-invariant
285
286
    properties with --is-stutter-invariant.

287
  * autfilt learned two new options to highlight non-determinism:
288
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
289
290
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
291

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

296
297
298
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

299
  * genltl learned three new families: --dac-patterns=1..45,
300
301
302
    --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 &
303
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
304

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

308
309
310
311
312
313
314
315
316
317
318
319
320
  * 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.

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

326
327
328
329
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

330
331
332
  * 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
333
    check is done for the arguments of autfilt --sat-minimize=...
334

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

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

351
352
353
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

354
  * is_deterministic(), is_terminal(), is_weak(), and
355
356
357
    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
358
    their check.
359

360
361
362
363
364
365
  * 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.

366
367
368
369
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

370
371
372
  * language_containment_checker now has default values for all
    parameters of its constructor.

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

377
378
379
380
    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.

381
382
  * 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
383
    what their names suggest.  Note that twa::accepting_run(), unlike
384
385
386
    the two others, is currently restricted to automata with Fin-less
    acceptance.

387
388
389
390
391
  * 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.

392
  * New LTL and PSL simplification rules:
393
394
    - 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
395
396
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
397

398
399
400
401
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

402
403
404
405
406
  * 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.

407
408
  Python:

409
  * The __format__() method for formula supports the same
410
411
412
413
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

414
415
  * Bindings for language_containment_checker were added.

416
417
  * Bindings for randomize() were added.

418
419
420
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

426
427
428
429
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

430
431
432
433
  Documentation:

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

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

438
  * Another new page shows how to implement an on-the-fly Kripke
439
    structure for a custom state space.
440
441
    https://spot.lrde.epita.fr/tut51.html

442
443
  * The concepts.html page now lists all named properties
    used by automata.
444

445
446
447
448
449
450
  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)".

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

454
455
456
  * print_lbtt() had a memory leak when printing states without
    successors.

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

459
460
461
462
463
  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
464
465
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
466
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
467
  * The generalized testing automata displayed by the online
468
    translator were incorrect (those output by ltl2tgta were OK).
469
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
470
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
471
472
473
    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.
474

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
475
476
477
478
479
480
481
482
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.
483

484
485
486
487
  Bug fixes:

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

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

493
494
  Library:

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

498
499
500
501
502
  Documentation:

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

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

506
507
508
509
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
510
511
  Bug fixes:

512
  * The automaton parser would choke on comments like /******/.
513
  * check_strength() should also set negated properties.
514
515
516
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
517
518
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
519
  * spot::ltsmin::kripke() had the same issue.
520
521
522
523
  * 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.
524
525
526
527
528
  * 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
529
  * For Small or Deterministic preference, the postprocessor
530
531
532
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
533
534
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
535
  * Various typos and minor documentation fixes.
536

537

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

540
541
542
  Command-line tools:

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

546
547
548
  Python:

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

551
552
553
554
  Library:

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

555
556
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
557
558
559
560
561
  * 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.
562

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

565
566
  Command-line tools:

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

571
572
  Library:

573
574
575
  * 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.
576
  * twa::ap_var() renamed to twa::ap_vars().
577
578
579
580
  * 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().
581
582
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
583

584
585
586
587
  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
588
    it for (the upcoming) Spot 2.0.
589

590
591
592
593
  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
594
  * The shared libraries should now compile again on Darwin.
595

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

598
599
  Command-line tools:

600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
  * 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.

627
628
629
630
631
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

632
633
634
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

635
636
637
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

638
639
640
641
642
643
644
  * 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
645
646
647
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

648
649
650
651
652
  * 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.

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

655
656
657
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

658
659
660
661
662
  Library:

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

663
  * The load_ltsmin() function has been split in two.  Now you should
664
    first call ltsmin_model::load(filename) to create an ltsmin_model,
665
    and then call the ltsmin_model::kripke(...) method to create an
666
667
668
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
669

670
671
672
673
674
675
676
677
678
679
680
681
  * 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
682

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

686
687
688
689
  * 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.

690
691
692
693
  * 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.

694
695
696
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

697
698
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
699

700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
  * 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;
       }

726
727
  Python:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
728
729
730
  * 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.
731

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
732
733
734
735
736
  * 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).

737
738
739
740
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

741
742
743
744
745
  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
746

747
  Bug fixes:
748
749
750

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
757
New in spot 1.99.7 (2016-01-15)
758
759
760

  Command-line tools:

761
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
762
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
763
    This makes it easier to pipe several commands together.
764
765
766
767
768
769

    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
770
771
772
  * 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.
773
774
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
775

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

780
781
  * autfilt has a new option: --is-inherently-weak.

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

785
786
  Library:

787
788
789
790
791
792
793
794
795
  * 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
796
797
798
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
799
800
801
802

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

807
808
809
810
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

811
812
813
814
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

815
816
817
818
  * 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.

819
820
821
822
  * 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.

823
824
825
  * 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.
826

827
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
828
       acc_cond::sets(m)         -> use m.sets()
829
       acc_cond::has(m, u)       -> use m.has(u)
830
831
832
833
       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

834
    Additionally, the following methods/functions have been renamed:
835
836
837

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
838
       parse_acc_code()  -> acc_cond::acc_code(...)
839

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
840
  * Automata property flags (those that tell whether the automaton is
841
842
843
    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
844
845
846
847
848
849
850
851
    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.
852

853
854
  Python:

855
856
857
858
  * 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.

859
860
861
862
  * 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.

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

866
867
868
869
870
  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

871
872
873
874
875
  * 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

876
877
878
879
880
881
882
883
884
885
886
887
  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/

888
889
  Bug fixes:

890
891
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
892
893
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
894
895
  * 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
896
897
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
898

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

901
902
  Command-line tools:

903
904
905
906
  * 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.
907
908
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
909

910
911
912
913
914
915
  * 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.

916
917
918
919
920
921
922
  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
923
924
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
925
926
927
928
929
930
931
932
933

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

938
939
940
941
942
943
944
945
946
947
  * 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".
948

949
950
951
952
  * 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.

953
954
955
956
957
  * 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.

958
959
960
961
962
963
964
  * 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
965
  * The sat minimization for DTωA now does a better job at selecting
966
967
968
969
970
    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
971
  * Explicit Kripke structures (i.e., stored as explicit graphs) have
972
    been rewritten above the graph class, using an interface similar
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
973
974
    to the twa class.  The new class is called kripke_graph.  The ad
    hoc Kripke parser and printer have been removed, because we can
975
976
    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
977
    has an option to load such an HOA file as a kripke_graph.
978

979
980
981
982
  * The HOA parser now accepts identifier, aliases, and headernames
    containing dots, as this will be allowed in the next version of
    the HOA format.

983
984
  * Renamings:
    is_guarantee_automaton() -> is_terminal_automaton()
985
    tgba_run -> twa_run
986
    twa_word::print -> operator<<
987
988
    dtgba_sat_synthetize() -> dtwa_sat_synthetize()
    dtgba_sat_synthetize_dichotomy() -> dtwa_sat_synthetize_dichotomy()
989

990
  Python:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
991

992
  * Add bindings for is_unambiguous().
993
  * Better interface for sat_minimize().
994

995
  Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
996

997
  * the HOA parser was ignoring the "unambiguous" property.
998
999
  * --dot=Bb should work like --dot=b, allowing us to disable
    a B option set via an environment variable.
1000

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

1003
1004
1005
  Command-line tools:

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

1008
  * By default, autfilt does not simplify automata (this has not
1009
    changed), as if the --low --any options were used.  But now, if
1010
1011
1012
    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
1013
    --high is given, then the translation intent defaults to --small
1014
1015
    (unless specified otherwise).

1016
1017
1018
1019
  * 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.

1020
1021
1022
  * ltlgrind FILENAME[/COL] is now the same as
    ltlgrind -F FILENAME[/COL] for consistency with ltlfilt.

1023
1024
  Library:

1025
1026
1027
1028
1029
  * 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().
1030
1031
1032
1033
1034

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

1035
1036
1037
1038
1039
  * 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
1040
    the language, but it speeds up some algorithms like NDFS-based
1041
1042
    emptiness checks, as discussed in our Spin'15 paper.)

1043
1044
1045
  * The HOA parser will diagnose any version that is not v1, unless it
    looks like a subversion of v1 and no parse error was detected.

1046
  * The way to pass option to the automaton parser has been changed to
1047
    make it easier to introduce new options.  One such new option is
1048
1049
    "trust_hoa": when true (the default) supported properties declared
    in HOA files are trusted even if they cannot be easily be verified.
1050
1051
1052
1053
1054
    Another option "raise_errors" now replaces the method
      automaton_stream_parser::parse_strict().

  * The output of the automaton parser now include the list of parse
    errors (that does not have to be passed as a parameters) and the
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1055
    input filename (making the output of error messages easier).
1056

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1057
  * The following renamings make the code more consistent:
1058
1059
1060
    ltl_simplifier -> tl_simplifier
    tgba_statistics::transitions -> twa_statistics::edges
    tgba_sub_statistics::sub_transitions -> twa_sub_statistics::transitions
1061
    tgba_run -> twa_run
1062
    reduce_run -> twa_run::reduce
1063
1064
1065
1066
    replay_tgba_run -> twa_run::replay
    print_tgba_run -> operator<<
    tgba_run_to_tgba -> twa_run::as_twa
    format_parse_aut_errors -> parsed_aut::format_errors
1067
1068
1069
1070
1071
1072
    twa_succ_iterator::current_state -> twa_succ_iterator::dst
    twa_succ_iterator::current_condition -> twa_succ_iterator::cond
    twa_succ_iterator::current_acceptance_conditions -> twa_succ_iterator::acc
    ta_succ_iterator::current_state -> ta_succ_iterator::dst
    ta_succ_iterator::current_condition -> ta_succ_iterator::cond
    ta_succ_iterator::current_acceptance_conditions -> ta_succ_iterator::acc
1073

1074
1075
  Python:

1076
  * The minimum supported Python version is now 3.3.
1077
  * Add bindings for complete() and dtwa_complement()
1078
1079
  * Formulas now have a custom __format__ function.  See
    https://spot.lrde.epita.fr/tut01.html for examples.
1080
1081
  * The Debian package is now compiled for all Python3 versions
    supported by Debian, not just the default one.
1082
  * Automata now have get_name()/set_name() methods.
1083
1084
1085
  * spot.postprocess(aut, *options), or aut.postprocess(*options)
    simplify the use of the spot.postprocessor object.  (Just like we
    have spot.translate() on top of spot.translator().)
1086
1087
1088
1089
1090
1091
1092
1093
  * spot.automata() and spot.automaton() now have additional
    optional arguments:
    - timeout: to restrict the runtime of commands that
      produce automata
    - trust_hoa: can be set to False to ignore HOA properties
      that cannot be easily verified
    - ignore_abort: can be set to False if you do not want to
      skip automata ended with --ABORT--.
1094

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1095
1096
1097
1098
1099
1100
  Documentation:

  * There is a new page showing how to use spot::postprocessor
    to convert any type of automaton to Büchi.
    https://spot.lrde.epita.fr/tut30.html

1101
1102
  Bugs fixed:

1103
  * Work around some weird exception raised when using the
1104
1105
1106
1107
1108
    randltlgenerator under Python 3.5.
  * Recognize "nullptr" formulas as None in Python.
  * Fix compilation of bench/stutter/
  * Handle saturation of formula reference counts.
  * Fix typo in the Python code for the CGI server.
1109
  * "randaut -Q0 1" used to segfault.
1110
1111
  * "ltlgrind -F FILENAME/COL" did not preserve other CSV columns.
  * "ltlgrind --help" did not document FORMAT.
1112
  * unabbreviate could easily use forbidden operators.
1113
1114
  * "autfilt --is-unambiguous" could fail to detect the nonambiguity
    of some automata with empty languages.
1115
1116
1117
  * When parsing long tokens (e.g, state labels representing
    very large strings) the automaton parser could die with
    "input buffer overflow, can't enlarge buffer because scanner uses REJECT"
1118

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1119
New in spot 1.99.4 (2015-10-01)
1120

1121
1122
  New features:

1123
1124
1125
1126
  * autfilt's --sat-minimize now takes a "colored" option to constrain
    all transitions (or states) in the output automaton to belong to
    exactly one acceptance sets.  This is useful when targeting parity
    acceptance.
1127

1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
  * autfilt has a new --product-or option.  This builds a synchronized
    product of two (completed of needed) automata in order to
    recognize the *sum* of their languages.  This works by just using
    the disjunction of their acceptance conditions (with appropriate
    renumbering of the acceptance sets).

    For consistency, the --product option (that builds a synchronized
    product that recognizes the *intersection* of the languages) now
    also has a --product-and alias.

1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
  * the parser for ltl2dstar's format has been merged with the parser
    for the other automata formats.  This implies two things:
    - autfilt and dstar2tgba (despite its name) can now both read
      automata written in any of the four supported syntaxes
      (ltl2dstar's, lbtt's, HOA, never claim).
    - "dstar2tgba some files..." now behaves exactly like
      "autfilt --tgba --high --small some files...".
      (But dstar2tgba does not offer all the filtering and
      transformations options of autfilt.)

1148
1149
  Major code changes and reorganization:

1150
1151
1152
  * The class hierarchy for temporal formulas has been entirely
    rewritten.  This change is actually quite massive (~13200 lines
    removed, ~8200 lines added), and brings some nice benefits:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1153
    - LTL/PSL formulas are now represented by lightweight formula
1154
1155
1156
1157
      objects (instead of pointers to children of an abstract
      formula class) that perform reference counting automatically.
    - There is no hierachy anymore: all operators are represented by
      a single type of node in the syntax tree, and an enumerator is
1158
      used to distinguish between operators.
1159
1160
1161
1162
1163
1164
1165
1166
    - Visitors have been replaced by member functions such as map()
      or traverse(), that take a function (usually written as a
      lambda function) and apply it to the nodes of the tree.
    - As a consequence, writing algorithms that manipulate formula
      is more friendly, and several algorithms that spanned a few
      pages have been reduced to a few lines.
    The page https://spot.lrde.epita.fr/tut03.html illustrates the
    new interface, in both C++ and Python.
1167

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1168
1169
1170
1171
1172
  * Directories ltlast/, ltlenv/, and ltlvisit/, have been merged into
    a single tl/ directory (for temporal logic).  This is motivated by
    the fact that these formulas are not restricted to LTL, and by the
    fact that we no longuer use the "visitor" pattern.

1173
1174
1175
  * The LTL/PSL parser is now declared in tl/parse.hh (instead of
    ltlparse/public.hh).

1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
  * The spot::ltl namespace has been merged with the spot namespace.

  * The dupexp_dfs() function has been renamed to copy(), and has
    learned to preserve named states if required.

  * Atomic propositions can be declared without going through an
    environment using the spot::formula::ap() static function.  They
    can be registered for an automaton directly using the
    spot::twa::register_ap() method.  The vector of atomic
    propositions used by an automaton can now be retrieved using the
    spot::twa::ap() method.
1187

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1188
New in spot 1.99.3 (2015-08-26)
1189

1190
1191
1192
  * The CGI script for LTL translation offers a HOA download link
    for each generated automaton.

1193
  * The html documentation now includes a HTML copies of the man
1194
    pages, and HTML copies of the Python notebooks.
1195

1196
1197
1198
1199
  * scc_filter(aut, true) does not remove Fin marks from rejecting
    SCCs, but it now does remove Fin marks from transitions between
    SCCs.

1200
1201
1202
  * All the unabbreviation functions (unabbreviate_ltl(),
    unabbreviate_logic(), unabbreviate_wm()) have been merged into a
    single unabbreviate() function that takes a string representing
1203
1204
1205
    the list of operators to remove among "eFGiMRW^" where 'e', 'i',
    and '^' stand respectively for <->, ->, and xor.
    This feature is also available via ltlfilt --unabbreviate.
1206

1207
1208
1209
1210
  * In LTL formulas, atomic propositions specified using double-quotes
    can now include \" and \\.  (This is more consistent with the HOA
    format, which already allows that.)

1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
  * All the conversion routines that were written specifically for
    ltl2dstar's output format (DRA->BA & DRA->TGBA) have been ported
    to the new TωA structure supporting the HOA format.  The DRA->TGBA
    conversion was reimplemented in the previous release, and the
    DRA->BA conversion has been reimplemented in this release (but it
    is still restricted to state-based acceptance).  All these
    conversions are called automatically by to_generalized_buchi()
    or remove_fin() so there should be no need to call them directly.

    As a consequence:
    - "autfilt --remove-fin" or "autfilt -B" is better at converting
      state-based Rabin automata: it will produce a DBA if the input is
      deterministic and DBA-realizable, but will preserve as much
      determinism as possible otherwise.
    - a lot of obsolete code that was here only to support the old
      conversion routines has been removed.  (The number of lines
      removed by this release is twice the number of lines added.)
    - ltlcross now uses automata in ltl2dstar's format directly,
      without converting them to Büchi (this makes the statistics
      reported in CSV files more relevant).
    - ltlcross no longer outputs additional columns about the size
      of the input automaton in the case ltl2dstar's format is used.
    - ltldo uses results in ltl2dstar's format directly, without
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1234
      converting them to Büchi.
1235
1236
    - dstar2tgba has been greatly simplified and now uses the
      same output routines as all the other tools that output
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1237
      automata.  This implies a few minor semantic changes, for
1238
      instance --stats=%A used to output the number of acceptance
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1239
      *pairs* in the input automaton, while it now outputs the
1240
1241
      number of acceptance sets like in all the other tools.

1242
1243
  * Bugs fixed
    - Some acceptance conditions like Fin(0)|Fin(1)|Fin(2)&Inf(3)