NEWS 138 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
  * scc_info learned to determine the acceptance of simple SCCs made
8
9
10
11
12
13
14
    of a single self-loop without ressorting to remove_fin() for complex
    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.
15

16
17
18
19
20
  * Simulation-based reductions now implement just bisimulations-based
    reduction on deterministic automata, to save time.  As an example,
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

21
New in spot 2.1.2 (2016-10-14)
22

23
24
25
26
27
28
  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.

29
30
31
32
33
34
  * 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.

35
36
37
38
39
40
41
42
  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)).

43
44
  Bug fixes:

45
  * Fix spurious uninitialized read reported by valgrind when
46
    is_Kleene_star() is compiled by clang++.
47

48
  * Using "ltlfilt some-large-file --some-costly-filter" could take
49
50
51
52
53
54
55
    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.

56
57
58
59
  * 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.
60

61
62
  * Fix ltlcross crash when combining --no-check with --verbose.

63
64
65
  * 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
66
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
67

68
69
70
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
71
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
72
73
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
74
75
76
77
       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'

78
79
80
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

86
87
88
  Bugs fixed:

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

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

94
95
  Command-line tools:

96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
  * 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.

122
123
124
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

125
126
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
    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.
145

146
147
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
148
149
150
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

151
  * autfilt learned --remove-unused-ap to remove atomic propositions
152
153
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
154
    declare atomic propositions (HOA & DSTAR).
155

156
  * autfilt learned two options to filter automata by count of used or
157
158
159
160
    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.

161
162
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
163

164
  * autfilt learned to filter automata representing stutter-invariant
165
166
    properties with --is-stutter-invariant.

167
  * autfilt learned two new options to highlight non-determinism:
168
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
169
170
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
171

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

176
177
178
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

179
  * genltl learned three new families: --dac-patterns=1..45,
180
181
182
    --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 &
183
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
184

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

188
189
190
191
192
193
194
195
196
197
198
199
200
  * 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.

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

206
207
208
209
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

210
211
212
  * 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
213
    check is done for the arguments of autfilt --sat-minimize=...
214

215
216
217
218
219
220
221
222
223
  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.

224
225
226
227
228
229
230
  * 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

231
232
233
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

234
  * is_deterministic(), is_terminal(), is_weak(), and
235
236
237
    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
238
    their check.
239

240
241
242
243
244
245
  * 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.

246
247
248
249
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

250
251
252
  * language_containment_checker now has default values for all
    parameters of its constructor.

253
254
255
256
  * 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.

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

261
262
  * 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
263
    what their names suggest.  Note that twa::accepting_run(), unlike
264
265
266
    the two others, is currently restricted to automata with Fin-less
    acceptance.

267
268
269
270
271
  * 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.

272
  * New LTL and PSL simplification rules:
273
274
    - 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
275
276
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
277

278
279
280
281
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

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

287
288
  Python:

289
  * The __format__() method for formula supports the same
290
291
292
293
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

294
295
  * Bindings for language_containment_checker were added.

296
297
  * Bindings for randomize() were added.

298
299
300
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

306
307
308
309
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

310
311
312
313
  Documentation:

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

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

318
  * Another new page shows how to implement an on-the-fly Kripke
319
    structure for a custom state space.
320
321
    https://spot.lrde.epita.fr/tut51.html

322
323
  * The concepts.html page now lists all named properties
    used by automata.
324

325
326
327
328
329
330
  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)".

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

334
335
336
  * print_lbtt() had a memory leak when printing states without
    successors.

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
355
356
357
358
359
360
361
362
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.
363

364
365
366
367
  Bug fixes:

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

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

373
374
  Library:

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

378
379
380
381
382
  Documentation:

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

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

386
387
388
389
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
390
391
  Bug fixes:

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

417

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

420
421
422
  Command-line tools:

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

426
427
428
  Python:

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

431
432
433
434
  Library:

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

435
436
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
437
438
439
440
441
  * 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.
442

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

445
446
  Command-line tools:

447
448
449
  * 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.
450

451
452
  Library:

453
454
455
  * 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.
456
  * twa::ap_var() renamed to twa::ap_vars().
457
458
459
460
  * 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().
461
462
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
463

464
465
466
467
  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
468
    it for (the upcoming) Spot 2.0.
469

470
471
472
473
  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
474
  * The shared libraries should now compile again on Darwin.
475

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

478
479
  Command-line tools:

480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
  * 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.

507
508
509
510
511
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

512
513
514
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

515
516
517
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

518
519
520
521
522
523
524
  * 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
525
526
527
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

528
529
530
531
532
  * 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.

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

535
536
537
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

538
539
540
541
542
  Library:

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

543
  * The load_ltsmin() function has been split in two.  Now you should
544
    first call ltsmin_model::load(filename) to create an ltsmin_model,
545
    and then call the ltsmin_model::kripke(...) method to create an
546
547
548
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
549

550
551
552
553
554
555
556
557
558
559
560
561
  * 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
562

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

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

570
571
572
573
  * 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.

574
575
576
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

577
578
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
579

580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
  * 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;
       }

606
607
  Python:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
608
609
610
  * 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.
611

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
612
613
614
615
616
  * 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).

617
618
619
620
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

621
622
623
624
625
  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
626

627
  Bug fixes:
628
629
630

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
637
New in spot 1.99.7 (2016-01-15)
638
639
640

  Command-line tools:

641
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
642
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
643
    This makes it easier to pipe several commands together.
644
645
646
647
648
649

    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
650
651
652
  * 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.
653
654
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
655

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

660
661
  * autfilt has a new option: --is-inherently-weak.

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

665
666
  Library:

667
668
669
670
671
672
673
674
675
  * 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
676
677
678
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
679
680
681
682

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

687
688
689
690
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

691
692
693
694
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

695
696
697
698
  * 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.

699
700
701
702
  * 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.

703
704
705
  * 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.
706

707
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
708
       acc_cond::sets(m)         -> use m.sets()
709
       acc_cond::has(m, u)       -> use m.has(u)
710
711
712
713
       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

714
    Additionally, the following methods/functions have been renamed:
715
716
717

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
718
       parse_acc_code()  -> acc_cond::acc_code(...)
719

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
720
  * Automata property flags (those that tell whether the automaton is
721
722
723
    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
724
725
726
727
728
729
730
731
    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.
732

733
734
  Python:

735
736
737
738
  * 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.

739
740
741
742
  * 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.

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

746
747
748
749
750
  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

751
752
753
754
755
  * 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

756
757
758
759
760
761
762
763
764
765
766
767
  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/

768
769
  Bug fixes:

770
771
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
772
773
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
774
775
  * 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
776
777
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
778

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

781
782
  Command-line tools:

783
784
785
786
  * 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.
787
788
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
789

790
791
792
793
794
795
  * 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.

796
797
798
799
800
801
802
  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
803
804
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
805
806
807
808
809
810
811
812
813

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

818
819
820
821
822
823
824
825
826
827
  * 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".
828

829
830
831
832
  * 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.

833
834
835
836
837
  * 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.

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

859
860
861
862
  * The HOA parser now accepts identifier, aliases, and headernames
    containing dots, as this will be allowed in the next version of
    the HOA format.

863
864
  * Renamings:
    is_guarantee_automaton() -> is_terminal_automaton()
865
    tgba_run -> twa_run
866
    twa_word::print -> operator<<
867
868
    dtgba_sat_synthetize() -> dtwa_sat_synthetize()
    dtgba_sat_synthetize_dichotomy() -> dtwa_sat_synthetize_dichotomy()
869

870
  Python:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
871

872
  * Add bindings for is_unambiguous().
873
  * Better interface for sat_minimize().
874

875
  Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
876

877
  * the HOA parser was ignoring the "unambiguous" property.
878
879
  * --dot=Bb should work like --dot=b, allowing us to disable
    a B option set via an environment variable.
880

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

883
884
885
  Command-line tools:

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

888
  * By default, autfilt does not simplify automata (this has not
889
    changed), as if the --low --any options were used.  But now, if
890
891
892
    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
893
    --high is given, then the translation intent defaults to --small
894
895
    (unless specified otherwise).

896
897
898
899
  * 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.

900
901
902
  * ltlgrind FILENAME[/COL] is now the same as
    ltlgrind -F FILENAME[/COL] for consistency with ltlfilt.

903
904
  Library:

905
906
907
908
909
  * 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().
910
911
912
913
914

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

915
916
917
918
919
  * 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
920
    the language, but it speeds up some algorithms like NDFS-based
921
922
    emptiness checks, as discussed in our Spin'15 paper.)

923
924
925
  * 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.

926
  * The way to pass option to the automaton parser has been changed to
927
    make it easier to introduce new options.  One such new option is
928
929
    "trust_hoa": when true (the default) supported properties declared
    in HOA files are trusted even if they cannot be easily be verified.
930
931
932
933
934
    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
935
    input filename (making the output of error messages easier).
936

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
937
  * The following renamings make the code more consistent:
938
939
940
    ltl_simplifier -> tl_simplifier
    tgba_statistics::transitions -> twa_statistics::edges
    tgba_sub_statistics::sub_transitions -> twa_sub_statistics::transitions
941
    tgba_run -> twa_run
942
    reduce_run -> twa_run::reduce
943
944
945
946
    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
947
948
949
950
951
952
    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
953

954
955
  Python:

956
  * The minimum supported Python version is now 3.3.
957
  * Add bindings for complete() and dtwa_complement()
958
959
  * Formulas now have a custom __format__ function.  See
    https://spot.lrde.epita.fr/tut01.html for examples.
960
961
  * The Debian package is now compiled for all Python3 versions
    supported by Debian, not just the default one.
962
  * Automata now have get_name()/set_name() methods.
963
964
965
  * 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().)
966
967
968
969
970
971
972
973
  * 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--.
974

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
975
976
977
978
979
980
  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

981
982
  Bugs fixed:

983
  * Work around some weird exception raised when using the
984
985
986
987
988
    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.
989
  * "randaut -Q0 1" used to segfault.
990
991
  * "ltlgrind -F FILENAME/COL" did not preserve other CSV columns.
  * "ltlgrind --help" did not document FORMAT.
992
  * unabbreviate could easily use forbidden operators.
993
994
  * "autfilt --is-unambiguous" could fail to detect the nonambiguity
    of some automata with empty languages.
995
996
997
  * 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"
998

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

For faster browsing, not all history is shown. View entire blame