NEWS 222 KB
Newer Older
1
2
3
4
New in spot 2.8.3.dev  (not yet released)

  Nothing yet.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
5
New in spot 2.8.3 (2019-11-06)
6

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
7
8
9
  Build:

  - Minor portabilities improvements with C++17 deprecations.
10

11
12
13
14
15
16
  Python:

  - Doing "import spot.foo" will now load any spot-extra/foo.py on
    Python's search path.  This can be used to install third-party
    packages that want to behave as plugins for Spot.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
17
18
19
  - Work around GraphViz bug #1605 in Jupyter notebooks.
    https://gitlab.com/graphviz/graphviz/issues/1605

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
20
New in spot 2.8.2 (2019-09-27)
21

22
23
24
25
  Command-line tools:

  - ltl2tgba and ltldo learned a --negate option.

26
27
28
29
30
  Bugs fixed:

  - Calling "autfilt --dualize" on an alternating automaton with
    transition-based acceptance and universal initial states would
    fail with "set_init_state() called with nonexisting state".
31

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
32
33
34
35
  - The numbering of nodes in the AIGER output of ltlsynt was
    architecture dependent.

  - Various compilation issues.  In particular, this release is the
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
36
    first one that can be compiled (and pass tests) on a Raspberry PI.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
37

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
38
New in spot 2.8.1 (2019-07-18)
39

40
41
42
43
  Command-line tools:

  - genltl learned --pps-arbiter-standard and --pps-arbiter-strict.

44
45
46
47
48
49
  - ltlcross and autcross have learned a new option -q (--quiet) to
    remain quiet until an error is found.  This helps for instance in
    scenarios where multiple instances of ltlcross/autcross are run in
    parallel (using "xargs -P" or "GNU Parallel", for instance).  See
    https://spot.lrde.epita.fr/ltlcross.html#parallel for examples.

50
51
52
53
54
55
56
  Bugs fixed:

  - When complement() was called with an output_aborter, it could
    return an alternating automaton on large automata.  This in turn
    caused ltlcross to emit errors like "remove_alternation() only
    works with weak alternating automata" or "product() does not
    support alternating automata".
57

58
59
60
61
  - Work around Emacs bug #34341 when rebuilding documentation on a
    system with Emacs <26.3, GNU TLS >= 3.6, and without ESS or with
    an obsolete org-mode installed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
62
New in spot 2.8 (2019-07-10)
63

64
65
66
67
68
  Command-line tools:

  - autfilt learned --highlight-accepting-run=NUM to highlight some
    accepting run with color NUM.

69
70
71
  - ltldo, ltlcross, and autcross are now preferring posix_spawn()
    over fork()+exec() when available.

72
73
74
75
76
77
78
79
80
  - ltlcross has new options --determinize-max-states=N and
    --determinize-max-edges=M to restrict the use of
    determinization-based complementation to cases where it produces
    automata with at most N states and M edges.  By default
    determinization is now attempted up to 500 states and 5000
    edges.  This is an improvement over the previous default where
    determinization-based complementation was not performed at all,
    unless -D was specified.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
81
  - ltlcross will now skip unnecessary cross-checks and
82
83
84
    consistency-checks (they are unnecessary when all automata
    could be complemented and statistics were not required).

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
85
  - genaut learned --m-nba=N to generate Max Michel's NBA family.
86
87
    (NBAs with N+1 states whose determinized have at least N! states.)

88
89
90
  - Due to some new simplification of parity acceptance, the output of
    "ltl2tgba -P -D" is now using a minimal number of colors.  This
    means that recurrence properties have an acceptance condition
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
91
    among "Inf(0)", "t", or "f", and persistence properties have an
92
93
    acceptance condition among "Fin(0)", "t", or "f".

94
  - ltldo and ltlcross learned shorthands to call the tools ltl2na,
95
96
    ltl2nba, and ltl2ngba from Owl 19.06.  Similarly, autcross learned
    a shorthand for Owl's dra2dpa.
97

98
99
100
  Documentation:

  - https://spot.lrde.epita.fr/tut90.html is a new file that explains
101
    the purpose of the spot::bdd_dict object.
102

103
104
105
106
107
  Library:

  - Add generic_accepting_run() as a variant of generic_emptiness_check() that
    returns an accepting run in an automaton with any acceptance condition.

108
109
  - twa::accepting_run() and twa::intersecting_run() now work on
    automata using Fin in their acceptance condition.
110

111
112
113
114
115
116
117
  - simulation-based reductions have learned a trick that sometimes
    improve transition-based output when the input is state-based.
    (The automaton output by 'ltl2tgba -B GFa | autfilt --small' now
    has 1 state instead of 2 in previous versions.  Similarly,
    'ltldo ltl2dstar -f 'GFa -> GFb' | autfilt --small' produces 1
    state instead of 4.)

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
118
119
  - simulation-based reductions has learned another trick to better
    merge states from transient SCCs.
120

121
122
123
  - acc_cond::top_disjuncts() and acc_cond::top_conjuncts() can be
    used to split an acceptance condition on the top-level & or |.
    These methods also exist in acc_cond::acc_code.
124

125
126
127
128
129
  - minimize_obligation() learned to work on very weak automata even
    if the formula or negated automaton are not supplied.  (This
    allows "autfilt [-D] --small" to minimize very-weak automata
    whenever they are found to represent obligation properties.)

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
130
  - There is a new spot::scc_and_mark_filter object that simplifies the
131
132
133
134
135
    creation of filters to restrict spot::scc_info to some particular
    SCC while cutting new SCCs on given acceptance sets.  This is used
    by spot::generic_emptiness_check() when processing SCCs
    recursively, and makes it easier to write similar code in Python.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
136
137
138
139
  - print_dot has a new option 'g', to hide edge labels.  This is
    helpful to display automata as "graphs", e.g., when illustrating
    algorithms that do not care about labels.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
140
141
142
143
  - A new complement() function returns complemented automata with
    unspecified acceptance condition, allowing different algorithms to
    be used.  The output can be alternating only if the input was
    alternating.
144

145
146
147
148
149
150
151
152
153
154
155
156
157
158
  - There is a new class output_aborter that is used to specify
    upper bounds on the size of automata produced by some algorithms.
    Several functions have been changed to accept an output_aborter.
    This includes:
      * tgba_determinize()
      * tgba_powerset()
      * minimize_obligation()
      * minimize_wdba()
      * remove_alternation()
      * product()
      * the new complement()
      * the postprocessor class, via the "det-max-state" and
        "det-max-edges" options.

159
160
161
162
163
164
165
  - SVA's first_match operator can now be used in SERE formulas and
    that is supported by the ltl_to_tgba_fm() translation.  See
    doc/tl/tl.pdf for the semantics.  *WARNING* Because this adds a
    new operator, any code that switches over the spot::op type may
    need a new case for op::first_match.  Furthermore, the output of
    "randltl --psl" will be different from previous releases.

166
167
  - The parser for SERE learned to recognize the ##n and ##[i:j]
    operators from SVA.  So {##2 a ##0 b[+] ##1 c ##2 e} is another
168
169
    way to write {[*2];a:b[+];c;1;e}.  The syntax {a ##[i:j] b} is
    replaced in different ways depending on the values of i, a, and b.
170
    The formula::sugar_delay() function implements this SVA operator in
171
172
    terms of the existing PSL operators.  ##[+] and ##[*] are sugar
    for ##[1:$] and ##[0:$].
173

174
175
176
  - The F[n:m] and G[n:m] operators introduced in Spot 2.7 now
    support the case where m=$.

177
  - spot::relabel_apply() makes it easier to reverse the effect
178
179
    of spot::relabel() or spot::relabel_bse() on formula.

180
  - The LTL simplifier learned the following rules:
181
    F(G(a | Fb)) = FGa | GFb  (if option "favor_event_univ")
182
    G(F(a | Gb)) = GFa | FGb  (if option "favor_event_univ")
183
184
    F(G(a & Fb) = FGa & GFb   (unless option "reduce_size_strictly")
    G(F(a & Gb)) = GFa & FGb  (unless option "reduce_size_strictly")
185
186
    GF(f) = GF(dnf(f))        (unless option "reduce_size_strictly")
    FG(f) = FG(cnf(f))        (unless option "reduce_size_strictly")
187
188
189
190
191
192
193
194
    (f & g) R h = f R h       if h implies g
    (f & g) M h = f M h       if h implies g
    (f | g) W h = f W h       if g implies h
    (f | g) U h = f U h       if g implies h
    Gf | F(g & eventual) = f W (g & eventual)    if !f implies g
    Ff & G(g | universal) = f M (g | universal)  if f implies !g
    f U (g & eventual) = F(g & eventual)         if !f implies g
    f R (g | universal) = G(g | universal)       if f implies !g
195

196
197
  - cleanup_parity() and colorize_parity() were cleaned up a bit,
    resulting in fewer colors used in some cases.  In particular,
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
198
    colorize_parity() learned that coloring transient edges does not
199
200
    require the introduction of a new color.

201
202
203
204
205
206
  - A new reduce_parity() function implements and generalizes the
    algorithm for minimizing parity acceptance by Carton and Maceiras
    (Computing the Rabin index of a parity automaton, 1999).  This is
    a better replacement for cleanup_parity() and colorize_parity().
    See https://spot.lrde.epita.fr/ipynb/parity.html for examples.

207
208
209
  - The postprocessor and translator classes are now using
    reduce_parity() for further simplifications.

210
211
212
213
214
215
216
  - The code for checking recurrence/persistence properties can also
    use the fact the reduce_parity() with return "Inf(0)" (or "t" or
    "f") for deterministic automata corresponding to recurrence
    properties, and "Fin(0)" (or "t" or "f") for persistence
    properties.  This can be altered with the SPOT_PR_CHECK
    environment variable.

217
  Deprecation notices:
218

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
219
  - The virtual function twa::intersecting_run() no longer takes a
220
221
222
223
224
225
    second "from_other" Boolean argument.  This is a backward
    incompatibility only for code that overrides this function in a
    subclass.  For backward compatibility with programs that simply
    call this function with two argument, a non-virtual version of the
    function has been introduced and marked as deprecated.

226
227
228
229
230
  - The spot::acc_cond::format() methods have been deprecated.  These
    were used to display acceptance marks, but acceptance marks are
    unrelated to acceptance conditions, so it's better to simply print
    marks with operator<< without this extra step.

231
232
  Bugs fixed:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
233
  - The gf_guarantee_to_ba() is relying on an in-place algorithm that
234
235
236
    could produce a different number of edges for the same input in
    two different transition order.

237
238
239
240
241
  - A symmetry-based optimization of the LAR algorithm performed in
    spot::to_parity() turned out to be incorrect.  The optimization
    has been removed.  "ltlsynt --algo=lar" is the only code using
    this function currently.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
242
New in spot 2.7.5 (2019-06-05)
243

244
245
246
  Build:

  - Although the Python bindings in this release are still done with
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
247
    Swig3.0, the code has been updated to be compatible with Swig4.0.
248

249
250
251
252
253
254
  Library:

  - print_dot will replace labels that have more 2048 characters by a
    "(label too long)" string.  This works around a limitation of
    GraphViz that aborts when some label exceeds 16k characters, and
    also helps making large automata more readable.
255

256
257
  Bugs fixed:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
258
  - spot::translator was not applying Boolean sub-formula rewriting
259
    by default unless a spot::option_map was passed.  This caused some
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
260
    C++ code for translating certain formulas to be noticeably slower
261
262
    than the equivalent call to the ltl2tgba binary.

263
264
265
266
  - The remove_ap algorithm was preserving the "terminal property" of
    automata, but it is possible that a non-terminal input produces a
    terminal output after some propositions are removed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
267
New in spot 2.7.4 (2019-04-27)
268

269
270
271
272
273
  Bugs fixed:

  - separate_sets_here() (and therefore autfilt --separate-sets) could
    loop infinitely on some inputs.

274
275
276
277
278
  - In some situation, ltl2tgba -G could abort with
    "direct_simulation() requires separate Inf and Fin sets".  This
    was fixed by teaching simulation-based reductions how to deal
    with such cases.

279
280
281
282
  - The code for detecting syntactically stutter-invariant PSL
    formulas was incorrectly handling the ";" operator, causing some
    stutter-sensitive formulas to be flagged a stutter-invariant.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
283
New in spot 2.7.3 (2019-04-19)
284

285
286
287
288
289
290
  Bugs fixed:

  - When processing CSV files with MSDOS-style \r\n line endings,
    --stats would output the \r as part of the %> sequence instead
    of ignoring it.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
291
  - Fix serious typo in remove_alternation() causing incorrect
292
293
    output for some VWAA.  Bug introduced in Spot 2.6.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
294
295
296
297
  Documentation:

  - Multiple typos and minor updates.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
298
299
300
301
302
303
304
New in spot 2.7.2 (2019-03-17)

  Python:

  - Improved support for explicit Kripke structures.  It is now
    possible to iterate over a kripke_graph object in a way similar to
    twa_graph.
305

306
307
308
309
  Documentation:

  - A new page shows how to create explicit Kripke structures in C++
    and Python.  See https://spot.lrde.epita.fr/tut52.html
310
311
312
  - Another new page shows how to deal with LTLf formulas (i.e., LTL
    with finite semantics) and how to translate those.
    See https://spot.lrde.epita.fr/tut12.html
313

314
315
316
317
318
  Build:

  - Work around a spurious null dereference warning when compiling
    with --coverage and g++ 8.3.0-3 from Debian unstable.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
319
New in spot 2.7.1 (2019-02-14)
320

321
  Build:
322

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
323
  - Work around GCC bug #89303 that causes memory leaks and std::weak_bad_ptr
324
    exceptions when Spot is compiled with the version of g++ 8.2 currently
325
    distributed by Debian unstable (starting with g++ 8.2.0-15).
326

327
328
329
  Python:

  - The following methods of spot::bdd_dict are now usable in Python when
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
330
    fine control over the lifetime of associations between BDD variables
331
332
333
334
335
336
337
    and atomic propositions is needed.
    - register_proposition(formula, for_me)
    - register_anonymous_variables(count, for_me)
    - register_all_propositions_of(other, for_me)
    - unregister_all_my_variables(for_me)
    - unregister_variable(var, for_me)

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
338
339
  - Better support for explicit Kripke structures:
    - the kripke_graph type now has Python bindings
340
341
342
343
344
345
346
347
348
    - spot.automaton() and spot.automata() now support a want_kripke=True
      to return a kripke_graph
      See the bottom of https://spot.lrde.epita.fr/ipynb/ltsmin-dve.html
      for some examples.

  Library:

  - Printing Kripke structures via print_hoa() will save state names.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
349
350
  - kripke_graph_ptr objects now honor any "state-names" property
    when formatting states.
351

352
353
354
355
356
  Bugs fixed:

  - The print_dot_psl() function would incorrectly number all but the
    first children of commutative n-ary operators: in this case no
    numbering was expected.
357

358
359
360
361
  - std::out_of_range C++ exceptions raised from Python code are now
    converted into IndexError Python exceptions (instead of aborting
    the program).

362
363
364
365
  - The LTL parser would choke on carriage returns when command-line
    tools such as ltlfilt, ltlcross, or ltl2tgba were run on files of
    formulas with MS-DOS line endings.

366
367
368
  - The core translation for unambiguous automata was incorrectly
    tagging some non-weak automata as weak.

369
370
  - The product_susp() function used to multiply an automaton with a
    suspendable automaton could incorrectly build transition-based
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
371
    automata when multiplying two state-based automata.  This caused
372
    ltl2tgba to emit error messages such as: "automaton has
373
    transition-based acceptance despite prop_state_acc()==true".
374

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
375
New in spot 2.7 (2018-12-11)
376

377
378
379
380
381
382
383
384
  Command-line tools:

  - ltlsynt now has three algorithms for synthesis:
    --algo=sd     is the historical one. The automaton of the formula
                  is split to separate inputs and outputs, then
                  determinized (with Safra construction).
    --algo=ds     the automaton of the formula is determinized (Safra),
                  then split to separate inputs and outputs.
385
    --algo=lar    translate the formula to a deterministic automaton
386
387
388
389
390
391
                  with an arbitrary acceptance condition, then turn it
                  into a parity automaton using LAR, and split it.
    In all three cases, the obtained parity game is solved using
    Zielonka algorithm. Calude's quasi-polynomial time algorithm has
    been dropped as it was not used.

392
393
  - ltlfilt learned --liveness to match formulas representing liveness
    properties.
394

395
396
397
398
399
  - the --stats= option of tools producing automata learned how to
    tell if an automaton uses universal branching (%u), or more
    precisely how many states (%[s]u) or edges (%[e]u) use universal
    branching.

400
401
402
403
404
405
406
407
408
409
  Python:

  - spot.translate() and spot.postprocess() now take an xargs=
    argument similar to the -x option of ltl2tgba and autfilt, making
    it easier to fine tune these operations.  For instance
        ltl2tgba 'GF(a <-> XXa)' --det -x gf-guarantee=0
    would be written in Python as
        spot.translate('GF(a <-> XXa)', 'det', xargs='gf-guarantee=0')
    (Note: those extra options are documented in the spot-x(7) man page.)

410
411
412
413
  - spot.is_generalized_rabin() and spot.is_generalized_streett() now return
    a tuple (b, v) where b is a Boolean, and v is the vector of the sizes
    of each generalized pair.  This is a backward incompatible change.

414
415
  Library:

416
417
418
419
420
421
422
423
424
425
426
427
428
  - The LTL parser learned syntactic sugar for nested ranges of X
    using the X[n], F[n:m], and G[n:m] syntax of TSLF.  (These
    correspond to the next!, next_e!, and next_a! operators of PSL,
    but we do not support those under these names currently.)

      X[6]a = XXXXXXa
      F[2:4]a = XX(a | X(a | Xa))
      G[2:4]a = XX(a & X(a & Xa))

    The corresponding constructors (for C++ and Python) are
      formula::X(unsigned, formula)
      formula::F(unsigned, unsigned, formula)
      formula::G(unsigned, unsigned, formula)
429

430
431
432
433
434
435
436
437
438
439
  - spot::unabbreviate(), used to rewrite away operators such as M or
    W, learned to use some shorter rewritings when an argument (e) is
    a pure eventuality or (u) is purely universal:

      Fe = e
      Gu = u
      f R u = u
      f M e = F(f & e)
      f W u = G(f | u)

440
441
442
443
444
  - The twa_graph class has a new dump_storage_as_dot() method
    to show its data structure.  This is more conveniently used
    as aut.show_storage() in a Jupyter notebook.  See
    https://spot.lrde.epita.fr/ipynb/twagraph-internals.html

445
446
447
448
  - spot::generic_emptiness_check() is a new function that performs
    emptiness checks of twa_graph_ptr (i.e., automata not built
    on-the-fly) with an *arbitrary* acceptance condition.  Its sister
    spot::generic_emptiness_check_scc() can be used to decide the
449
450
451
    emptiness of an SCC.  This is now used by
    twa_graph_ptr::is_empty(), twa_graph_ptr::intersects(), and
    scc_info::determine_unknown_acceptance().
452

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
453
454
455
456
  - The new function spot::to_parity() translates an automaton with
    arbitrary acceptance condition into a parity automaton, based on a
    last-appearance record (LAR) construction.  (It is used by ltlsynt
    but not yet by autfilt or ltl2tgba.)
457

458
459
460
461
  - The new function is_liveness() and is_liveness_automaton() can be
    used to check whether a formula or an automaton represents a
    liveness property.

462
463
464
465
  - Two new functions count_univbranch_states() and
    count_univbranch_edges() can help measuring the amount of
    universal branching in alternating automata.

466
467
  Bugs fixed:

468
469
470
471
  - translate() would incorrectly mark as stutter-invariant
    some automata produced from formulas of the form X(f...)
    where f... is syntactically stutter-invariant.

472
473
  - acc_cond::is_generalized_rabin() and
    acc_cond::is_generalized_streett() did not recognize the cases
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
474
    where a single generalized pair is used.
475

476
  - The pair of acc_cond::mark_t returned by
477
478
479
    acc_code::used_inf_fin_sets(), and the pair (bool,
    vector_rs_pairs) by acc_cond::is_rabin_like() and
    acc_cond::is_streett_like() were not usable in Python.
480

481
482
483
484
485
486
487
488
489
490
491
492
493
494
  - Many object types had __repr__() methods that would return the
    same string as __str__(), contrary to Python usage where repr(x)
    should try to show how to rebuild x.  The following types have
    been changed to follow this convention:
       spot.acc_code
       spot.acc_cond
       spot.atomic_prop_set
       spot.formula
       spot.mark_t
       spot.twa_run (__repr__ shows type and address)
       spot.twa_word (likewise, but _repr_latex_ used in notebooks)

    Note that this you were relying on the fact that Jupyter calls
    repr() to display returned values, you may want to call print()
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
495
    explicitly if you prefer the old representation.
496

497
498
499
  - Fix compilation under Cygwin and Alpine Linux, both choking
    on undefined secure_getenv().

500
New in spot 2.6.3 (2018-10-17)
501

502
503
504
505
506
507
508
  Bugs fixed:

  - Running "ltl2tgba -B" on formulas of the type FG(safety) would
    unexpectedly use a co-Büchi automaton as an intermediate step.
    This in turn caused "ltl2tgba -U -B" to not produce unambiguous
    automata.

509
510
511
  - ltl2tgba --low now disables the "gf-guarantee" feature, as
    documented.

512
513
514
  - ltlfilt's --accept-word and --reject-word options were ignored
    unless used together.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
515
New in spot 2.6.2 (2018-09-28)
516

517
518
519
520
521
  Build:

  - We no longer distribute the Python-based CGI script + javascript
    code for the online translator.  Its replacement has its own
    repository: https://gitlab.lrde.epita.fr/spot/spot-web-app/
522

523
524
525
526
527
528
529
530
  Library:

  - When states are highlighted with more than 8 colors, print_dot()
    will add some extra markers to help distinguishing the colors.
    This helps with the fact that colors 8-15 are lighter versions of
    colors 0-7, and that higher color numbers cycle into this 16-color
    palette.

531
532
533
534
535
536
  Bugs fixed:

  - exclusive_ap::constrain() (called by autfilt --exclusive-ap=...)
    would incorrectly copy the "universal" property of the input
    automaton, causing print_hoa() to fail.

537
538
  - configure --disable-doxygen would actually enable it.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
539
  - Fix several warnings emitted by the development version of GCC.
540

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
541
New in spot 2.6.1  (2018-08-04)
542

543
544
545
546
  Command-line tools:

  - "ltlfilt --suspendable" is now a synonym for
    "ltlfilt --universal --eventual".
547

548
549
550
551
552
  Bugs fixed:

  - scc_info::split_on_sets() did not correctly register the
    atomic propositions of the returned automata.

553
554
555
  - The spot::tl_simplifier class could raise an exception while
    attempting to reduce formulas containing unsimplified <->, -> or
    xor, if options nenoform_stop_on_boolean and synt_impl are both
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
556
    set.  (This combination of options is not available from
557
558
    command-line tools.)

559
  - The spot::contains(a, b) function introduced in 2.6 was testing
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
560
    a⊆b instead of a⊇b as one would expect.  Unfortunately the
561
    documentation was also matching the code, so this is a backward
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
562
    incompatible change, but a short-lived one.
563

564
565
566
567
  - The Python binding of the getter of spot::parsed_formula::f was
    returning a reference instead of a copy, causing issues if the
    reference outlasted the parsed_formula struct.

568

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
569
New in spot 2.6  (2018-07-04)
570

571
572
  Command-line tools:

573
574
575
  - autfilt learned --is-colored to filter automata that use
    exactly one acceptance set per mark or transition.

576
577
578
579
  - autfilt learned --has-univ-branching and --has-exist-branching
    to keep automata that have universal branching, or that make
    non-deterministic choices.

580
581
582
583
584
585
586
  - autcross' tool specifications now have %M replaced by the name of
    the input automaton.

  - autcross now aborts if there is any parser diagnostic for the
    input automata (previous versions would use the input automaton
    whenever the parser would manage to read something).

587
588
589
  - ltlcross, ltldo, and autcross learned shorthands to call
    delag, ltl2dra, ltl2dgra, and nba2dpa.

590
591
592
593
  - When autfilt is asked to build a Büchi automaton from
    of a chain of many products, as in
    "autfilt -B --product 1.hoa ... --product n.hoa in.hoa"
    then it will automatically degeneralize the intermediate
594
    products to avoid exceeding the number of supported
595
596
    acceptance sets.

597
598
599
  - genltl learned to generate six new families of LTL formulas:
      --gf-equiv-xn=RANGE    GF(a <-> X^n(a))
      --gf-implies-xn=RANGE  GF(a -> X^n(a))
600
601
      --sejk-f=RANGE[,RANGE] f(0,j)=(GFa0 U X^j(b)), f(i,j)=(GFai U
                             G(f(i-1,j)))
602
603
604
605
606
      --sejk-j=RANGE         (GFa1&...&GFan) -> (GFb1&...&GFbn)
      --sejk-k=RANGE         (GFa1|FGb1)&...&(GFan|FGbn)
      --sejk-patterns[=RANGE]   φ₁,φ₂,φ₃ from Sikert et al's [CAV'16]
                             paper (range should be included in 1..3)

607
608
609
  - genltl --ms-example can now take a two-range argument,
    (as --sejk-f above).

610
611
612
613
  Build:

  - ./configure --enable-max-accsets=N let you specify a maximum
    number of acceptance sets that Spot should support.  The default
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
614
    is still 32, but this limit is no longer hard-coded.  Larger values
615
616
    will cost additional memory and time.

617
618
619
  - We know distribute RPM packages for Fedora 28.  See
    file:///home/adl/git/spot/doc/userdoc/install.html#Fedora

Maximilien Colange's avatar
Maximilien Colange committed
620
621
  Library:

622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
  - The PSL/LTL simplification routine learned the following:

      q R Xf = X(q R f)  if q is suspendable
      q U Xf = X(q U f)  if q is suspendable
      {SERE;1} = {1}     if {SERE} accepts [*0]
      {SERE;1} = {SERE}  if {SERE} does not accept [*0]

  - gf_guarantee_to_ba() is a specialized construction for translating
    formulas of the form GF(guarantee) to BA or DBA, and
    fg_safety_to_dca() is a specialized construction for translating
    formulas of the form FG(safety) to DCA.  These are generalizations
    of some constructions proposed by J. Esparza, J. Křentínský, and
    S. Sickert (LICS'18).

    These are now used by the main translation routine, and can be
    disabled by passing -x '!gf-guarantee' to ltl2tgba.  For example,
638
639
640
    here are the size of deterministic transition-based generalized
    Büchi automata constructed from four GF(guarantee) formulas with
    two versions of Spot, and converted to other types of
641
642
    deterministic automata by other tools distributed with Owl 18.06.
    "x(y)" means x states and y acceptance sets.
643

644
                               ltl2tgba -D  delag ltl2dra
645
                                2.5   2.6   18.06  18.06
646
    -------------------------  -----------  -------------
647
648
649
650
651
652
    GF(a <-> XXa)               9(1)  4(1)   4(2)   9(4)
    GF(a <-> XXXa)             27(1)  8(1)   8(2)  25(4)
    GF(((a & Xb) | XXc) & Xd)   6(1)  4(1)  16(1)   5(2)
    GF((b | Fa) & (b R Xb))     6(2)  2(1)   3(4)   3(4)

    Note that in the above the automata produced by 'ltl2tgba -D' in
653
    version 2.5 were not deterministic (because -D is only a
654
    preference).  They are deterministic in 2.6 and other tools.
655

656
657
658
659
660
661
662
663
664
665
  - spot::product() and spot::product_or() learned to produce an
    automaton with a simpler acceptance condition if one of the
    argument is a weak automaton.  In this case the resulting
    acceptance condition is (usually) that of the other argument.

  - spot::product_susp() and spot::product_or_susp() are new
    functions for building products between an automaton A and
    a "suspendable" automaton B.  They are also optimized for
    the case that A is weak.

666
667
668
669
670
671
672
  - When 'generic' acceptance is enabled, the translation routine will
    split the input formula on Boolean operators into components that
    are syntactically 'obligation', 'suspendable', or 'something
    else'.  Those will be translated separately and combined with
    product()/product_susp().  This is inspired by the ways things are
    done in ltl2dstar or delag, and can be disabled by passing option
    -xltl-split=0, as in ltl2tgba -G -D -xltl-split=0.  Here are the
673
    sizes of deterministic automata (except for ltl3tela which produces
674
675
676
677
    non-deterministic automata) produced with generic acceptance
    using two versions of ltl2tgba and other tools for reference.

                                             ltl2tgba -DG  delag  ltl3tela
678
                                              2.5    2.6   18.06    1.1.2
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
                                             ------------ ------- --------
    FGa0&GFb0                                 2(2)   1(2)   1(2)    1(2)
    (FGa1&GFb1)|FGa0|GFb0                    16(6)   1(4)   1(4)    1(9)
    (FGa2&GFb2)|((FGa1|GFb1)&FGa0&GFb0)      29(8)   1(6)   1(6)    3(11)
    FGa0|GFb0                                 5(4)   1(2)   1(2)    1(5)
    (FGa1|GFb1)&FGa0&GFb0                     8(4)   1(4)   1(4)    1(7)
    (FGa2|GFb2)&((FGa1&GFb1)|FGa0|GFb0)     497(14)  1(6)   1(6)    1(14)
    GFa1 <-> GFz                              4(6)   1(3)   1(4)    1(7)
    (GFa1 & GFa2) <-> GFz                     8(4)   1(3)   1(6)    3(10)
    (GFa1 & GFa2 & GFa3) <-> GFz             21(4)   1(4)   1(8)    3(13)
    GFa1 -> GFz                               5(4)   1(2)   1(2)    1(5)
    (GFa1 & GFa2) -> GFz                     12(4)   1(3)   1(3)    1(6)
    (GFa1 & GFa2 & GFa3) -> GFz              41(4)   1(4)   1(4)    1(7)
    FG(a|b)|FG(!a|Xb)                         4(2)   2(2)   2(2)    2(3)
    FG(a|b)|FG(!a|Xb)|FG(a|XXb)              21(2)   4(3)   4(3)    4(4)
    FG(a|b)|FG(!a|Xb)|FG(a|XXb)|FG(!a|XXXb) 170(2)   8(4)   8(4)    8(5)

  - For 'parity' output, the 'ltl-split' optimization just separates
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
697
    obligation sub-formulas from the rest, where a determinization is
698
    still performed.
699
700
701
702
703
704
                                 ltl2tgba -DP  ltl3dra  ltl2dpa
                                   2.5   2.6    0.2.3    18.06
                                -------------- -------  -------
    FGp0 & (Gp1 | XFp2)           6(2)  4(1)     4(1)     4(2)
    G!p0 | F(p0 & (!p1 W p2))     5(2)  4(2)     n/a      5(2)
    (p0 W XXGp0) & GFp1 & FGp2    6(2)  5(2)     n/a      6(3)
705
706
707
708

    (The above just show a few cases that were improved.  There are
    many cases where ltl2dpa still produces smaller automata.)

709
710
  - The automaton postprocessor will now simplify acceptance
    conditions more aggressively, calling spot::simplify_acceptance()
711
    or spot::cleanup_acceptance() depending on the optimization level.
712

713
714
  - print_dot(), used to print automata in GraphViz's format,
    underwent several changes:
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742

    * option "a", for printing the acceptance condition, is now
      enabled by default.  Option "A", introduced in Spot 2.4, can be
      used to hide the acceptance condition in case you do not want
      it.  This change of course affects the --dot option of all the
      command-line tools, as well as the various way to display
      automata using the Python bindings.

    * when option "1" is used to hide state names and force the
      display of state numbers, the actual state names is now moved to
      the "tooltip" field of the state.  The SVG files produced by
      "dot -Tsvg" will show those as popups.  This is also done for
      state labels of Kripke structures.

    * the output digraph is now named using the name of the automaton
      if available, or the empty string otherwise.  (Previous versions
      used to call all digraphs "G".)  This name appears as a tooltip
      in SVG figures when the mouse is over the acceptance condition.

    * a new option "u" hides "true states" behind "exiting
      transitions".  This can be used to display alternating automata
      in a way many people expect.

    * a new option "K" cancels the effect of "k" (which uses state
      labels whenever possible).  This is most useful when one want to
      force transition-labeling of a Kripke structure, where "k" is
      usually the default.

743
  - spot::twa_graph::merge_states() is a new method that merges states
744
745
746
    with the exact same outgoing edges. As it performs no reordering
    of the edges, it is better to call it when you know that the edges
    in the twa_graph are sorted (e.g. after a call to merge_edges()).
747

748
749
750
  - spot::twa_graph::purge_unreachable_states() now takes a function
    which is called with the new numbering of states. This is useful
    to update an external structure that references states of the twa
751
752
    that we want to purge.

753
754
755
756
757
758
  - spot::scc_filter() now automatically turns automata marked as
    inherently-weak into weak automata with state-based acceptance.
    The acceptance condition is set to Büchi unless the input had
    co-Büchi or t acceptance.  spot::scc_filter_states() will pass
    inherently-weak automata to spot::scc_filter().

759
760
761
  - spot::cleanup_parity() and spot::cleanup_parity_here() are smarter
    and now remove from the acceptance condition the parity colors
    that are not used in the automaton.
762

763
  - spot::contains() and spot::are_equivalent() can be used to
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
764
    check language containment between two automata or formulas.
765
    They are most welcome in Python, since we used to redefine
766
767
768
769
770
771
772
773
    them every now and them.  Some examples are shown in
    https://spot.lrde.epita.fr/ipynb/contains.html

  - aut1->exclusive_word(aut2) is a new method that returns a word
    accepted by aut1 or aut2 but not both.  The exclusive_run()
    variant will return.  This is useful when comparing automata and
    looking for differences.  See also
    https://spot.lrde.epita.fr/ipynb/contains.html
774

775
  - spot::complement_semidet(aut) is a new function that returns the
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
776
    complement of aut, where aut is a semi-deterministic automaton. The
777
778
779
780
    function uses the NCSB complementation algorithm proposed by
    F. Blahoudek, M. Heizmann, S. Schewe, J. Strejček, and MH. Tsai
    (TACAS'16).

781
782
783
784
785
  - spot::remove_alternation() was slightly improved on very-weak
    alternating automata: the labeling of the outgoing transitions in
    the resulting TGBA makes it more likely that simulation-based
    reductions will reduce it.

786
787
788
  - When applied to automata that are not WDBA-realizable,
    spot::minimize_wdba() was changed to produce an automaton
    recognizing a language that includes the original one.  As a
789
    consequence spot::minimize_obligation() and
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
790
    spot::is_wdba_realizable() now only need one containment check
791
    instead of two.
792

793
794
795
796
797
  - Slightly improved log output for the SAT-based minimization
    functions.  The CSV log files now include an additional column
    with the size of the reference automaton, and they now have a
    header line.  These log files give more details and are more
    accurate in the case of incremental SAT-solving.
798

799
800
801
  Python:

  - New spot.jupyter package.  This currently contains a function for
802
803
804
    displaying several arguments side by side in a Jupyter notebook.
    See https://spot.lrde.epita.fr/ipynb/alternation.html for some
    examples.
805

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
806
  - Strings are now implicitly converted into formulas when passed
807
808
809
    as arguments to functions that expect formulas.  Previously this
    was done only for a few functions.

810
811
812
813
  - The Python bindings for sat_minimize() now have display_log and
    return_log options; these are demonstrated on the new
    https://spot.lrde.epita.fr/ipynb/satmin.html page.

814
815
  Bugs fixed:

816
817
  - Python *.py and *.so files are now always installed into the same
    directory.  This was an issue on systems like Fedora that separate
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
818
    platform-specific packages from non-platform-specific ones.
819

820
821
822
  - print_dot() will correctly escape strings containing \n in HTML
    mode.

823
824
825
  - The HOA parser will now accept Alias: declarations that occur
    before AP:.

826
827
828
829
  - The option --allow-dups of randltl now works properly.

  - Converting generalized-co-Büchi to Streett using dnf_to_nca()
    could produce bogus automata if the input had rejecting SCCs.
830

831
  Deprecation notices:
832
833
834
835

  - The type spot::acc_cond::mark_t has been overhauled and uses
    a custom bit-vector to represent acceptance sets instead of
    storing everything in a "unsigned int".  This change is
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
836
    to accommodate configure's --enable-max-accsets=N option and
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
    has several effect:

    * The following shortcuts are deprecated:
        acc_cond::mark_t m1 = 0U;
        acc_cond::mark_t m2 = -1U;
      instead, use:
        acc_cond::mark_t m1 = {};
        acc_cond::mark_t m2 = acc_cond::mark_t::all();

    * acc_cond::mark_t::value_t is deprecated.  It is now only
      defined when --enable-max-accsets=32 (the default) and
      equal to "unsigned" for backward compatibility reasons.

  Backward incompatibilities:

  - Functions spot::parity_product() and spot::parity_product_or()
    were removed.  The code was unused, hard to maintain, and bogus.

  - The output of print_dot() now include the acceptance condition.
    Add option "A" (supported since version 2.4) to cancel that.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
858
  - Because genltl now supports LTL pattern with two arguments, using
859
860
861
862
863
864
    --format=%L may output two comma-separated integer.  This is an
    issue if you used to produce CSV files using for instance:
      genltl --format='%F,%L,%f' ...
    Make sure to quote %L to protect the potential commas:
      genltl --format='%F,"%L",%f' ...

865
866
867
868
869
870
871
  - In Spot 2.5 and prior running "ltl2tgba --generic --det" on some
    formula would attempt to translate it as deterministic TGBA or
    determinize it into an automaton with parity acceptance.  Version
    2.5 introduced --parity to force parity acceptance on the output.
    This version finally gives --generic some more natural semantics:
    any acceptance condition can be used.

872

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
873
New in spot 2.5.3 (2018-04-20)
874

875
876
877
878
879
  Bugs fixed:

  - "autfilt --cobuchi --small/--det" would turn a transition-based
    co-Büchi automaton into a state-based co-Büchi.

880
881
882
  - Fix cryptic error message from Python's spot.translate() and
    spot.postprocess() when supplying conflicting arguments.

883
884
885
  - "autfilt -B --sat-minimize" was incorrectly producing
    transition-based automata.

886
887
888
  - Using spot.automata("cmd...|") to read just a few automata out of
    an infinite stream would not properly terminate the command.

889
890
891
  - The is_unambiguous() check (rewritten in Spot 2.2) could mark some
    unambiguous automata as ambiguous.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
892
New in spot 2.5.2 (2018-03-25)
893

894
895
896
897
898
899
  Bugs fixed:

  - acc_cond::is_generalized_rabin() and
    acc_cond::is_generalized_streett() would segfault on weird
    acceptance conditions such as "3 t" or "3 f".

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
900
  - remove_fin() and streett_to_generalized_buchi() should never
901
902
    return automata with "f" acceptance.

903
904
905
  - "autfilt --acceptance-is=Fin-less" no longer accept automata
    with "f" acceptance.

906
907
908
  - twa_run methods will now diagnose cases where the cycle is
    unexpectedly empty instead of segfaulting.

909
910
911
912
913
914
915
916
  - spot::closure(), used by default for testing stutter-invariance,
    was using an optimization incorrect if the acceptance condition
    had some Fin(x).  Consequently stutter-invariance tests for
    automata, for instance with "autfilt --is-stutter-invariant",
    could be to be wrong (even if the input does not use Fin(x), its
    complement, used in the stutter-invariance test likely will).
    Stutter-invariance checks of LTL formulas are not affected.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
917
New in spot 2.5.1 (2018-02-20)
918

Maximilien Colange's avatar
Maximilien Colange committed
919
920
921
922
  Library:

  - iar() and iar_maybe() now also handle Streett-like conditions.

923
924
  Bugs fixed:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
925
926
  - iar() and iar_maybe() properly handle Rabin-like conditions.

927
928
929
  - streett_to_generalized_buchi() could produce incorrect result on
    Streett-like input with acceptance like (Inf(0)|Fin(1))&Fin(1)
    where some Fin(x) is used both with and without a paired Fin(y).
930

931
932
  - is_generalized_rabin() had a typo that caused some non-simplified
    acceptance conditions like Fin(0)|(Fin(0)&Inf(1)) to be
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
933
    incorrectly detected as generalized-Rabin 2 0 1 and then output
934
935
936
    as Fin(0)|(Fin(1)&Inf(2)) instead.  Likewise for
    is_generalized_streett

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
937
938
939
940
  - the conversion from Rabin to Büchi was broken on Rabin-like
    acceptance condition where one pair used Fin(x) and another pair
    used Inf(x) with the same x.  Unfortunately, this situation could
    also occur as a side effect of simplifying the acceptance
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
941
942
    condition (by merging identical set) of some automaton prior to
    converting it to Büchi.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
943

944
945
  - dnf_to_dca() was mishandling some Rabin-like input.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
946
New in spot 2.5 (2018-01-20)
947

948
949
  Build:

Maximilien Colange's avatar
Maximilien Colange committed
950
  - We no longer distribute the doxygen-generated documentation in
951
952
953
954
955
    the tarball of Spot to save space.  This documentation is still
    available online at https://spot.lrde.epita.fr/doxygen/.  If you
    want to build a local copy you can configure Spot with
    --enable-doxygen, or simply run "cd doc && make doc".

956
957
958
  - All the images that illustrate the documentation have been
    converted to SVG, to save space and improve quality.

959
960
  Tools:

961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
  - ltlsynt is a new tool for synthesizing a controller from LTL/PSL
    specifications.

  - ltlcross learned --reference=COMMANDFMT to specify a translator
    that should be trusted.  Doing so makes it possible to reduce the
    number of tests to be performed, as all other translators will be
    compared to the reference's output when available.  Multiple
    reference can be given; in that case other tools are compared
    against the smallest reference automaton.

  - autcross, ltlcross, and ltldo learned --fail-on-timeout.

  - ltl2tgba, autfilt, and dstar2tgba have some new '--parity' and
    '--colored-parity' options to force parity acceptance on the
    output.  Different styles can be requested using for instance
    --parity='min odd' or --parity='max even'.

978
979
980
  - ltl2tgba, autfilt, and dstar2tgba have some new '--cobuchi' option
    to force co-Büchi acceptance on the output.  Beware: if the input
    language is not co-Büchi realizable the output automaton will
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
981
982
    recognize a superset of the input.  Currently, the output is
    always state-based.
983

984
985
986
  - genltl learned to generate six new families of formulas, taken from
    the SYNTCOMP competition on reactive synthesis, and from from
    Müller & Sickert's GandALF'17 paper:
987
988
    --gf-equiv=RANGE       (GFa1 & GFa2 & ... & GFan) <-> GFz
    --gf-implies=RANGE     (GFa1 & GFa2 & ... & GFan) -> GFz
989
990
991
992
    --ms-example=RANGE     GF(a1&X(a2&X(a3&...)))&F(b1&F(b2&F(b3&...)))
    --ms-phi-h=RANGE       FG(a|b)|FG(!a|Xb)|FG(a|XXb)|FG(!a|XXXb)|...
    --ms-phi-r=RANGE       (FGa{n}&GFb{n})|((FGa{n-1}|GFb{n-1})&(...))
    --ms-phi-s=RANGE       (FGa{n}|GFb{n})&((FGa{n-1}&GFb{n-1})|(...))
993

994
995
  - autfilt learned --streett-like to convert automata with DNF
    acceptance into automata with Streett-like acceptance.
996

997
998
999
1000
  - autfilt learned --acceptance-is=ACC to filter automata by
    acceptance condition.  ACC can be the name of some acceptance
    class (e.g. Büchi, Fin-less, Streett-like) or a precise acceptance
    formula in the HOA syntax.
For faster browsing, not all history is shown. View entire blame