Newer Older
New in spot (not yet released)

3 4 5 6 7
  Command-line tools:

  - autcross' tool specifications now have %M replaced by the name of
    the input automaton.

Maximilien Colange's avatar
Maximilien Colange committed
8 9

10 11 12 13 14 15 16
  - Option "a" of print_dot(), 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.

Maximilien Colange's avatar
Maximilien Colange committed
17 18 19
  - cleanup_parity() and cleanup_parity_here() are smarter and now
    remove from the acceptance condition the parity colors that are
    not used in the automaton.

21 22 23 24 25
  - 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
    that we want to purge.

26 27 28 29
  - the PSL simplification routines learned that {SERE;1} can be
    simplified to {1} or {SERE} depending on whether SERE accepts
    the empty word or not.

30 31 32 33 34
  - 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 slight generalizations of some constructions proposed
    by J. Esparza, J. Křentínský, and S. Sickert (LICS'18).
36 37 38 39 40 41

    These are now used by the main translation routine, and can be
    disabled by passing -x '!gf-guarantee' to ltl2tgba.  As an
    example, the translation of GF(a <-> XXb) to transition-based
    Büchi went from 9 to 5 states using that construction.

42 43 44 45 46 47 48 49 50
  - 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.  The python
    bindings for sat_minimize() now have a display_log and return_log
    options; there are demonstrated on the new page.

51 52 53 54 55
  Bugs fixed:

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

56 57 58
  - Fix cryptic error message from Python's spot.translate() and
    spot.postprocess() when supplying conflicting arguments.

59 60 61
  - "autfilt -B --sat-minimize" was incorrectly producing
    transition-based automata.

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

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

67 68 69 70 71 72
  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
  - remove_fin() and streett_to_generalized_buchi() should never
74 75
    return automata with "f" acceptance.

76 77 78
  - "autfilt --acceptance-is=Fin-less" no longer accept automata
    with "f" acceptance.

79 80 81
  - twa_run methods will now diagnose cases where the cycle is
    unexpectedly empty instead of segfaulting.

82 83 84 85 86 87 88 89
  - 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
New in spot 2.5.1 (2018-02-20)

Maximilien Colange's avatar
Maximilien Colange committed
92 93 94 95

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

96 97
  Bugs fixed:

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

100 101 102
  - 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).

104 105 106 107 108 109
  - 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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
110 111 112 113
  - 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
114 115
    condition (by merging identical set) of some automaton prior to
    converting it to Büchi.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed

117 118
  - dnf_to_dca() was mishandling some Rabin-like input.

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

121 122

Maximilien Colange's avatar
Maximilien Colange committed
  - We no longer distribute the doxygen-generated documentation in
124 125 126 127 128
    the tarball of Spot to save space.  This documentation is still
    available online at  If you
    want to build a local copy you can configure Spot with
    --enable-doxygen, or simply run "cd doc && make doc".

129 130 131
  - All the images that illustrate the documentation have been
    converted to SVG, to save space and improve quality.

132 133

134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150
  - ltlsynt is a new tool for synthesizing a controller from LTL/PSL

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

151 152 153
  - 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
154 155
    recognize a superset of the input.  Currently, the output is
    always state-based.

157 158 159
  - 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:
160 161
    --gf-equiv=RANGE       (GFa1 & GFa2 & ... & GFan) <-> GFz
    --gf-implies=RANGE     (GFa1 & GFa2 & ... & GFan) -> GFz
162 163 164 165
    --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})|(...))

167 168
  - autfilt learned --streett-like to convert automata with DNF
    acceptance into automata with Streett-like acceptance.

170 171 172 173 174
  - 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.

175 176
  - ltldo learned to limit the number of automata it outputs using -n.

177 178
  - ltlfilt learned to measure wall-time using --format=%r, and
    cpu-time with --format=%R.

180 181
  - The --format=%g option of tools that output automata used to
    print the acceptance condition as a *formula* in the HOA format.
    This %g may now take optional arguments to print the acceptance
183 184 185 186 187 188 189 190
    *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.

191 192 193
  - Tools that produce formulas now support --format=%[OP]n to
    display the nesting depth of operator OP.

194 195
  - 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
    spot-x(7) man page for details.

198 199
  - 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
    conditions. See the spot-x(7) man page for details.

202 203
  New functions in the library:

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

209 210 211 212 213 214 215 216 217 218 219
  - 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
220 221
    automata.  spot::to_dca() and spot::to_nca() dispatch between
    these four functions.  The language of produced automaton includes
222 223
    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
    paper.  Currently only supports state-based output.

Maximilien Colange's avatar
Maximilien Colange committed
  - spot::scc_info::states_on_acc_cycle_of() returns all states
227 228 229 230 231 232 233 234 235 236
    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
    (i.e., every transition belongs to exactly one acceptance set).

Maximilien Colange's avatar
Maximilien Colange committed
  - spot::change_parity() converts between different parity acceptance

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

Maximilien Colange's avatar
Maximilien Colange committed
  - spot::cleanup_parity_acceptance() simplifies a parity acceptance

249 250 251
  - spot::parity_product() and spot::parity_product_or() are
    specialized (but expensive) products that preserve parity

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

257 258
  - spot::stutter_invariant_states(),
Maximilien Colange's avatar
Maximilien Colange committed
    spot::highlight_stutter_invariant_states(), ...  These functions
260 261
    help study a stutter-sensitive automaton and detect the subset of
    states that are stutter-invariant.  See
262 for examples.

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

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

272 273
  - spot::nesting_depth() computes the nesting depth of any LTL

275 276
  - spot::check_determinism() sets both prop_semi_deterministic()
    and prop_universal() appropriately.

278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297
  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

  - 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
    and fixed before returning the automaton.  A new optional
299 300 301 302 303 304 305 306 307 308 309 310 311
    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

312 313 314 315
  - spot::postprocessor::set_type() can now request co-Büchi
    acceptance as output.  This calls the aforementioned to_nca() or
    to_dca() functions.

316 317 318 319 320 321 322
  - spot::remove_fin() will now call simplify_acceptance(),
    introduced in 2.4, before attempting its different Fin-removal

  - spot::simplify_acceptance() was already merging identical
    acceptance sets, and detecting complementary sets i and j to
    perform the following simplifications
323 324 325 326 327 328 329
      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

330 331 332 333
  - spot::formula::map(fun) and spot::formula::traverse(fun) will
    accept additionnal arguments and pass them to fun().  See for some examples.

  Python-specific changes:
335 336

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

339 340 341 342
  - 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

343 344
  - The test suite is now using v4 of the Jupyter Notebook format.

345 346 347 348
  - 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.

349 350 351 352 353
  Deprecation notices:

  (These functions still work but compilers emit warnings.)

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

358 359 360
  Backward incompatible changes:

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

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

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

374 375
  Bugs fixed:

376 377 378 379
  - 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().

381 382 383 384
  - 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).

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

388 389 390 391
  - 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
New in spot 2.4.4 (2017-12-25)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed

394 395 396 397 398 399
  Bugs fixed:

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

400 401 402 403
  - 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.

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  Bugs fixed:
408 409 410 411

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

412 413
  - Some mismatched placement-new/delete reported by ASAN were fixed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
414 415 416 417 418 419 420
  - 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
421 422 423 424 425
New in spot 2.4.2 (2017-11-07)


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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
427 428 429 430 431
  Bugs fixed:

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

432 433 434
  - 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
New in spot 2.4.1 (2017-10-05)

437 438
  Bugs fixed:

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

442 443 444 445 446 447 448 449 450 451
  - 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
Maximilien Colange committed
452 453 454 455
  - 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.

Maximilien Colange's avatar
Maximilien Colange committed
457 458
  - spot::simulation() could incorrectly flag an automaton as

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

462 463 464 465 466 467 468 469 470 471 472

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

473 474

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
475 476 477 478 479 480 481 482
  - genaut is a new binary that produces families of automata defined
    in the literature (in the same way as we have genltl for LTL

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

  - genltl learned two generate two new families of formulas:
484 485 486 487 488 489
      --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).

  - autfilt learned to build the union (--sum) or the intersection
Maximilien Colange's avatar
Maximilien Colange committed
491 492
    (--sum-and) of two languages by putting two automata side-by-side
    and fiddling with the initial states.  This complements the already
493 494
    implemented intersection (--product) and union (--product-or),
    both based on a product.

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

499 500 501 502
  - autfilt learned --split-edges to convert labels that are Boolean
    formulas into labels that are min-terms.  (See spot::split_edges()

503 504 505
  - autfilt learned --simplify-acceptance to simplify some acceptance
    conditions.  (See spot::simplify_acceptance() below.)

506 507 508 509
  - 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.)

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

513 514 515 516 517 518
  - 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.

519 520

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

  - spot::sum() and spot::sum_and() implements the union and the
    intersection of two automata by putting them side-by-side and
    using non-deterministim or universal branching on the initial

529 530 531
  - twa objects have a new property: prop_complete().  This obviously
    acts as a cache for the is_complete() function.

Maximilien Colange's avatar
Maximilien Colange committed
  - spot::dualize() complements any alternating automaton.  Since
533 534 535
    the dual of a deterministic automaton is still deterministic, the
    function spot::dtwa_complement() has been deprecated and simply
    calls spot::dualize().

537 538 539 540 541 542
  - 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

543 544
  - The print_dot() function will now display names for well known
    acceptance conditions under the formula when option 'a' is used.
545 546
    We plan to enable 'a' by default in a future release, so a new
    option 'A' has been added to hide the acceptance condition.

548 549 550 551 552
  - The print_dot() function has a new experimental option 'x' to
    output labels are LaTeX formulas.  This is meant to be used in
    conjunction with the dot2tex tool.  See

553 554 555 556
  - A new named property for automata called "original-states" can be
    used to record the origin of a state before transformation.  It is
    currently defined by the degeneralization algorithms, and by
    transform_accessible() and algorithms based on it (like
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
557 558 559 560 561
    remove_ap::strip(), decompose_scc()).  This is realy meant as an
    aid for writing algorithms that need this mapping, but it can also
    be used to debug these algorithms: the "original-states"
    information is displayed by the dot printer when the 'd' option is
    passed.  For instance in
562 563 564 565 566 567 568

      % ltl2tgba 'GF(a <-> Fb)' --dot=s
      % ltl2tgba 'GF(a <-> Fb)' | autfilt -B --dot=ds

    the second command outputs an automaton with states that show
    references to the first one.

569 570 571 572
  - A new named property for automata called "degen-levels" keeps track
    of the level of a state in a degeneralization. This information
    complements the one carried in "original-states".

573 574 575 576 577
  - A new named property for automata called "simulated-states" can be
    used to record the origin of a state through simulation. The
    behavior is similar to "original-states" above. Determinization
    takes advantage of this in its pretty print.

578 579 580 581 582 583
  - The new function spot::acc_cond::is_streett_like() checks whether
    an acceptance condition is conjunction of disjunctive clauses
    containing at most one Inf and at most one Fin.  It builds a
    vector of pairs to use if we want to assume the automaton has
    Streett acceptance.  The dual function is
    spot::acc_cond::is_rabin_like() works similarly.

585 586 587 588 589
  - The degeneralize() function has learned to consider acceptance
    marks common to all edges comming to a state to select its initial
    level.  A similar trick was already used in sbacc(), and saves a
    few states in some cases.

590 591 592 593 594 595 596
  - There is a new spot::split_edges() function that transforms edges
    (labeled by Boolean formulas over atomic propositions) into
    transitions (labeled by conjunctions where each atomic proposition
    appear either positive or negative).  This can be used to
    preprocess automata before feeding them to algorithms or tools
    that expect transitions labeled by letters.

597 598 599
  - spot::scc_info has two new methods to easily iterate over the
    edges of an SCC: edges_of() and inner_edges_of().

600 601 602
  - spot::scc_info can now be passed a filter function to ignore
    or cut some edges.

603 604 605 606 607
  - spot::scc_info now keeps track of acceptance sets that are common
    to all edges in an SCC.  These can be retrieved using
    scc_info::common_sets_of(scc), and they are used by scc_info to
    classify some SCCs as rejecting more easily.

608 609 610 611 612 613
  - The new function acc_code::remove() removes all the given
    acceptance sets from the acceptance condition.

  - It is now possible to change an automaton acceptance condition
    directly by calling twa::set_acceptance().

614 615 616 617 618
  - spot::cleanup_acceptance_here now takes an additional boolean
    parameter specifying whether to strip useless marks from the
    automaton.  This parameter is defaulted to true, in order to
    keep this modification backward-compatible.

619 620 621 622
  - The new function spot::simplify_acceptance() is able to perform
    some simplifications on an acceptance condition, and might lead
    to the removal of some acceptance sets.

  - The function spot::streett_to_generalized_buchi() is now able to
    work on automata with Streett-like acceptance.

626 627 628 629 630
  - The function for converting deterministic Rabin automata to
    deterministic Büchi automata (when possible), internal to the
    remove_fin() procedure, has been updated to work with
    transition-based acceptance and with Rabin-like acceptance.

631 632 633 634
  - spot::relabel_here() was used on automata to rename atomic
    propositions, it can now replace atomic propositions by Boolean
    subformula.  This makes it possible to use relabeling maps
    produced by relabel_bse() on formulas.

636 637 638 639
  - twa_graph::copy_state_names_from() can be used to copy the state
    names from another automaton, honoring "original-states" if

640 641
  - Building automata for LTL formula with a large number N of atomic
    propositions can be costly, because several loops and
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
    data-structures are exponential in N.  However a formula like
643 644 645 646 647 648 649 650
      ((a & b & c) | (d & e & f)) U ((d & e & f) | (g & h & i))
    can be translated more efficiently by first building an automaton
    for (p0 | p1) U (p1 | p2), and then substituting p0, p1, p2 by the
    appropriate Boolean formula.  Such a trick is now attempted
    for translation of formulas with 4 atomic propositions or
    more (this threshold can be changed, see -x relabel-bool=N in
    the spot-x(7) man page).

651 652 653 654
  - The LTL simplification routines learned that an LTL formula like
    G(a & XF(b & XFc & Fd) can be simplified to G(a & Fb & Fc & Fd),
    and dually F(a | XG(b | XGc | Gd)) = F(a | Gb | Gc | Gd).

655 656 657 658
    When working with SERE, the simplification of "expr[*0..1]" was
    improved.  E.g. {{a[*]|b}[*0..1]} becomes {a[*]|b} instead of

659 660 661 662
  - The new function spot::to_weak_alternating() is able to take an
    input automaton with generalized Büchi/co-Büchi acceptance and
    convert it to a weak alternating automaton.

663 664
  - spot::sbacc() is can now also convert alternating automata
    to state-based acceptance.

666 667 668
  - spot::sbacc() and spot::degeneralize() learned to merge
    accepting sinks.

  - If the SPOT_BDD_TRACE environment variable is set, statistics
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
670 671
    about BDD garbage collection and table resizing are shown.

  - The & and | operators for acceptannce conditions have been changed
    slightly to be more symmetrical.  In older versions, operator &
674 675 676 677
    would move Fin() terms to the front, but that is not the case
    anymore.  Also operator & was already grouping all Inf() terms
    (for efficiency reasons), in this version operator | is
    symmetrically grouping all Fin() terms.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed

679 680 681 682
  - The automaton parser is now reentrant, making it possible to
    process automata from different streams at the same time (i.e.,
    using multiple spot::automaton_stream_parser instances at once).

683 684 685 686 687 688 689 690 691
  - The print_hoa() and parse_automaton() functions have been updated
    to recognize the "exist-branch" property of the non-released HOA
    v1.1, as well as the new meaning of property "deterministic".  (In
    HOA v1 "properties: deterministic" means that the automaton has no
    existential branching; in HOA v1.1 it disallows universal
    branching as well.)  The meaning of "deterministic" in Spot has
    been adjusted to these new semantics, see "Backward-incompatible
    changes" below.

Maximilien Colange's avatar
Maximilien Colange committed
  - The parser for HOA now recognizes and verifies correct use of the
    "univ-branch" property.  This is known to be a problem with option
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
    -H1 of ltl3ba 1.1.2 and ltl3dra 0.2.4, so the environment variable
695 696
    SPOT_HOA_TOLERANT can be set to disable the diagnostic.

697 698 699 700 701

  - The 'spot.gen' package exports the functions from libspotgen.
    See for examples.

702 703 704 705
  Bugs fixed:

  - When the remove_fin() function was called on some automaton with
    Inf-less acceptance involving at least one disjunction (e.g.,
Maximilien Colange's avatar
Maximilien Colange committed
    generalized co-Büchi), it would sometimes output an automaton with
707 708
    transition-based acceptance but marked as state-based.

709 710
  - The complete() function could complete an empty co-Büchi automaton
    into an automaton accepting everything.

712 713 714 715 716 717 718 719 720 721
  Backward-incompatible changes:

  - spot::acc_cond::mark_t::operator bool() has been marked as
    explicit.  The implicit converion to bool (and, via bool, to int)
    was a source of bugs.

  - spot::twa_graph::set_init_state(const state*) has been removed.
    It was never used.  You always want to use
    spot::twa_graph::set_init_state(unsigned) in practice.

722 723 724 725 726 727 728
  - The previous implementation of spot::is_deterministic() has been
    renamed to spot::is_universal().  The new version of
    spot::is_deterministic() requires the automaton to be both
    universal and existential.  This should not make any difference in
    existing code unless you work with the recently added support for
    alternating automata.

729 730 731
  - spot::acc_cond::mark_t::sets() now returns an internal iterable
    object instead of an std::vector<unsigned>.

732 733 734 735
  - The color palette optionally used by print_dot() has been extended
    from 9 to 16 colors.  While the first 8 colors are similar, they
    are a bit more saturated now.

  deprecation notices:

  (these functions still work but compilers emit warnings.)

740 741 742
  - spot::decompose_strength() is deprecated, it has been renamed
    to spot::decompose_scc().

  - spot::dtwa_complement() is deprecated.  prefer the more generic
744 745
    spot::dualize() instead.

  - the spot::twa::prop_deterministic() methods have been renamed to
    spot::twa::prop_universal() for consistency with the change to
    is_deterministic() listed above.  we have kept
749 750
    spot::twa::prop_deterministic() as a deprecated synonym for
    spot::twa::prop_universal() to help backward compatibility.

  - the spot::copy() function is deprecated.  use
753 754
    spot::make_twa_graph() instead.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
New in spot 2.3.5 (2017-06-22)

757 758
  Bugs fixed:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - We have fixed new cases where translating multiple formulas in a
760 761
    single ltl2tgba run could produce automata different from those
    produced by individual runs.

763 764 765 766 767
  - The print_dot() function had a couple of issues when printing
    alternating automata: in particular, when using flag 's' (display
    SCC) or 'y' (split universal destination by colors) universal
    edges could be connected to undefined states.

768 769 770 771 772 773
  - Using --stats=%s or --stats=%s or --stats=%t could take an
    unnecessary long time on automata with many atomic propositions,
    due to a typo.  Furthermore, %s/%e/%t/%E/%T were printing
    a number of reachable states/edges/transitions, but %S was
    incorrectly counting all states even unreachable.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
774 775 776
  - Our verson of BuDDy had an incorrect optimization for the
    biimp operator.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
New in spot 2.3.4 (2017-05-11)

779 780
  Bugs fixed:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - The transformation to state-based acceptance (spot::sbacc()) was
    incorrect on automata where the empty acceptance mark is accepting.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - The --help output of randaut and ltl2tgba was showing an
785 786
    unsupported %b stat.

787 788 789
  - ltldo and ltlcross could leave temporary files behind when
    aborting on error.

790 791 792 793
  - The LTL simplifcation rule that turns F(f)|q into F(f|q)
    when q is a subformula that is both eventual and universal
    was documented but not applied in some forgotten cases.

794 795 796 797
  - Because of some caching inside of ltl2tgba, translating multiple
    formula in single ltl2tgba run could produce automata different
    from those produced by individual runs.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
New in spot 2.3.3 (2017-04-11)

800 801 802 803 804

  - ltldo and ltlcross learned shorthands to talk to ltl2da, ltl2dpa,
    and ltl2ldba (from Owl) without needing to specify %f>%O.

  - genltl learned --spec-patterns as an alias for --dac-patterns; it
806 807 808
    also learned two new sets of LTL formulas under --hkrss-patterns
    (a.k.a. --liberouter-patterns) and --p-patterns
    (a.k.a. --beem-patterns).

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  Bugs fixed:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
812 813
  - In "lenient" mode the formula parser would fail to recover from a
    missing closing brace.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
815 816
  - The output of 'genltl --r-left=1 --r-right=1 --format=%F' had

818 819 820 821
  - 'ltl2tgba Fa | autfilt --complement' would incorrectly claim that
    the output is "terminal" because dtwa_complement() failed to reset
    that property.

822 823 824
  - spot::twa_graph::purge_unreachable_states() was misbehaving on
    alternating automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
825 826
  - In bench/stutter/ the .cc files were not compiling due to warnings
    being caught as errors.

828 829 830 831 832 833
  - The code in charge of detecting DBA-type Rabin automata is
    actually written to handle a slightly larger class of acceptance
    conditions (e.g., Fin(0)|(Fin(1)&Inf(2))), however it failed to
    correctly detect DBA-typeness in some of these non-Rabin

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
New in spot 2.3.2 (2017-03-15)

836 837

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - In tools that output automata, the number of atomic propositions
    can be output using --stats=%x (output automaton) or --stats=%X
    (input automaton).  Additional options can be passed to list
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
    atomic propositions instead of counting them.  Tools that output
    formulas also support --format=%x for this purpose.

844 845

846 847
  - The bdd_to_formula(), and to_generalized_buchi() functions can now
    be called in Python.

849 850 851 852 853

  - is a new page describing
    how to build monitors in Shell, Python, or C++.

854 855 856 857 858
  Bugs fixed:

  - The tests using LTSmin's patched version of divine would fail
    if the current (non-patched) version of divine was installed.

859 860 861
  - Because of a typo, the output of --stats='...%P...' was correct
    only if %p was used as well.

862 863 864
  - genltl was never meant to have (randomly attributed) short
    options for --postive and --negative.

865 866 867 868
  - a typo in the code for transformating transition-based acceptance
    to state-based acceptance could cause a superfluous initial state
    to be output in some cases (the result was still correct).

869 870
  - 'ltl2tgba --any -C -M ...' would not complete automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - While not incorrect, the HOA properties output by 'ltl2tgba -M'
872 873 874 875
    could be 'inherently-weak' or 'terminal', while 'ltl2tgba -M -D'
    would always report 'weak' automata.  Both variants now report the
    most precise between 'weak' or 'terminal'.

876 877 878
  - spot::twa_graph::set_univ_init_state() could not be called with
    an initializer list.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - The Python wrappers for spot::twa_graph::state_from_number and
880 881
    spot::twa_graph::state_acc_sets were broken in 2.3.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  - Instantiating an emptiness check on an automaton with unsupported
883 884 885 886
    acceptance condition should throw an exception.  This used to be
    just an assertion, disabled in release builds; the difference
    matters for the Python bindings.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
  Deprecation notice:
888 889 890 891

  - Using --format=%a to print the number of atomic propositions in
    ltlfilt, genltl, and randltl still works, but it is not documented
    anymore and should be replaced by the newly-introduced --format=%x
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
892 893
    for consistency with tools producing automata, where %a means
    something else.


Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
New in spot 2.3.1 (2017-02-20)

898 899 900 901 902 903

  - ltldo learnt to act like a portfolio: --smallest and --greatest
    will select the best output automaton for each formula translated.
    See for examples.

904 905 906
  - The colors used in the output of ltlcross have been adjusted to
    work better with white backgrounds and black backgrounds.

907 908 909
  - The option (y) has been added to --dot. It splits the universal
    edges with the same targets but different colors.

910 911 912 913 914
  - genltl learnt three new families for formulas: --kr-n2=RANGE,
    --kr-nlogn=RANGE, and --kr-n=RANGE.  These formulas, from
    Kupferman & Rosenberg [MoChArt'10] are recognizable by
    deterministic Büchi automata with at least 2^2^n states.

915 916 917 918

  - spot::twa_run::as_twa() has an option to preserve state names.

919 920 921 922
  - the method spot::twa::is_alternating(), introduced in Spot 2.3 was
    badly named and has been deprecated.  Use the negation of the new
    spot::twa::is_existential() instead.

923 924 925 926 927 928 929
  Bugs fixed:

  - spot::otf_product() was incorrectly registering atomic

  - spot::ltsmin_model::kripke() forgot to register the "dead"

931 932 933 934 935 936
  - The spot::acc_word type (used to construct acceptance condition)
    was using some non-standard anonymous struct.  It is unlikely that
    this type was actually used outside Spot, but if you do use it,
    spot::acc_word::op and spot::acc_word::type had to be renamed as
    spot::acc_word::sub.op and spot::acc_word::sub.type.

937 938 939
  - alternation_removal() was not always reporting the unsupported
    non-weak automata.

940 941 942 943
  - a long-standing typo in the configure code checking for Python
    caused any user-defined CPPFLAGS to be ignored while building

944 945 946 947
  - The display of clusters with universal edges was confused, because the
    intermediate node was not in the cluster even if one of the target was
    in the same one.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
New in spot 2.3 (2017-01-19)

950 951 952 953 954 955 956 957 958 959 960

  * While Spot only relies on C++11 features, the configure script
    learned --enable-c++14 to compile in C++14 mode.  This allows us
    check that nothing breaks when we will switch to C++14.

  * Spot is now distributed with PicoSAT 965, and uses it for
    SAT-based minimization of automata without relying on temporary
    files.  It is still possible to use an external SAT solver by
    setting the SPOT_SATSOLVER environment variable.

961 962 963
  * The development Debian packages for Spot now install static
    libraries as well.

964 965
  * We now install configuration files for users of pkg-config.

966 967

968 969 970
  * ltlcross supports translators that output alternating automata in
    the HOA format.  Cross-comparison checks will only work with weak
    alternating automata (not necessarily *very* weak), but "ltlcross
971 972
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.

974 975 976 977 978 979
  * autfilt can read alternating automata.  This is still experimental
    (see below). Some of the algorithms proposed by autfilt will
    refuse to work because they have not yet been updated to work with
    alternating automata, but in any case they should display a
    diagnostic: if you see a crash, please report it.

980 981 982
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

983 984
  * the --check option of autfilt/ltl2tgba/ltldo/dstar2tgba can now
    take "semi-determinism" as argument.

  * autfilt --highlight-languages will color states that recognize
    identical languages.  (Only works for deterministic automata.)

989 990 991 992 993
  * 'autfilt --sat-minimize' and 'ltl2tgba -x sat-minimize' have
    undergone some backward incompatible changes.  They use binary
    search by default, and support different options than they used
    too.  See spot-x(7) for details.  The defaults are those that were
    best for the benchmark in bench/dtgbasat/.

995 996 997 998
  * ltlfilt learned --recurrence and --persistence to match formulas
    belonging to these two classes of the temporal hierarchy.  Unlike
    --syntactic-recurrence and --syntactic-persistence, the new checks
    are automata-based and will also match pathological formulas.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed

  * The --format option of ltlfilt/genltl/randltl/ltlgrind learned to
    print the class of a formula in the temporal hierarchy of Manna &
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
    Pnueli using %h.  See

1005 1006 1007 1008 1009 1010
  * ltldo and ltlcross learned a --relabel option to force the
    relabeling of atomic propositions to p0, p1, etc.  This is more
    useful with ltldo, as it allows calling a tool that restricts the
    atomic propositions it supports, and the output automaton will
    then be fixed to use the original atomic propositions.

1011 1012 1013
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

1014 1015 1016

  * A twa is required to have at least one state, the initial state.
1017 1018
    An automaton can only be empty while it is being constructed,
    but should not be passed to other algorithms.

  * Couvreur's emptiness check has been rewritten to use the explicit
1021 1022
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
1023 1024 1025
    automata.  Overall, this new version is roughly 4x faster on
    explicit automata than the former one.  The old version has been
    kept for backward compatibility, but will be removed eventually.

  * The new version of the Couvreur emptiness check is now the default
1028 1029
    one, used by twa::is_empty() and twa::accepting_run().  Always
    prefer these functions over an explicit call to Couvreur.

1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048
  * experimental support for alternating automata:

    - twa_graph objects can now represent alternating automata.  Use
      twa_graph::new_univ_edge() and twa_graph::set_univ_init_state()
      to create universal edges an initial states; and use
      twa_graph::univ_dests() to iterate over the universal
      destinations of an edge.

    - the automaton parser will now read alternating automata in the
      HOA format.  The HOA and dot printers can output them.

    - the file twaalgos/alternation.hh contains a few algorithms
      specific to alternating automata:
      + remove_alternation() will transform *weak* alternating automata
        into TGBA.
      + the class outedge_combiner can be used to perform "and" and "or"
        on the outgoing edges of some alternating automaton.

    - scc_info has been adjusted to handle universal edges as if they
1050 1051 1052
      were existential edges.  As a consequence, acceptance
      information is not accurate.

1053 1054 1055 1056 1057 1058 1059
    - postprocessor will call remove_alternation() right away, so
      it can be used as a way to transform alternating automata
      into different sub-types of (generalized) Büchi automata.
      Note that although prostprocessor optimize the resulting
      automata, it still has no simplification algorithms that work
      at the alternating automaton level.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1060 1061 1062
    - See and for some code examples.

1064 1065 1066 1067
  * twa objects have two new properties, very-weak and
    semi-deterministic, that can be set or retrieved via
    twa::prop_very_weak()/twa::prop_semi_deterministic(), and that can
    be tested by is_very_weak_automaton()/is_semi_deterministic().

1069 1070 1071 1072 1073 1074
  * twa::prop_set has a new attribute used in twa::prop_copy() and
    twa::prop_keep() to indicate that determinism may be improved by
    an algorithm.  In other words properties like
    deterministic/semi-deterministic/unambiguous should be preserved
    only if they are positive.

  * language_map() and highlight_languages() are new functions that
    implement autfilt's --highlight-languages option mentionned above.

  * dtgba_sat_minimize_dichotomy() and dwba_sat_minimize_dichotomy()
    use language_map() to estimate a lower bound for binary search.

  * The encoding part of SAT-based minimization consumes less memory.

1083 1084 1085 1086
  * SAT-based minimization of automata can now be done using two
    incremental techniques that take a solved minimization and attempt
    to forbid the use of some states.  This is done either by adding
    clauses, or by using assumptions.

1088 1089 1090 1091
  * If the environment variable "SPOT_XCNF" is set during incremental
    SAT-based minimization, XCNF files suitable for the incremental SAT
    competition will be generated.  This requires the use of an exteral
    SAT solver, setup with "SPOT_SATSOLVER".  See spot-x(7).

1093 1094 1095
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

1096 1097 1098 1099 1100 1101 1102 1103 1104

  * spot.show_mp_hierarchy() can be used to display the membership of
    a formula to the Manna & Pnueli hierarchy, in notebooks.  An
    example is in

  * The on-line translator will now display the temporal hierarchy
    in the "Formula > property information" output.

Bugs fixed:
1106 1107 1108 1109 1110 1111 1112 1113

  * The minimize_wdba() function was not correctly minimizing automata
    with useless SCCs.  This was not an issue for the LTL translation
    (where useless SCCs are always removed first), but it was an issue
    when deciding if a formula was safety or guarantee.  As a
    consequence, some tricky safety or guarantee properties were only
    recognized as obligations.

1114 1115 1116 1117
  * When ltlcross was running a translator taking the Spin syntax as
    input (%s) it would not automatically relabel any unsupported
    atomic propositions as ltldo already do.