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

3 4 5 6 7
  Command-line tools:

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

8 9 10
  - ltldo, ltlcross, and autcross are now preferring posix_spawn()
    over fork()+exec() when available.

11 12 13 14 15 16 17 18 19
  - 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
20
  - ltlcross will now skip unnecessary cross-checks and
21 22 23
    consistency-checks (they are unnecessary when all automata
    could be complemented and statistics were not required).

24 25 26
  - genaut learned --m-nba=N to generate Max Michel's NBA familly.
    (NBAs with N+1 states whose determinized have at least N! states.)

27 28 29 30 31 32
  - 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
    amongst "Inf(0)", "t", or "f", and persistance properties have an
    acceptance condition among "Fin(0)", "t", or "f".

33 34 35 36 37
  Library:

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

38 39
  - twa::accepting_run() and twa::intersecting_run() now work on
    automata using Fin in their acceptance condition.
40

41 42 43 44 45 46 47
  - 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.)

48 49 50
  - 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.
51

52 53 54 55 56
  - 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.)

57
  - There is a new spot::scc_and_mark_filter objet that simplifies the
58 59 60 61 62
    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
63 64 65 66
  - 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
67 68 69
  - A new complement() function returns complementd automata with
    unspecified acceptance condition.  The output can be alternating
    only if the input was alternating.
70

71 72 73 74 75 76 77 78 79 80 81 82 83 84
  - 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.

85 86 87 88 89 90 91
  - 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.

92 93
  - 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
94 95 96 97 98
    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.
    The formula::sugar_delay() function implement this SVA operator in
    terms of the existing PSL operators.  ##[+] and ##[*] are sugar
    for ##[1:$] and ##[0:$].
99

100 101 102
  - The F[n:m] and G[n:m] operators introduced in Spot 2.7 now
    support the case where m=$.

103
  - spot::relabel_apply() makes it easier to reverse the effect
104 105
    of spot::relabel() or spot::relabel_bse() on formula.

106 107 108 109 110 111
  - The LTL simplifier learned the following optional rules:
    F(G(a | Fb)) = FGa | GFb  (if option "favor_event_univ")
    G(F(a | Gb)) = GFa | FGb   (if option "favor_event_univ")
    F(G(a & Fb) = FGa & GFb   (unless option "reduce_size_strictly")
    G(F(a & Gb)) = GFa & FGb  (unless option "reduce_size_strictly")

112 113 114 115 116
  - cleanup_parity() and colorize_parity() were cleaned up a bit,
    resulting in fewer colors used in some cases.  In particular,
    colorize_parity() learned that coloring transitiant edges does not
    require the introduction of a new color.

117 118 119 120 121 122
  - 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.

123 124 125
  - The postprocessor and translator classes are now using
    reduce_parity() for further simplifications.

126 127 128 129 130 131 132
  - 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.

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

135 136 137
  Build:

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

140 141 142 143 144 145
  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.
146

147 148
  Bugs fixed:

149 150 151 152 153
  - spot::translator was not applying Boolean sub-formula rewritting
    by default unless a spot::option_map was passed.  This caused some
    C++ code for translating certains formulas to be noticeably slower
    than the equivalent call to the ltl2tgba binary.

154 155 156 157
  - 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
158
New in spot 2.7.4 (2019-04-27)
159

160 161 162 163 164
  Bugs fixed:

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

165 166 167 168 169
  - 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.

170 171 172 173
  - 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
174
New in spot 2.7.3 (2019-04-19)
175

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

182 183 184
  - Fix serious typo in removel_alternation() causing incorrect
    output for some VWAA.  Bug introduced in Spot 2.6.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
185 186 187 188
  Documentation:

  - Multiple typos and minor updates.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
189 190 191 192 193 194 195
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.
196

197 198 199 200
  Documentation:

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

205 206 207 208 209
  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
210
New in spot 2.7.1 (2019-02-14)
211

212
  Build:
213

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

218 219 220
  Python:

  - The following methods of spot::bdd_dict are now usable in Python when
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
221
    fine control over the lifetime of associations between BDD variables
222 223 224 225 226 227 228
    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
229 230
  - Better support for explicit Kripke structures:
    - the kripke_graph type now has Python bindings
231 232 233 234 235 236 237 238 239 240 241 242
    - 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.

  - kripke_graph_ptr objects now honnor any "state-names" property
    when formating states.

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

249 250 251 252
  - std::out_of_range C++ exceptions raised from Python code are now
    converted into IndexError Python exceptions (instead of aborting
    the program).

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

257 258 259
  - The core translation for unambiguous automata was incorrectly
    tagging some non-weak automata as weak.

260 261 262 263
  - The product_susp() function used to multiply an automaton with a
    suspendable automaton could incorrectly build transition-based
    automata when multipliying two state-based automata.  This caused
    ltl2tgba to emit error messages such as: "automaton has
264
    transition-based acceptance despite prop_state_acc()==true".
265

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

268 269 270 271 272 273 274 275
  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.
276
    --algo=lar    translate the formula to a deterministic automaton
277 278 279 280 281 282
                  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.

283 284
  - ltlfilt learned --liveness to match formulas representing liveness
    properties.
285

286 287 288 289 290
  - 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.

291 292 293 294 295 296 297 298 299 300
  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.)

301 302 303 304
  - 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.

305 306
  Library:

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

321 322 323 324 325 326 327 328 329 330
  - 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)

331 332 333 334 335
  - 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

336 337 338 339
  - 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
340 341 342
    emptiness of an SCC.  This is now used by
    twa_graph_ptr::is_empty(), twa_graph_ptr::intersects(), and
    scc_info::determine_unknown_acceptance().
343

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
344 345 346 347
  - 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.)
348

349 350 351 352
  - The new function is_liveness() and is_liveness_automaton() can be
    used to check whether a formula or an automaton represents a
    liveness property.

353 354 355 356
  - Two new functions count_univbranch_states() and
    count_univbranch_edges() can help measuring the amount of
    universal branching in alternating automata.

357 358
  Bugs fixed:

359 360 361 362
  - translate() would incorrectly mark as stutter-invariant
    some automata produced from formulas of the form X(f...)
    where f... is syntactically stutter-invariant.

363 364
  - 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
365
    where a single generalized pair is used.
366

367
  - The pair of acc_cond::mark_t returned by
368 369 370
    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.
371

372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387
  - 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()
    explicitely if you prefer the old representation.

388 389 390
  - Fix compilation under Cygwin and Alpine Linux, both choking
    on undefined secure_getenv().

391
New in spot 2.6.3 (2018-10-17)
392

393 394 395 396 397 398 399
  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.

400 401 402
  - ltl2tgba --low now disables the "gf-guarantee" feature, as
    documented.

403 404 405
  - ltlfilt's --accept-word and --reject-word options were ignored
    unless used together.

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

408 409 410 411 412
  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/
413

414 415 416 417 418 419 420 421
  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.

422 423 424 425 426 427
  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.

428 429 430 431
  - configure --disable-doxygen would actually enable it.

  - Fix several warnings emited by the development version of GCC.

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

434 435 436 437
  Command-line tools:

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

439 440 441 442 443
  Bugs fixed:

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

444 445 446
  - 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
447
    set.  (This combination of options is not available from
448 449
    command-line tools.)

450 451 452
  - The spot::contains(a, b) function introduced in 2.6 was testing
    a⊆b instead of a⊇b as one would expect.  Infortunately the
    documentation was also matching the code, so this is a backward
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
453
    incompatible change, but a short-lived one.
454

455 456 457 458
  - 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.

459

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

462 463
  Command-line tools:

464 465 466
  - autfilt learned --is-colored to filter automata that use
    exactly one acceptance set per mark or transition.

467 468 469 470
  - autfilt learned --has-univ-branching and --has-exist-branching
    to keep automata that have universal branching, or that make
    non-deterministic choices.

471 472 473 474 475 476 477
  - 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).

478 479 480
  - ltlcross, ltldo, and autcross learned shorthands to call
    delag, ltl2dra, ltl2dgra, and nba2dpa.

481 482 483 484
  - 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
485
    products to avoid exceeding the number of supported
486 487
    acceptance sets.

488 489 490
  - 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))
491 492
      --sejk-f=RANGE[,RANGE] f(0,j)=(GFa0 U X^j(b)), f(i,j)=(GFai U
                             G(f(i-1,j)))
493 494 495 496 497
      --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)

498 499 500
  - genltl --ms-example can now take a two-range argument,
    (as --sejk-f above).

501 502 503 504 505 506 507
  Build:

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

508 509 510
  - 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
511 512
  Library:

513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528
  - 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,
529 530 531
    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
532 533
    deterministic automata by other tools distributed with Owl 18.06.
    "x(y)" means x states and y acceptance sets.
534

535
                               ltl2tgba -D  delag ltl2dra
536
                                2.5   2.6   18.06  18.06
537
    -------------------------  -----------  -------------
538 539 540 541 542 543
    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
544
    version 2.5 were not deterministic (because -D is only a
545
    preference).  They are deterministic in 2.6 and other tools.
546

547 548 549 550 551 552 553 554 555 556
  - 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.

557 558 559 560 561 562 563
  - 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
564
    sizes of deterministic automata (except for ltl3tela which produces
565 566 567 568
    non-deterministic automata) produced with generic acceptance
    using two versions of ltl2tgba and other tools for reference.

                                             ltl2tgba -DG  delag  ltl3tela
569
                                              2.5    2.6   18.06    1.1.2
570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587
                                             ------------ ------- --------
    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
588 589
    obligation subformulas from the rest, where a determinization is
    still performed.
590 591 592 593 594 595
                                 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)
596 597 598 599

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

600 601
  - The automaton postprocessor will now simplify acceptance
    conditions more aggressively, calling spot::simplify_acceptance()
602
    or spot::cleanup_acceptance() depending on the optimization level.
603

604 605
  - print_dot(), used to print automata in GraphViz's format,
    underwent several changes:
606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633

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

634
  - spot::twa_graph::merge_states() is a new method that merges states
635 636 637
    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()).
638

639 640 641
  - 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
642 643
    that we want to purge.

644 645 646 647 648 649
  - 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().

650 651 652
  - 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.
653

654 655 656
  - spot::contains() and spot::are_equivalent() can be used to
    check language containement between two automata or formulas.
    They are most welcome in Python, since we used to redefine
657 658 659 660 661 662 663 664
    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
665

666 667 668 669 670 671
  - spot::complement_semidet(aut) is a new function that returns the
    complement of aut, where aut is a semideterministic automaton. The
    function uses the NCSB complementation algorithm proposed by
    F. Blahoudek, M. Heizmann, S. Schewe, J. Strejček, and MH. Tsai
    (TACAS'16).

672 673 674 675 676
  - 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.

677 678 679
  - 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
680 681 682
    consequence spot::minimize_obligation() and
    spot::is_wdba_realizable() now only need one containement check
    instead of two.
683

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

690 691 692
  Python:

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

697 698 699 700
  - Strings are now implicitely converted into formulas when passed
    as arguments to functions that expect formulas.  Previously this
    was done only for a few functions.

701 702 703 704
  - 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.

705 706
  Bugs fixed:

707 708 709 710
  - Python *.py and *.so files are now always installed into the same
    directory.  This was an issue on systems like Fedora that separate
    plateform-specific packages from non-plateform-specific ones.

711 712 713
  - print_dot() will correctly escape strings containing \n in HTML
    mode.

714 715 716
  - The HOA parser will now accept Alias: declarations that occur
    before AP:.

717 718 719 720
  - 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.
721

722
  Deprecation notices:
723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755

  - 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
    to accomodate configure's --enable-max-accsets=N option and
    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.

  - Because genltl now supports LTL pattern with two argumens, using
    --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' ...

756 757 758 759 760 761 762
  - 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.

763

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

766 767 768 769 770
  Bugs fixed:

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

771 772 773
  - Fix cryptic error message from Python's spot.translate() and
    spot.postprocess() when supplying conflicting arguments.

774 775 776
  - "autfilt -B --sat-minimize" was incorrectly producing
    transition-based automata.

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

780 781 782
  - 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
783
New in spot 2.5.2 (2018-03-25)
784

785 786 787 788 789 790
  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
791
  - remove_fin() and streett_to_generalized_buchi() should never
792 793
    return automata with "f" acceptance.

794 795 796
  - "autfilt --acceptance-is=Fin-less" no longer accept automata
    with "f" acceptance.

797 798 799
  - twa_run methods will now diagnose cases where the cycle is
    unexpectedly empty instead of segfaulting.

800 801 802 803 804 805 806 807
  - 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
808
New in spot 2.5.1 (2018-02-20)
809

Maximilien Colange's avatar
Maximilien Colange committed
810 811 812 813
  Library:

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

814 815
  Bugs fixed:

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

818 819 820
  - 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).
821

822 823 824 825 826 827
  - is_generalized_rabin() had a typo that caused some non-simplified
    acceptance conditions like Fin(0)|(Fin(0)&Inf(1)) to be
    incorrectly detecteded as generalized-Rabin 2 0 1 and then output
    as Fin(0)|(Fin(1)&Inf(2)) instead.  Likewise for
    is_generalized_streett

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
828 829 830 831
  - 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
832 833
    condition (by merging identical set) of some automaton prior to
    converting it to Büchi.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
834

835 836
  - dnf_to_dca() was mishandling some Rabin-like input.

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

839 840
  Build:

Maximilien Colange's avatar
Maximilien Colange committed
841
  - We no longer distribute the doxygen-generated documentation in
842 843 844 845 846
    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".

847 848 849
  - All the images that illustrate the documentation have been
    converted to SVG, to save space and improve quality.

850 851
  Tools:

852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868
  - 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'.

869 870 871
  - 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
872 873
    recognize a superset of the input.  Currently, the output is
    always state-based.
874

875 876 877
  - 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:
878 879
    --gf-equiv=RANGE       (GFa1 & GFa2 & ... & GFan) <-> GFz
    --gf-implies=RANGE     (GFa1 & GFa2 & ... & GFan) -> GFz
880 881 882 883
    --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})|(...))
884

885 886
  - autfilt learned --streett-like to convert automata with DNF
    acceptance into automata with Streett-like acceptance.
887

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

893 894
  - ltldo learned to limit the number of automata it outputs using -n.

895 896
  - ltlfilt learned to measure wall-time using --format=%r, and
    cpu-time with --format=%R.
897

898 899
  - The --format=%g option of tools that output automata used to
    print the acceptance condition as a *formula* in the HOA format.
900
    This %g may now take optional arguments to print the acceptance
901 902 903 904 905 906 907 908
    *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.

909 910 911
  - Tools that produce formulas now support --format=%[OP]n to
    display the nesting depth of operator OP.

912 913
  - 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
914
    spot-x(7) man page for details.
915

916 917
  - 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
918
    conditions. See the spot-x(7) man page for details.
919

920 921
  New functions in the library:

922
  - spot::iar() and spot::iar_maybe() use index appearance records (IAR)
Maximilien Colange's avatar
Maximilien Colange committed
923
    to translate Rabin-like automata into equivalent parity automata.
924 925 926
    This translation preserves determinism and is especially useful when
    the input automaton is deterministic.

927 928 929 930 931 932 933 934 935 936 937
  - 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
938 939
    automata.  spot::to_dca() and spot::to_nca() dispatch between
    these four functions.  The language of produced automaton includes
940 941
    the original language, but may be larger if the original automaton
    is not co-Büchi realizable.  Based on Boker & Kupferman FOSSACS'11
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
942
    paper.  Currently only supports state-based output.
943

Maximilien Colange's avatar
Maximilien Colange committed
944
  - spot::scc_info::states_on_acc_cycle_of() returns all states
945 946 947 948 949 950 951 952 953 954
    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
955
    (i.e., every transition belongs to exactly one acceptance set).
956

Maximilien Colange's avatar
Maximilien Colange committed
957
  - spot::change_parity() converts between different parity acceptance
958
    conditions.
959

Maximilien Colange's avatar
Maximilien Colange committed
960
  - spot::colorize_parity() transforms an automaton with parity
961 962
    acceptance into a colored automaton (which is often what people
    working with parity automata expect).
963

Maximilien Colange's avatar
Maximilien Colange committed
964
  - spot::cleanup_parity_acceptance() simplifies a parity acceptance
965
    condition.
966

967 968 969
  - spot::parity_product() and spot::parity_product_or() are
    specialized (but expensive) products that preserve parity
    acceptance.
970

971 972 973
  - spot::remove_univ_otf() removes universal transitions on the fly
    from an alternating Büchi automaton using Miyano and Hayashi's
    breakpoint algorithm.
974

975 976
  - spot::stutter_invariant_states(),
    spot::stutter_invariant_letters(),
Maximilien Colange's avatar
Maximilien Colange committed
977
    spot::highlight_stutter_invariant_states(), ...  These functions
978 979
    help study a stutter-sensitive automaton and detect the subset of
    states that are stutter-invariant.  See
980
    https://spot.lrde.epita.fr/ipynb/stutter-inv.html for examples.
981

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

987 988
  - spot::formula::is_leaf() method can be used to detect formulas
    without children (atomic propositions, or constants).
989

990 991
  - spot::nesting_depth() computes the nesting depth of any LTL
    operator.
992

993 994
  - spot::check_determinism() sets both prop_semi_deterministic()
    and prop_universal() appropriately.
995

996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015
  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
1016
    and fixed before returning the automaton.  A new optional
1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029
    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.

1030 1031 1032 1033
  - spot::postprocessor::set_type() can now request co-Büchi
    acceptance as output.  This calls the aforementioned to_nca() or
    to_dca() functions.

1034 1035 1036 1037 1038 1039 1040
  - 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
1041 1042 1043 1044 1045 1046 1047
      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

1048 1049 1050 1051
  - 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.

1052
  Python-specific changes:
1053 1054

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

1057 1058 1059 1060
  - 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

1061 1062
  - The test suite is now using v4 of the Jupyter Notebook format.

1063 1064 1065 1066
  - 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.

1067 1068 1069 1070 1071
  Deprecation notices:

  (These functions still work but compilers emit warnings.)

  - spot::scc_info::used_acc(), spot::scc_info::used_acc_of() and
1072
    spot::scc_info::acc() are deprecated.  They have been renamed
1073
    spot::scc_info::marks(), spot::scc_info::marks_of() and
1074
    spot::scc_info::acc_sets_of() respectively for clarity.
1075

1076 1077 1078
  Backward incompatible changes:

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

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

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

1092 1093
  Bugs fixed:

1094 1095 1096 1097
  - 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().
1098

1099 1100 1101 1102
  - 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).

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

1106 1107 1108 1109
  - 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
1110
New in spot 2.4.4 (2017-12-25)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1111

1112 1113 1114 1115 1116 1117
  Bugs fixed:

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

1118 1119 1120 1121
  - 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.
1122

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1125
  Bugs fixed:
1126 1127 1128 1129

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

1130 1131
  - Some mismatched placement-new/delete reported by ASAN were fixed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1132 1133 1134 1135 1136 1137 1138
  - 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
1139 1140 1141 1142 1143
New in spot 2.4.2 (2017-11-07)

  Tools:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1145 1146 1147 1148 1149
  Bugs fixed:

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

1150 1151 1152
  - 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
1153
New in spot 2.4.1 (2017-10-05)
1154

1155 1156
  Bugs fixed:

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

1160 1161 1162 1163 1164 1165 1166 1167 1168 1169
  - 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
1170 1171 1172 1173
  - 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.
1174

Maximilien Colange's avatar
Typos  
Maximilien Colange committed
1175 1176
  - spot::simulation() could incorrectly flag an automaton as
    non-deterministic.
1177

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

1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190
  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.

1191 1192
  Tools:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1193 1194 1195 1196 1197 1198 1199 1200
  - genaut is a new binary that produces families of automata defined
    in the literature (in the same way as we have genltl for LTL
    formulas).

  - autcross is a new binary that compares the output of tools
    transforming automata (in the same way as we have ltlcross for
    LTL translators).

1201
  - genltl learned two generate two new families of formulas:
1202 1203 1204 1205 1206 1207
      --fxg-or=RANGE         F(p0 | XG(p1 | XG(p2 | ... XG(pn))))
      --gxf-and=RANGE        G(p0 & XF(p1 & XF(p2 & ... XF(pn))))
    The later is a generalization of --eh-pattern=9, for which a
    single state TGBA always exists (but previous version of Spot
    would build larger automata).

1208
  - autfilt learned to build the union (--sum) or the intersection
Maximilien Colange's avatar
Typos  
Maximilien Colange committed
1209 1210
    (--sum-and) of two languages by putting two automata side-by-side
    and fiddling with the initial states.  This complements the already
1211 1212
    implemented intersection (--product) and union (--product-or),
    both based on a product.
1213

1214
  - autfilt learned to complement any alternating automaton with
1215
    option --dualize.   (See spot::dualize() below.)
Thomas Medioni's avatar
Thomas Medioni committed
1216

1217 1218 1219 1220
  - autfilt learned --split-edges to convert labels that are Boolean
    formulas into labels that are min-terms.  (See spot::split_edges()
    below.)

1221 1222 1223
  - autfilt learned --simplify-acceptance to simplify some acceptance
    conditions.  (See spot::simplify_acceptance() below.)

1224 1225 1226 1227
  - autfilt --decompote-strength has been renamed to --decompose-scc
    because it can now extract the subautomaton leading to an SCC
    specified by number.  (The old name is still kept as an alias.)

1228 1229 1230
  - The --stats=%c option of tools producing automata can now be
    restricted to count complete SCCs, using %[c]c.

1231 1232 1233 1234 1235 1236
  - Tools producing automata have a --stats=... option, and tools
    producing formulas have a --format=... option.  These two options
    work similarly, the use of different names is just historical.
    Starting with this release, all tools that recognize one of these
    two options also accept the other one as an alias.

1237 1238
  Library:

1239 1240
  - A new library, libspotgen, gathers all functions used to generate
    families of automata or LTL formulas, used by genltl and genaut.
1241

1242
  - spot::sum() and spot::sum_and() implements the union and the
1243
    intersection of two automata by putting them side-by-side and
1244
    using non-deterministim or universal branching on the initial
1245
    state.
1246

1247 1248 1249
  - twa objects have a new property: prop_complete().  This obviously
    acts as a cache for the is_complete() function.

Maximilien Colange's avatar
Typos  
Maximilien Colange committed
1250
  - spot::dualize() complements any alternating automaton.  Since
1251 1252 1253
    the dual of a deterministic automaton is still deterministic, the
    function spot::dtwa_complement() has been deprecated and simply
    calls spot::dualize().
1254

1255 1256 1257 1258 1259 1260
  - spot::decompose_strength() was extended and renamed to
    spot::decompose_scc() as it can now also extract a subautomaton
    leading to a particular SCC.  A demonstration of this feature via
    the Python bindings can be found at
    https://spot.lrde.epita.fr/ipynb/decompose.html

1261 1262
  - The print_dot() function will now display names for well known
    acceptance conditions under the formula when option 'a' is used.