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

3
4
5
  Library:

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

7
8
9
10
  * scc_info learned to determine the acceptance of simple SCCs made
  of a single self-loop without ressorting to remove_fin() for complex
  acceptance conditions.

11
New in spot 2.1.2 (2016-10-14)
12

13
14
15
16
17
18
  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.

19
20
21
22
23
24
  * 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.

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

33
34
  Bug fixes:

35
  * Fix spurious uninitialized read reported by valgrind when
36
    is_Kleene_star() is compiled by clang++.
37

38
  * Using "ltlfilt some-large-file --some-costly-filter" could take
39
40
41
42
43
44
45
    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.

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

51
52
  * Fix ltlcross crash when combining --no-check with --verbose.

53
54
55
  * 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
56
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
57

58
59
60
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
61
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
62
63
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
64
65
66
67
       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'

68
69
70
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

76
77
78
  Bugs fixed:

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

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

84
85
  Command-line tools:

86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
  * 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.

112
113
114
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

115
116
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
    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.
135

136
137
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
138
139
140
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

141
  * autfilt learned --remove-unused-ap to remove atomic propositions
142
143
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
144
    declare atomic propositions (HOA & DSTAR).
145

146
  * autfilt learned two options to filter automata by count of used or
147
148
149
150
    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.

151
152
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
153

154
  * autfilt learned to filter automata representing stutter-invariant
155
156
    properties with --is-stutter-invariant.

157
  * autfilt learned two new options to highlight non-determinism:
158
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
159
160
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
161

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

166
167
168
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

169
  * genltl learned three new families: --dac-patterns=1..45,
170
171
172
    --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 &
173
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
174

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

178
179
180
181
182
183
184
185
186
187
188
189
190
  * 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.

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

196
197
198
199
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

200
201
202
  * 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
203
    check is done for the arguments of autfilt --sat-minimize=...
204

205
206
207
208
209
210
211
212
213
  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.

214
215
216
217
218
219
220
  * 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

221
222
223
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

224
  * is_deterministic(), is_terminal(), is_weak(), and
225
226
227
    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
228
    their check.
229

230
231
232
233
234
235
  * 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.

236
237
238
239
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

240
241
242
  * language_containment_checker now has default values for all
    parameters of its constructor.

243
244
245
246
  * 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.

247
248
249
250
    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.

251
252
  * 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
253
    what their names suggest.  Note that twa::accepting_run(), unlike
254
255
256
    the two others, is currently restricted to automata with Fin-less
    acceptance.

257
258
259
260
261
  * 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.

262
  * New LTL and PSL simplification rules:
263
264
    - 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
265
266
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
267

268
269
270
271
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

272
273
274
275
276
  * 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.

277
278
  Python:

279
  * The __format__() method for formula supports the same
280
281
282
283
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

284
285
  * Bindings for language_containment_checker were added.

286
287
  * Bindings for randomize() were added.

288
289
290
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

296
297
298
299
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

300
301
302
303
  Documentation:

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

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

308
  * Another new page shows how to implement an on-the-fly Kripke
309
    structure for a custom state space.
310
311
    https://spot.lrde.epita.fr/tut51.html

312
313
  * The concepts.html page now lists all named properties
    used by automata.
314

315
316
317
318
319
320
  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)".

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

324
325
326
  * print_lbtt() had a memory leak when printing states without
    successors.

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

329
330
331
332
333
  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
334
335
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
336
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
337
  * The generalized testing automata displayed by the online
338
    translator were incorrect (those output by ltl2tgta were OK).
339
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
340
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
341
342
343
    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.
344

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
345
346
347
348
349
350
351
352
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.
353

354
355
356
357
  Bug fixes:

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

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

363
364
  Library:

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

368
369
370
371
372
  Documentation:

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

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

376
377
378
379
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
380
381
  Bug fixes:

382
  * The automaton parser would choke on comments like /******/.
383
  * check_strength() should also set negated properties.
384
385
386
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
387
388
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
389
  * spot::ltsmin::kripke() had the same issue.
390
391
392
393
  * 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.
394
395
396
397
398
  * 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
399
  * For Small or Deterministic preference, the postprocessor
400
401
402
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
403
404
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
405
  * Various typos and minor documentation fixes.
406

407

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

410
411
412
  Command-line tools:

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

416
417
418
  Python:

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

421
422
423
424
  Library:

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

425
426
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
427
428
429
430
431
  * 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.
432

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

435
436
  Command-line tools:

437
438
439
  * 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.
440

441
442
  Library:

443
444
445
  * 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.
446
  * twa::ap_var() renamed to twa::ap_vars().
447
448
449
450
  * 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().
451
452
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
453

454
455
456
457
  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
458
    it for (the upcoming) Spot 2.0.
459

460
461
462
463
  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
464
  * The shared libraries should now compile again on Darwin.
465

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

468
469
  Command-line tools:

470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
  * 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.

497
498
499
500
501
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

502
503
504
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

505
506
507
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

508
509
510
511
512
513
514
  * 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
515
516
517
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

518
519
520
521
522
  * 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.

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

525
526
527
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

528
529
530
531
532
  Library:

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

533
  * The load_ltsmin() function has been split in two.  Now you should
534
    first call ltsmin_model::load(filename) to create an ltsmin_model,
535
    and then call the ltsmin_model::kripke(...) method to create an
536
537
538
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
539

540
541
542
543
544
545
546
547
548
549
550
551
  * 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
552

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

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

560
561
562
563
  * 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.

564
565
566
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

567
568
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
569

570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
  * 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;
       }

596
597
  Python:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
598
599
600
  * 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.
601

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
602
603
604
605
606
  * 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).

607
608
609
610
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

611
612
613
614
615
  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
616

617
  Bug fixes:
618
619
620

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
627
New in spot 1.99.7 (2016-01-15)
628
629
630

  Command-line tools:

631
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
632
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
633
    This makes it easier to pipe several commands together.
634
635
636
637
638
639

    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
640
641
642
  * 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.
643
644
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
645

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

650
651
  * autfilt has a new option: --is-inherently-weak.

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

655
656
  Library:

657
658
659
660
661
662
663
664
665
  * 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
666
667
668
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
669
670
671
672

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

677
678
679
680
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

681
682
683
684
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

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

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

693
694
695
  * 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.
696

697
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
698
       acc_cond::sets(m)         -> use m.sets()
699
       acc_cond::has(m, u)       -> use m.has(u)
700
701
702
703
       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

704
    Additionally, the following methods/functions have been renamed:
705
706
707

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
708
       parse_acc_code()  -> acc_cond::acc_code(...)
709

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
710
  * Automata property flags (those that tell whether the automaton is
711
712
713
    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
714
715
716
717
718
719
720
721
    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.
722

723
724
  Python:

725
726
727
728
  * 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.

729
730
731
732
  * 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.

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

736
737
738
739
740
  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

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

746
747
748
749
750
751
752
753
754
755
756
757
  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/

758
759
  Bug fixes:

760
761
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
762
763
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
764
765
  * 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
766
767
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
768

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

771
772
  Command-line tools:

773
774
775
776
  * 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.
777
778
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
779

780
781
782
783
784
785
  * 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.

786
787
788
789
790
791
792
  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
793
794
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
795
796
797
798
799
800
801
802
803

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

808
809
810
811
812
813
814
815
816
817
  * 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".
818

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

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

828
829
830
831
832
833
834
  * 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
835
  * The sat minimization for DTωA now does a better job at selecting
836
837
838
839
840
    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
841
  * Explicit Kripke structures (i.e., stored as explicit graphs) have
842
    been rewritten above the graph class, using an interface similar
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
843
844
    to the twa class.  The new class is called kripke_graph.  The ad
    hoc Kripke parser and printer have been removed, because we can
845
846
    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
847
    has an option to load such an HOA file as a kripke_graph.
848

849
850
851
852
  * The HOA parser now accepts identifier, aliases, and headernames
    containing dots, as this will be allowed in the next version of
    the HOA format.

853
854
  * Renamings:
    is_guarantee_automaton() -> is_terminal_automaton()
855
    tgba_run -> twa_run
856
    twa_word::print -> operator<<
857
858
    dtgba_sat_synthetize() -> dtwa_sat_synthetize()
    dtgba_sat_synthetize_dichotomy() -> dtwa_sat_synthetize_dichotomy()
859

860
  Python:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
861

862
  * Add bindings for is_unambiguous().
863
  * Better interface for sat_minimize().
864

865
  Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
866

867
  * the HOA parser was ignoring the "unambiguous" property.
868
869
  * --dot=Bb should work like --dot=b, allowing us to disable
    a B option set via an environment variable.
870

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

873
874
875
  Command-line tools:

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

878
  * By default, autfilt does not simplify automata (this has not
879
    changed), as if the --low --any options were used.  But now, if
880
881
882
    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
883
    --high is given, then the translation intent defaults to --small
884
885
    (unless specified otherwise).

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

890
891
892
  * ltlgrind FILENAME[/COL] is now the same as
    ltlgrind -F FILENAME[/COL] for consistency with ltlfilt.

893
894
  Library:

895
896
897
898
899
  * 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().
900
901
902
903
904

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

905
906
907
908
909
  * 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
910
    the language, but it speeds up some algorithms like NDFS-based
911
912
    emptiness checks, as discussed in our Spin'15 paper.)

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

916
  * The way to pass option to the automaton parser has been changed to
917
    make it easier to introduce new options.  One such new option is
918
919
    "trust_hoa": when true (the default) supported properties declared
    in HOA files are trusted even if they cannot be easily be verified.
920
921
922
923
924
    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
925
    input filename (making the output of error messages easier).
926

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
927
  * The following renamings make the code more consistent:
928
929
930
    ltl_simplifier -> tl_simplifier
    tgba_statistics::transitions -> twa_statistics::edges
    tgba_sub_statistics::sub_transitions -> twa_sub_statistics::transitions
931
    tgba_run -> twa_run
932
    reduce_run -> twa_run::reduce
933
934
935
936
    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
937
938
939
940
941
942
    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
943

944
945
  Python:

946
  * The minimum supported Python version is now 3.3.
947
  * Add bindings for complete() and dtwa_complement()
948
949
  * Formulas now have a custom __format__ function.  See
    https://spot.lrde.epita.fr/tut01.html for examples.
950
951
  * The Debian package is now compiled for all Python3 versions
    supported by Debian, not just the default one.
952
  * Automata now have get_name()/set_name() methods.
953
954
955
  * 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().)
956
957
958
959
960
961
962
963
  * 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--.
964

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
965
966
967
968
969
970
  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

971
972
  Bugs fixed:

973
  * Work around some weird exception raised when using the
974
975
976
977
978
    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.
979
  * "randaut -Q0 1" used to segfault.
980
981
  * "ltlgrind -F FILENAME/COL" did not preserve other CSV columns.
  * "ltlgrind --help" did not document FORMAT.
982
  * unabbreviate could easily use forbidden operators.
983
984
  * "autfilt --is-unambiguous" could fail to detect the nonambiguity
    of some automata with empty languages.
985
986
987
  * 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"
988

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

991
992
  New features:

993
994
995
996
  * 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.
997

998
999
1000
  * 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
For faster browsing, not all history is shown. View entire blame