NEWS 225 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
New in spot 2.8.7 (2019-03-13)
2

3 4 5
  Bugs fixed:

  - Building a product between two complete automata where one operand
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
6
    had false acceptance could create an incomplete automaton
7 8 9
    incorrectly tagged as complete, causing the print_hoa() function
    to raise an exception.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
10 11 12
  - autfilt --uniq was not considering differences in acceptance
    conditions or number of states when discarding automata.

13 14 15 16 17 18
  - In an automaton with acceptance condition containing some Fin, and
    whose accepting cycle could be reduced to a self-loop in an
    otherwise larger SCC, the generation of an accepting run could be
    wrong.  This could in turn cause segfaults or infinite loops while
    running autcross or autfilt --stats=%w.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
19 20 21 22 23 24 25 26 27 28 29 30
  - The generic emptiness check used a suboptimal selection of "Fin"
    to remove, not matching the correct line in our ATVA'19 paper.
    This could cause superfluous recursive calls, however benchmarks
    have shown the difference to be insignificant in practice.

  - The sl(), and sl2() functions for computing the "self-loopization"
    of an automaton, and used for instance in algorithms for computing
    proof of stutter-sensitiveness (e.g., in our web application),
    were incorrect when applied on automata with "t" acceptance (or
    more generaly, any automaton where a cycle without mark is
    accepting).

31 32 33
  - ltlcross was not diagnosing write errors associated to
    options --grind=FILENAME and --save-bogus=FILENAME.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
34
New in spot 2.8.6 (2020-02-19)
35

36 37
  Bugs fixed:

38 39 40 41
  - calling spot.translate() with two conflicting preferences like
    spot.translate(..., 'det', 'any') triggered a syntax error in the
    Python code to handle this error.

42 43 44 45
  - degeneralize_tba() was incorrectly not honnoring the "skip_level"
    optimization after creating an accepting transition; as a
    consequence, some correct output could be larger than necessary
    (but still correct).
46

47 48 49
  - Some formulas with Boolean sub-formulas equivalent to true or
    false could be translated into automata with false labels.

50 51 52 53
  - The HOA printer would incorrectly output the condition such
    'Fin(1) & Inf(2) & Fin(0)' as 'Fin(0) | Fin(1) & Inf(2)'
    due to a bug in the is_generalized_rabin() matching function.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
54
New in spot 2.8.5 (2020-01-04)
55

56 57 58 59
  Bugs fixed:

  - ltl2tgba -B could return automata with "t" acceptance, instead
    of the expected Inf(0).
60

61 62 63 64 65 66 67 68 69
  - twa_graph::merge_edges() (a.k.a. autfilt --merge-transitions) was
    unaware that merging edges can sometimes transform a
    non-deterministic automaton into a deterministic one, causing the
    following unexpected diagnostic:
    "print_hoa(): automaton is universal despite prop_universal()==false"
    The kind of non-deterministic automata where this occurs is not
    naturally produced by any Spot algorithm, but can be found for
    instance in automata produced by Goal 2015-10-18.

70
New in spot 2.8.4 (2019-12-08)
71

72 73 74 75 76 77 78 79
  Bugs fixed:

  - The Rabin-to-Büchi conversion could misbehave when applied to
    Rabin-like acceptance with where some pairs have missing Inf(.)
    (e.g. Fin(0)|(Inf(1)&Fin(2))) and when some of the SCCs do not
    visit the remaining Inf(.).  This indirectly caused the
    complementation algorithm to produce incorrect results on such
    inputs, causing false positives in ltlcross and autcross.
80

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
81 82 83
  - Work around a small difference between Python 3.7 and 3.8, causing
    spurious failures of the test suite.

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
86 87 88
  Build:

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

90 91 92 93 94 95
  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
96 97 98
  - Work around GraphViz bug #1605 in Jupyter notebooks.
    https://gitlab.com/graphviz/graphviz/issues/1605

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

101 102 103 104
  Command-line tools:

  - ltl2tgba and ltldo learned a --negate option.

105 106 107 108 109
  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".
110

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
111 112 113 114
  - The numbering of nodes in the AIGER output of ltlsynt was
    architecture dependent.

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

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

119 120 121 122
  Command-line tools:

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

123 124 125 126 127 128
  - 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.

129 130 131 132 133 134 135
  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".
136

137 138 139 140
  - 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
141
New in spot 2.8 (2019-07-10)
142

143 144 145 146 147
  Command-line tools:

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

148 149 150
  - ltldo, ltlcross, and autcross are now preferring posix_spawn()
    over fork()+exec() when available.

151 152 153 154 155 156 157 158 159
  - 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
160
  - ltlcross will now skip unnecessary cross-checks and
161 162 163
    consistency-checks (they are unnecessary when all automata
    could be complemented and statistics were not required).

164
  - genaut learned --m-nba=N to generate Max Michel's NBA family.
165 166
    (NBAs with N+1 states whose determinized have at least N! states.)

167 168 169
  - 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
170
    among "Inf(0)", "t", or "f", and persistence properties have an
171 172
    acceptance condition among "Fin(0)", "t", or "f".

173
  - ltldo and ltlcross learned shorthands to call the tools ltl2na,
174 175
    ltl2nba, and ltl2ngba from Owl 19.06.  Similarly, autcross learned
    a shorthand for Owl's dra2dpa.
176

177 178 179
  Documentation:

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

182 183 184 185 186
  Library:

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

187 188
  - twa::accepting_run() and twa::intersecting_run() now work on
    automata using Fin in their acceptance condition.
189

190 191 192 193 194 195 196
  - 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.)

197 198
  - simulation-based reductions has learned another trick to better
    merge states from transient SCCs.
199

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

204 205 206 207 208
  - 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.)

209
  - There is a new spot::scc_and_mark_filter object that simplifies the
210 211 212 213 214
    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
215 216 217 218
  - 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.

219 220 221 222
  - 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.
223

224 225 226 227 228 229 230 231 232 233 234 235 236 237
  - 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.

238 239 240 241 242 243 244
  - 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.

245 246
  - 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
247 248
    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.
249
    The formula::sugar_delay() function implements this SVA operator in
250 251
    terms of the existing PSL operators.  ##[+] and ##[*] are sugar
    for ##[1:$] and ##[0:$].
252

253 254 255
  - The F[n:m] and G[n:m] operators introduced in Spot 2.7 now
    support the case where m=$.

256
  - spot::relabel_apply() makes it easier to reverse the effect
257 258
    of spot::relabel() or spot::relabel_bse() on formula.

259
  - The LTL simplifier learned the following rules:
260
    F(G(a | Fb)) = FGa | GFb  (if option "favor_event_univ")
261
    G(F(a | Gb)) = GFa | FGb  (if option "favor_event_univ")
262 263
    F(G(a & Fb) = FGa & GFb   (unless option "reduce_size_strictly")
    G(F(a & Gb)) = GFa & FGb  (unless option "reduce_size_strictly")
264 265
    GF(f) = GF(dnf(f))        (unless option "reduce_size_strictly")
    FG(f) = FG(cnf(f))        (unless option "reduce_size_strictly")
266 267 268 269 270 271 272 273
    (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
274

275 276
  - cleanup_parity() and colorize_parity() were cleaned up a bit,
    resulting in fewer colors used in some cases.  In particular,
277
    colorize_parity() learned that coloring transient edges does not
278 279
    require the introduction of a new color.

280 281 282 283 284 285
  - 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.

286 287 288
  - The postprocessor and translator classes are now using
    reduce_parity() for further simplifications.

289 290 291 292 293 294 295
  - 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.

296
  Deprecation notices:
297

298
  - The virtual function twa::intersecting_run() no longer takes a
299 300 301 302 303 304
    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.

305 306 307 308 309
  - 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.

310 311
  Bugs fixed:

312
  - The gf_guarantee_to_ba() is relying on an in-place algorithm that
313 314 315
    could produce a different number of edges for the same input in
    two different transition order.

316 317 318 319 320
  - 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
321
New in spot 2.7.5 (2019-06-05)
322

323 324 325
  Build:

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

328 329 330 331 332 333
  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.
334

335 336
  Bugs fixed:

337
  - spot::translator was not applying Boolean sub-formula rewriting
338
    by default unless a spot::option_map was passed.  This caused some
339
    C++ code for translating certain formulas to be noticeably slower
340 341
    than the equivalent call to the ltl2tgba binary.

342 343 344 345
  - 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
346
New in spot 2.7.4 (2019-04-27)
347

348 349 350 351 352
  Bugs fixed:

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

353 354 355 356 357
  - 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.

358 359 360 361
  - 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
362
New in spot 2.7.3 (2019-04-19)
363

364 365 366 367 368 369
  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.

370
  - Fix serious typo in remove_alternation() causing incorrect
371 372
    output for some VWAA.  Bug introduced in Spot 2.6.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
373 374 375 376
  Documentation:

  - Multiple typos and minor updates.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
377 378 379 380 381 382 383
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.
384

385 386 387 388
  Documentation:

  - A new page shows how to create explicit Kripke structures in C++
    and Python.  See https://spot.lrde.epita.fr/tut52.html
389 390 391
  - 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
392

393 394 395 396 397
  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
398
New in spot 2.7.1 (2019-02-14)
399

400
  Build:
401

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

406 407 408
  Python:

  - The following methods of spot::bdd_dict are now usable in Python when
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
409
    fine control over the lifetime of associations between BDD variables
410 411 412 413 414 415 416
    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
417 418
  - Better support for explicit Kripke structures:
    - the kripke_graph type now has Python bindings
419 420 421 422 423 424 425 426 427
    - 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.

428 429
  - kripke_graph_ptr objects now honor any "state-names" property
    when formatting states.
430

431 432 433 434 435
  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.
436

437 438 439 440
  - std::out_of_range C++ exceptions raised from Python code are now
    converted into IndexError Python exceptions (instead of aborting
    the program).

441 442 443 444
  - 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.

445 446 447
  - The core translation for unambiguous automata was incorrectly
    tagging some non-weak automata as weak.

448 449
  - The product_susp() function used to multiply an automaton with a
    suspendable automaton could incorrectly build transition-based
450
    automata when multiplying two state-based automata.  This caused
451
    ltl2tgba to emit error messages such as: "automaton has
452
    transition-based acceptance despite prop_state_acc()==true".
453

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

456 457 458 459 460 461 462 463
  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.
464
    --algo=lar    translate the formula to a deterministic automaton
465 466 467 468 469 470
                  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.

471 472
  - ltlfilt learned --liveness to match formulas representing liveness
    properties.
473

474 475 476 477 478
  - 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.

479 480 481 482 483 484 485 486 487 488
  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.)

489 490 491 492
  - 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.

493 494
  Library:

495 496 497 498 499 500 501 502 503 504 505 506 507
  - 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)
508

509 510 511 512 513 514 515 516 517 518
  - 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)

519 520 521 522 523
  - 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

524 525 526 527
  - 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
528 529 530
    emptiness of an SCC.  This is now used by
    twa_graph_ptr::is_empty(), twa_graph_ptr::intersects(), and
    scc_info::determine_unknown_acceptance().
531

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
532 533 534 535
  - 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.)
536

537 538 539 540
  - The new function is_liveness() and is_liveness_automaton() can be
    used to check whether a formula or an automaton represents a
    liveness property.

541 542 543 544
  - Two new functions count_univbranch_states() and
    count_univbranch_edges() can help measuring the amount of
    universal branching in alternating automata.

545 546
  Bugs fixed:

547 548 549 550
  - translate() would incorrectly mark as stutter-invariant
    some automata produced from formulas of the form X(f...)
    where f... is syntactically stutter-invariant.

551 552
  - 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
553
    where a single generalized pair is used.
554

555
  - The pair of acc_cond::mark_t returned by
556 557 558
    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.
559

560 561 562 563 564 565 566 567 568 569 570 571 572 573
  - 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()
574
    explicitly if you prefer the old representation.
575

576 577 578
  - Fix compilation under Cygwin and Alpine Linux, both choking
    on undefined secure_getenv().

579
New in spot 2.6.3 (2018-10-17)
580

581 582 583 584 585 586 587
  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.

588 589 590
  - ltl2tgba --low now disables the "gf-guarantee" feature, as
    documented.

591 592 593
  - ltlfilt's --accept-word and --reject-word options were ignored
    unless used together.

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

596 597 598 599 600
  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/
601

602 603 604 605 606 607 608 609
  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.

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

616 617
  - configure --disable-doxygen would actually enable it.

618
  - Fix several warnings emitted by the development version of GCC.
619

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

622 623 624 625
  Command-line tools:

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

627 628 629 630 631
  Bugs fixed:

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

632 633 634
  - 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
635
    set.  (This combination of options is not available from
636 637
    command-line tools.)

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

643 644 645 646
  - 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.

647

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

650 651
  Command-line tools:

652 653 654
  - autfilt learned --is-colored to filter automata that use
    exactly one acceptance set per mark or transition.

655 656 657 658
  - autfilt learned --has-univ-branching and --has-exist-branching
    to keep automata that have universal branching, or that make
    non-deterministic choices.

659 660 661 662 663 664 665
  - 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).

666 667 668
  - ltlcross, ltldo, and autcross learned shorthands to call
    delag, ltl2dra, ltl2dgra, and nba2dpa.

669 670 671 672
  - 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
673
    products to avoid exceeding the number of supported
674 675
    acceptance sets.

676 677 678
  - 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))
679 680
      --sejk-f=RANGE[,RANGE] f(0,j)=(GFa0 U X^j(b)), f(i,j)=(GFai U
                             G(f(i-1,j)))
681 682 683 684 685
      --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)

686 687 688
  - genltl --ms-example can now take a two-range argument,
    (as --sejk-f above).

689 690 691 692
  Build:

  - ./configure --enable-max-accsets=N let you specify a maximum
    number of acceptance sets that Spot should support.  The default
693
    is still 32, but this limit is no longer hard-coded.  Larger values
694 695
    will cost additional memory and time.

696 697 698
  - 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
699 700
  Library:

701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716
  - 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,
717 718 719
    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
720 721
    deterministic automata by other tools distributed with Owl 18.06.
    "x(y)" means x states and y acceptance sets.
722

723
                               ltl2tgba -D  delag ltl2dra
724
                                2.5   2.6   18.06  18.06
725
    -------------------------  -----------  -------------
726 727 728 729 730 731
    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
732
    version 2.5 were not deterministic (because -D is only a
733
    preference).  They are deterministic in 2.6 and other tools.
734

735 736 737 738 739 740 741 742 743 744
  - 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.

745 746 747 748 749 750 751
  - 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
752
    sizes of deterministic automata (except for ltl3tela which produces
753 754 755 756
    non-deterministic automata) produced with generic acceptance
    using two versions of ltl2tgba and other tools for reference.

                                             ltl2tgba -DG  delag  ltl3tela
757
                                              2.5    2.6   18.06    1.1.2
758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775
                                             ------------ ------- --------
    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
776
    obligation sub-formulas from the rest, where a determinization is
777
    still performed.
778 779 780 781 782 783
                                 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)
784 785 786 787

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

788 789
  - The automaton postprocessor will now simplify acceptance
    conditions more aggressively, calling spot::simplify_acceptance()
790
    or spot::cleanup_acceptance() depending on the optimization level.
791

792 793
  - print_dot(), used to print automata in GraphViz's format,
    underwent several changes:
794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821

    * 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.

822
  - spot::twa_graph::merge_states() is a new method that merges states
823 824 825
    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()).
826

827 828 829
  - 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
830 831
    that we want to purge.

832 833 834 835 836 837
  - 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().

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

842
  - spot::contains() and spot::are_equivalent() can be used to
843
    check language containment between two automata or formulas.
844
    They are most welcome in Python, since we used to redefine
845 846 847 848 849 850 851 852
    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
853

854
  - spot::complement_semidet(aut) is a new function that returns the
855
    complement of aut, where aut is a semi-deterministic automaton. The
856 857 858 859
    function uses the NCSB complementation algorithm proposed by
    F. Blahoudek, M. Heizmann, S. Schewe, J. Strejček, and MH. Tsai
    (TACAS'16).

860 861 862 863 864
  - 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.

865 866 867
  - 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
868
    consequence spot::minimize_obligation() and
869
    spot::is_wdba_realizable() now only need one containment check
870
    instead of two.
871

872 873 874 875 876
  - 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.
877

878 879 880
  Python:

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

885
  - Strings are now implicitly converted into formulas when passed
886 887 888
    as arguments to functions that expect formulas.  Previously this
    was done only for a few functions.

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

893 894
  Bugs fixed:

895 896
  - Python *.py and *.so files are now always installed into the same
    directory.  This was an issue on systems like Fedora that separate
897
    platform-specific packages from non-platform-specific ones.
898

899 900 901
  - print_dot() will correctly escape strings containing \n in HTML
    mode.

902 903 904
  - The HOA parser will now accept Alias: declarations that occur
    before AP:.

905 906 907 908
  - 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.
909

910
  Deprecation notices:
911 912 913 914

  - 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
915
    to accommodate configure's --enable-max-accsets=N option and
916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936
    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.

937
  - Because genltl now supports LTL pattern with two arguments, using
938 939 940 941 942 943
    --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' ...

944 945 946 947 948 949 950
  - 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.

951

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

954 955 956 957 958
  Bugs fixed:

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

959 960 961
  - Fix cryptic error message from Python's spot.translate() and
    spot.postprocess() when supplying conflicting arguments.

962 963 964
  - "autfilt -B --sat-minimize" was incorrectly producing
    transition-based automata.

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

968 969 970
  - 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
971
New in spot 2.5.2 (2018-03-25)
972

973 974 975 976 977 978
  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
979
  - remove_fin() and streett_to_generalized_buchi() should never
980 981
    return automata with "f" acceptance.

982 983 984
  - "autfilt --acceptance-is=Fin-less" no longer accept automata
    with "f" acceptance.

985 986 987
  - twa_run methods will now diagnose cases where the cycle is
    unexpectedly empty instead of segfaulting.

988 989 990 991 992 993 994 995
  - 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
996
New in spot 2.5.1 (2018-02-20)
997

998 999 1000 1001
  Library:

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

1002 1003
  Bugs fixed:

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

1006 1007 1008
  - 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).
1009

1010 1011
  - is_generalized_rabin() had a typo that caused some non-simplified
    acceptance conditions like Fin(0)|(Fin(0)&Inf(1)) to be
1012
    incorrectly detected as generalized-Rabin 2 0 1 and then output
1013 1014 1015
    as Fin(0)|(Fin(1)&Inf(2)) instead.  Likewise for
    is_generalized_streett

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1016 1017 1018 1019
  - 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
1020 1021
    condition (by merging identical set) of some automaton prior to
    converting it to Büchi.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1022

1023 1024
  - dnf_to_dca() was mishandling some Rabin-like input.

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

1027 1028
  Build:

Maximilien Colange's avatar
Maximilien Colange committed
1029
  - We no longer distribute the doxygen-generated documentation in
1030 1031 1032 1033 1034
    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".

1035 1036 1037
  - All the images that illustrate the documentation have been
    converted to SVG, to save space and improve quality.

1038 1039
  Tools:

1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
  - 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'.

1057 1058 1059
  - 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
1060 1061
    recognize a superset of the input.  Currently, the output is
    always state-based.
1062

1063 1064 1065
  - 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:
1066 1067
    --gf-equiv=RANGE       (GFa1 & GFa2 & ... & GFan) <-> GFz
    --gf-implies=RANGE     (GFa1 & GFa2 & ... & GFan) -> GFz
1068 1069 1070 1071
    --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})|(...))
1072

1073 1074
  - autfilt learned --streett-like to convert automata with DNF
    acceptance into automata with Streett-like acceptance.
1075

1076 1077 1078 1079 1080
  - 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.

1081 1082
  - ltldo learned to limit the number of automata it outputs using -n.

1083 1084
  - ltlfilt learned to measure wall-time using --format=%r, and
    cpu-time with --format=%R.
1085

1086 1087
  - The --format=%g option of tools that output automata used to
    print the acceptance condition as a *formula* in the HOA format.
1088
    This %g may now take optional arguments to print the acceptance
1089 1090 1091 1092 1093 1094 1095 1096
    *name* in different formats.  For instance

       ... | autfilt -o '%[s]g.hoa'

    will separate a stream of automata into different files named
    by their acceptance name (Buchi, co-Buchi, Streett, etc.) or
    "other" if no name is known for the acceptance condition.

1097 1098 1099
  - Tools that produce formulas now support --format=%[OP]n to
    display the nesting depth of operator OP.

1100 1101
  - The new -x tls-impl=N option allows to fine-tune the
    implication-based simplification rules of ltl2tgba.  See the
Maximilien Colange's avatar
Maximilien Colange committed
1102
    spot-x(7) man page for details.
1103

1104 1105
  - All tools learned to check the SPOT_OOM_ABORT environment
    variable.  This is only useful for debuging out-of-memory
Maximilien Colange's avatar
Maximilien Colange committed
1106
    conditions. See the spot-x(7) man page for details.
1107

1108 1109
  New functions in the library:

1110
  - spot::iar() and spot::iar_maybe() use index appearance records (IAR)
1111
    to translate Rabin-like automata into equivalent parity automata.
1112 1113 1114
    This translation preserves determinism and is especially useful when
    the input automaton is deterministic.

1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125
  - spot::print_aiger() encodes an automaton as an AIGER circuit, as
    required by the SYNTCOMP competition.  It relies on a new named
    property "synthesis outputs" that describes which atomic
    propositions are to be encoded as outputs of the circuits.

  - spot::dnf_to_streett() converts any automaton with a DNF
    acceptance condition into a Streett-like automaton.

  - spot::nsa_to_nca(), spot::dfn_to_nca(), spot::dfn_to_dca(), and
    spot::nsa_to_dca(), convert automata with DNF or Streett-like
    acceptance into deterministic or non-deterministic co-Büchi
Maximilien Colange's avatar
Maximilien Colange committed
1126 1127
    automata.  spot::to_dca() and spot::to_nca() dispatch between
    these four functions.  The language of produced automaton includes
1128 1129
    the original language, but may be larger if the original automaton
    is not co-Büchi realizable.  Based on Boker & Kupferman FOSSACS'11
1130
    paper.  Currently only supports state-based output.
1131

Maximilien Colange's avatar
Maximilien Colange committed
1132
  - spot::scc_info::states_on_acc_cycle_of() returns all states
1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
    visited by any accepting cycle of the specified SCC.  It only
    works on automata with Streett-like acceptance.

  - spot::is_recurrence(), spot::is_persistence(), and
    spot::is_obligation() test if a formula is a recurrence,
    persistance or obligation.  The SPOT_PR_CHECK and SPOT_O_CHECK
    environment variables can be used to select between multiple
    implementations of these functions (see the spot-x(7) man page).

  - spot::is_colored() checks if an automaton is colored
Maximilien Colange's avatar
Maximilien Colange committed
1143
    (i.e., every transition belongs to exactly one acceptance set).
1144

Maximilien Colange's avatar
Maximilien Colange committed
1145
  - spot::change_parity() converts between different parity acceptance
1146
    conditions.
1147

Maximilien Colange's avatar
Maximilien Colange committed
1148
  - spot::colorize_parity() transforms an automaton with parity
1149 1150
    acceptance into a colored automaton (which is often what people
    working with parity automata expect).
1151

Maximilien Colange's avatar
Maximilien Colange committed
1152
  - spot::cleanup_parity_acceptance() simplifies a parity acceptance
1153
    condition.
1154

1155 1156 1157
  - spot::parity_product() and spot::parity_product_or() are
    specialized (but expensive) products that preserve parity
    acceptance.
1158

1159 1160 1161
  - spot::remove_univ_otf() removes universal transitions on the fly
    from an alternating Büchi automaton using Miyano and Hayashi's
    breakpoint algorithm.
1162

1163 1164
  - spot::stutter_invariant_states(),
    spot::stutter_invariant_letters(),
Maximilien Colange's avatar
Maximilien Colange committed
1165
    spot::highlight_stutter_invariant_states(), ...  These functions
1166 1167
    help study a stutter-sensitive automaton and detect the subset of
    states that are stutter-invariant.  See
1168
    https://spot.lrde.epita.fr/ipynb/stutter-inv.html for examples.
1169

1170
  - spot::acc_cond::name(fmt) is a new method that names well-known
Maximilien Colange's avatar
Maximilien Colange committed
1171
    acceptance conditions.  The fmt parameter specifies the format to
1172 1173
    use for that name (e.g. to the style used in HOA, or that used by
    print_dot()).
1174

1175 1176
  - spot::formula::is_leaf() method can be used to detect formulas
    without children (atomic propositions, or constants).
1177

1178 1179
  - spot::nesting_depth() computes the nesting depth of any LTL
    operator.
1180

1181 1182
  - spot::check_determinism() sets both prop_semi_deterministic()
    and prop_universal() appropriately.
1183

1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203
  Improvements to existing functions in the library:

  - spot::tgba_determinize() has been heavily rewritten and
    optimized. The algorithm has (almost) not changed, but it is
    much faster now. It also features an optimization for
    stutter-invariant automata that may produce slightly smaller
    automata.

  - spot::scc_info now takes an optional argument to disable some
    features that are expensive and not always necessary.  By
    default scc_info tracks the list of all states that belong to an
    SCC (you may now ask it not to), tracks the successor SCCs of
    each SCC (that can but turned off), and explores all SCCs of the
    automaton (you may request to stop on the first SCC that is
    found accepting).

  - In some cases, spot::degeneralize() would output Büchi automata
    with more SCCs than its input.  This was hard to notice, because
    very often simulation-based simplifications remove those extra
    SCCs.  This situation is now detected by spot::degeneralized()
Maximilien Colange's avatar
Maximilien Colange committed
1204
    and fixed before returning the automaton.  A new optional
1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217
    argument can be passed to disable this behavior (or use -x
    degen-remscc=0 from the command-line).

  - The functions for detecting stutter-invariant formulas or
    automata have been overhauled.  Their interface changed
    slightly.  They are now fully documented.

  - spot::postprocessor::set_type() can now request different forms
    of parity acceptance as output.  However currently the
    conversions are not very smart: if the input does not already
    have parity acceptance, it will simply be degeneralized or
    determinized.

1218 1219 1220 1221
  - spot::postprocessor::set_type() can now request co-Büchi
    acceptance as output.  This calls the aforementioned to_nca() or
    to_dca() functions.

1222 1223 1224 1225 1226 1227 1228
  - spot::remove_fin() will now call simplify_acceptance(),
    introduced in 2.4, before attempting its different Fin-removal
    strategies.

  - spot::simplify_acceptance() was already merging identical
    acceptance sets, and detecting complementary sets i and j to
    perform the following simplifications
1229 1230 1231 1232 1233 1234 1235
      Fin(i) & Inf(j) = Fin(i)
      Fin(i) | Inf(j) = Inf(i)
    It now additionally applies the following rules (again assuming i
    and j are complementary):
      Fin(i) & Fin(j) = f          Inf(i) | Inf(j) = t
      Fin(i) & Inf(i) = f          Fin(i) | Inf(i) = t

1236 1237 1238 1239
  - spot::formula::map(fun) and spot::formula::traverse(fun) will
    accept additionnal arguments and pass them to fun().  See
    https://spot.lrde.epita.fr/tut03.html for some examples.

1240
  Python-specific changes:
1241 1242

  - The "product-states" property of automata is now accessible via
1243
    spot.twa.get_product_states() and spot.twa.set_product_states().
1244

1245 1246 1247 1248
  - twa_word instances can be displayed as SVG pictures, with one
    signal per atomic proposition.  For some examples, see the use of
    the show() method in https://spot.lrde.epita.fr/ipynb/word.html

1249 1250
  - The test suite is now using v4 of the Jupyter Notebook format.

1251 1252 1253 1254
  - The function rabin_is_buchi_realizable() as its name suggests checks
    if a rabin aut. is Büchi realizable. It is heavily based on
    tra_to_tba() algorithm.

1255 1256 1257 1258 1259
  Deprecation notices:

  (These functions still work but compilers emit warnings.)

  - spot::scc_info::used_acc(), spot::scc_info::used_acc_of() and
1260
    spot::scc_info::acc() are deprecated.  They have been renamed
1261
    spot::scc_info::marks(), spot::scc_info::marks_of() and
1262
    spot::scc_info::acc_sets_of() respectively for clarity.
1263

1264 1265 1266
  Backward incompatible changes:

  - The spot::closure(), spot::sl2(), spot::is_stutter_invariant()
Maximilien Colange's avatar
Maximilien Colange committed
1267
    functions no longer take && arguments.  The former two have
1268 1269
    spot::closure_inplace() and spot::sl2_inplace() variants.  These
    functions also do not take a list of atomic propositions as an
1270 1271
    argument anymore.

1272
  - The spot::bmrand() and spot::prand() functions have been removed.
Maximilien Colange's avatar
Maximilien Colange committed
1273
    They were not used at all in Spot, and it is not Spot's objective
1274 1275
    to provide such random functions.

1276
  - The spot::bdd_dict::register_all_propositions_of() function has
Maximilien Colange's avatar
Maximilien Colange committed
1277
    been removed.  This low-level function was not used anywhere in
1278 1279
    Spot anymore, since it's better to use spot::twa::copy_ap_of().

1280 1281
  Bugs fixed:

1282 1283 1284 1285
  - spot::simplify_acceptance() could produce incorrect output if the
    first edge of the automaton was the only one with no acceptance
    set.  In spot 2.4.x this function was only used by autfilt
    --simplify-acceptance; in 2.5 it is now used in remove_fin().
1286

1287 1288 1289 1290
  - spot::streett_to_generalized_buchi() could generate incorrect
    automata with empty language if some Fin set did not intersect all
    accepting SCCs (in other words, the fix from 2.4.1 was incorrect).

1291
  - ltlcross could crash when calling remove_fin() on an automaton
Maximilien Colange's avatar
Maximilien Colange committed
1292
    with 32 acceptance sets that would need an additional set.
1293

1294 1295 1296 1297
  - the down_cast() helper function used in severaly headers of Spot
    was not in the spot namespace, and caused issues with some
    configurations of GCC.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1298
New in spot 2.4.4 (2017-12-25)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1299

1300 1301 1302 1303 1304 1305
  Bugs fixed:

  - The generic to_generalized_buchi() function would fail if the
    Fin-less & CNF version of the acceptance condition had several
    unit clauses.

1306 1307 1308 1309
  - If the automaton passed to sbacc() was incomplete or
    non-deterministic because of some unreachable states, then it was
    possible that the output would marked similarly while it was in
    fact complete or deterministic.
1310

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1311
New in spot 2.4.3 (2017-12-19)
1312

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1313
  Bugs fixed:
1314 1315 1316 1317

  - couvreur99_new() leaked memory when processing TωA that allocate
    states.

1318 1319
  - Some mismatched placement-new/delete reported by ASAN were fixed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1320 1321 1322 1323 1324 1325 1326
  - Static compilation was broken on MinGW.

  - Execution of Jupyter notebooks from the testsuite failed with
    recent versions of Python.

  - Fix some warnings triggered by the development version of g++.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1327 1328 1329 1330 1331
New in spot 2.4.2 (2017-11-07)

  Tools:

  - ltlcross and ltldo support ltl3tela, the new name of ltl3hoa.
1332

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1333 1334 1335 1336 1337
  Bugs fixed:

  - Automata produced by "genaut --ks-nca=N" were incorrectly marked
    as not complete.

1338 1339 1340
  - Fix some cases for which the highest setting of formulas
    simplification would produce worse results than lower settings.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1341
New in spot 2.4.1 (2017-10-05)
1342

1343 1344
  Bugs fixed:

Maximilien Colange's avatar
Typos  
Maximilien Colange committed
1345 1346
  - The formula class failed to build {a->c[*]} although it is
    allowed by our grammar.
1347

1348 1349 1350 1351 1352 1353 1354 1355 1356 1357
  - spot::scc_info::determine_unknown_acceptance() incorrectly
    considered some rejecting SCC as accepting.

  - spot::streett_to_generalized_buchi() could generate automata with
    empty language if some Fin set did not intersect all accepting
    SCCs.  As a consequence, some Streett-like automata were
    considered empty even though they were not.  Also, the same
    function could crash on input that had a Streett-like acceptance
    not using all declared sets.

Maximilien Colange's avatar
Typos  
Maximilien Colange committed
1358 1359 1360 1361
  - The twa_graph::merge_edges() function relied on BDD IDs to sort
    edges.  This in turn caused some algorithms (like the
    degeneralization) to produce slighltly different (but still correct)
    outputs depending on the BDD operations performed before.
1362

Maximilien Colange's avatar
Typos  
Maximilien Colange committed
1363 1364
  - spot::simulation() could incorrectly flag an automaton as
    non-deterministic.
1365

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1366
New in spot 2.4 (2017-09-06)
1367

1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378
  Build:

  - Spot is now built in C++14 mode, so you need at least GCC 5 or
    clang 3.4.  The current version of all major linux distributions
    ship with at least GCC 6, which defaults to C++14, so this should
    not be a problem.  In *this* release of Spot, most of the header
    files are still C++11 compatible, so you should be able to include
    Spot in a C++11 project in case you do not yet want to upgrade.
    There is also an --enable-c++17 option to configure in case you
    want to force a build of Spot in C++17 mode.

1379 1380
  Tools: