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

3 4
  Tools:

5 6 7 8 9
  - autfilt learned to build the union (--sum) or the intersection
    (--sum-and) of two language by putting two automata side-by-side
    and fiddling with the initial states.  This complement the already
    implemented intersection (--product) and union (--product-or),
    both based on a product.
10

11 12
  - autfilt learned to complement any alternating automaton with
    option --dualize.
Thomas Medioni's avatar
Thomas Medioni committed
13

14 15
  - genaut is a binary to produce families of automata defined in the
    literature (in the same way as we have genltl for LTL formulas).
Maximilien Colange's avatar
Maximilien Colange committed
16

17 18 19 20
  - autfilt learned --split-edges to convert labels that are Boolean
    formulas into labels that are min-terms.  (See spot::split_edges()
    below.)

21 22
  Library:

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

26
  - spot::sum() and spot::sum_and() implements the union and the
27 28 29
    intersection of two automatons by putting them side-by-side and
    using non-deterministim or universal branching on the initial
    statae.
30

31 32 33
  - twa objects have a new property: prop_complete().  This obviously
    acts as a cache for the is_complete() function.

34 35 36 37
  - spot::dualize() completements any alternating automaton.  Since
    the dual of a deterministic automaton is still deterministic, the
    function spot::dtwa_complement() has been deprecated and simply
    calls spot::dualize().
38

39 40
  - spot::dtwa_complement now simply returns the result of dualize()

41 42 43 44 45 46 47 48 49
  - 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
    remove_ap::strip(), decompose_strength(), 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
50 51 52 53 54 55 56

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

57 58 59 60 61 62
  - 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.
63

64 65 66 67 68
  - 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.

69 70 71 72 73 74 75
  - 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.

76 77
  Python:

78 79
  - The 'spot.gen' package exports the functions from libspotgen.
    See https://spot.lrde.epita.fr/ipynb/gen.html for examples.
80

81 82 83 84
  - twa_graph::copy_state_names_from() can be used to copy the state
    names from another automaton, honoring "original-states" if
    present.

85 86 87 88 89
  Bugs fixed:

  - the transformation to state-based acceptance (spot::sbacc()) was
    incorrect on automata where the empty acceptance mark is accepting.

90 91 92
  - the --help output of randaut and ltl2tgba was showing an
    unsupported %b stat.

93 94 95
  - ltldo and ltlcross could leave temporary files behind when
    aborting on error.

96 97 98 99 100 101 102 103 104 105
  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.

106 107 108 109 110 111 112
  - 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.

113 114 115
  - spot::acc_cond::mark_t::sets() now returns an internal iterable
    object instead of an std::vector<unsigned>.

116 117
  Deprecation notice:

118 119 120 121 122 123 124 125
  - spot::dtwa_complement() is deprecated.  Prefer the more generic
    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
    spot::twa::prop_deterministic() as a deprecated synonym for
    spot::twa::prop_universal() to help backward compatibility.
126

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

129 130 131 132 133
  Tools:

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

134
  - genltl learned --spec-patterns as an alias for --dac-patterns; it
135 136 137
    also learned two new sets of LTL formulas under --hkrss-patterns
    (a.k.a. --liberouter-patterns) and --p-patterns
    (a.k.a. --beem-patterns).
138

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
144 145
  - The output of 'genltl --r-left=1 --r-right=1 --format=%F' had
    typos.
146

147 148 149 150
  - 'ltl2tgba Fa | autfilt --complement' would incorrectly claim that
    the output is "terminal" because dtwa_complement() failed to reset
    that property.

151 152 153
  - spot::twa_graph::purge_unreachable_states() was misbehaving on
    alternating automata.

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

157 158 159 160 161 162
  - 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
    acceptance.

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

165 166
  Tools:

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

173 174
  Python:

175 176
  - The bdd_to_formula(), and to_generalized_buchi() functions can now
    be called in Python.
177

178 179 180 181 182
  Documentation:

  - https://spot.lrde.epita.fr/tut11.html is a new page describing
    how to build monitors in Shell, Python, or C++.

183 184 185 186 187
  Bugs fixed:

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

188 189 190
  - Because of a typo, the output of --stats='...%P...' was correct
    only if %p was used as well.

191 192 193
  - genltl was never meant to have (randomly attributed) short
    options for --postive and --negative.

194 195 196 197
  - 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).

198 199
  - 'ltl2tgba --any -C -M ...' would not complete automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
200
  - While not incorrect, the HOA properties output by 'ltl2tgba -M'
201 202 203 204
    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'.

205 206 207
  - spot::twa_graph::set_univ_init_state() could not be called with
    an initializer list.

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
211
  - Instantiating an emptiness check on an automaton with unsupported
212 213 214 215
    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
216
  Deprecation notice:
217 218 219 220

  - 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
221 222
    for consistency with tools producing automata, where %a means
    something else.
223

224

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

227 228 229 230 231 232
  Tools:

  - ltldo learnt to act like a portfolio: --smallest and --greatest
    will select the best output automaton for each formula translated.
    See https://spot.lrde.epita.fr/ltldo.html#portfolio for examples.

233 234 235
  - The colors used in the output of ltlcross have been adjusted to
    work better with white backgrounds and black backgrounds.

236 237 238
  - The option (y) has been added to --dot. It splits the universal
    edges with the same targets but different colors.

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

244 245 246 247 248
  - autfilt has a new transformation: --decompose-scc, which allows
    decomposition of automata through their accepting SCCs.
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html

249 250 251 252
  Library:

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

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

257 258 259 260 261 262 263
  Bugs fixed:

  - spot::otf_product() was incorrectly registering atomic
    propositions.

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

265 266 267 268 269 270
  - 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.

271 272 273
  - alternation_removal() was not always reporting the unsupported
    non-weak automata.

274 275 276 277
  - a long-standing typo in the configure code checking for Python
    caused any user-defined CPPFLAGS to be ignored while building
    Spot.

278 279 280 281
  - 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
282
New in spot 2.3 (2017-01-19)
283

284 285 286 287 288 289 290 291 292 293 294
  Build:

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

295 296 297
  * The development Debian packages for Spot now install static
    libraries as well.

298 299
  * We now install configuration files for users of pkg-config.

300 301
  Tools:

302 303 304
  * 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
305 306
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.
307

308 309 310 311 312 313
  * 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.

314 315 316
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

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

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

323 324 325 326 327
  * '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/.
328

329 330 331 332
  * 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
333
    See https://spot.lrde.epita.fr/hierarchy.html
334

335
  * The --format option of ltlfilt/genltl/randltl/ltlgrind learned to
336
    print the class of a formula in the temporal hierarchy of Manna &
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
337
    Pnueli using %h.  See https://spot.lrde.epita.fr/hierarchy.html
338

339 340 341 342 343 344
  * 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.

345 346 347
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

348 349 350
  Library:

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

354
  * Couvreur's emptiness check has been rewritten to use the explicit
355 356
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
357 358 359
    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.
360

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

365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382
  * 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.

383
    - scc_info has been adjusted to handle universal edges as if they
384 385 386
      were existential edges.  As a consequence, acceptance
      information is not accurate.

387 388 389 390 391 392 393
    - 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
394 395 396
    - See https://spot.lrde.epita.fr/tut23.html
      https://spot.lrde.epita.fr/tut24.html and
      https://spot.lrde.epita.fr/tut31.html for some code examples.
397

398 399 400 401
  * 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().
402

403 404 405 406 407 408
  * 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.

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

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

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

417 418 419 420
  * 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.
421

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

427 428 429
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

430 431 432 433 434 435 436 437 438
Python:

  * 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 https://spot.lrde.epita.fr/ipynb/formulas.html

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

439
Bugs fixed:
440 441 442 443 444 445 446 447

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

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

452 453 454 455
  * When running "autfilt --sat-minimize" on a automaton representing
    an obligation property, the result would always be a complete
    automaton even without the -C option.

456 457 458
  * ltlcross --products=0 --csv should not output any product-related
    column in the CSV output since it has nothing to display there.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
459
New in spot 2.2.2 (2016-12-16)
460

461 462 463 464 465
  Build:

  * If the system has an installed libltdl library, use it instead of
    the one we distribute.

466 467 468 469
  Bug fixes:

  * scc_filter() had a left-over print statement that would print
    "names" when copying the name of the states.
470

471 472 473 474 475
  * is_terminal() should reject automata that have accepting
    transitions going into rejecting SCCs.  The whole point of
    being a terminal automaton is that reaching an accepting
    transition guarantees that any suffix will be accepted.

476 477 478 479 480
  * The HOA parser incorrectly read "Acceptance: 1 Bar(0)" as a valid
    way to specify "Acceptance: 1 Fin(0)" because it assumed that
    everything that was not Inf was Fin.  These errors are now
    diagnosed.

481 482 483 484
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

485 486 487
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

488 489 490
  * the on-line translator had a bug where a long ltl3ba process would
    continue running even after the script had timeout'ed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
491
New in spot 2.2.1 (2016-11-21)
492

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
493
  Bug fix:
494

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
495 496
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
497

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
498
New in spot 2.2 (2016-11-14)
499

500 501 502 503 504 505
  Command-line tools:

  * ltlfilt has a new option --from-ltlf to help reducing LTLf (i.e.,
    LTL over finite words) model checking to LTL model checking.  This
    is based on a transformation by De Giacomo & Vardi (IJCAI'13).

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
506 507 508 509
  * "ltldo --stats=%R", which used to display the serial number of the
    formula processed, was renamed to "ltldo --stats=%#" to free %R
    for the following feature.

510 511 512
  * autfilt, dstar2tgba, ltl2tgba, ltlcross, ltldo learned to measure
    cpu-time (as opposed to wall-time) using --stats=%R.  User or
    system time, for children or parent, can be measured separately by
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
513 514 515 516
    adding additional %[LETTER]R options.  The difference between %r
    (wall-clock time) and %R (CPU time) can also be used to detect
    unreliable measurements.  See
      https://spot.lrde.epita.fr/oaut.html#timing
517

518 519
  Library:

520 521 522
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

523
  * is_unambiguous() was rewritten in a more efficient way.
524

525
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
526
    of a single self-loop without resorting to remove_fin() for complex
527 528 529 530 531 532
    acceptance conditions.

  * remove_fin() has been improved to better deal with automata with
    "unclean" acceptance, i.e., acceptance sets that are declared but
    not used.  In particular, this helps scc_info to be more efficient
    at deciding the acceptance of SCCs in presence of Fin acceptance.
533

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
534 535
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
536 537 538
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

539 540
  * scc_filter() learned to preserve state names and highlighted states.

541 542 543 544 545
  * The BuDDy library has been slightly optimized: the initial setup
    of the unicity table can now be vectorized by GCC, and all calls
    to setjmp are now avoided when variable reordering is disabled
    (the default).

546 547 548 549 550 551 552 553
  * The twa class has three new methods:
      aut->intersects(other)
      aut->intersecting_run(other)
      aut->intersecting_word(other)
    currently these are just convenient wrappers around
      !otf_product(aut, other)->is_empty()
      otf_product(aut, other)->accepting_run()->project(aut)
      otf_product(aut, other)->accepting_word()
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
554 555 556
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
557

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
558
  Bug fixes:
559

560
  * ltl2tgba was always using the highest settings for the LTL
561 562 563 564
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

565 566 567
  * The int-vector compression code could encode 6 and 22 in the
    same way, causing inevitable issues in our LTSmin interface.
    (This affects tests/ltsmin/modelcheck with option -z, not -Z.)
568

569 570 571
  * str_sere() and str_utf8_sere() were not returning the same
    string that print_sere() and print_utf8_sere() would print.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
572
  * Running the LTL parser in debug mode would crash.
573

574
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
575
    when run with use_simulation=true (the default) on non-simplified
576 577
    automata.

578 579
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
580 581 582 583
    anymore.  Before that the spot.automata() python function used to
    close a file descriptor twice when reading from a pipe, and this
    led to crashes of the 0MQ library used by Jupyter, killing the
    Python kernel.
584

585 586 587
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
588 589 590
  * calling set_acceptance() several times on an automaton could
    result in unexpected behaviors, because set_acceptance(0,...)
    used to set the state-based acceptance flag automatically.
591

592
  * Some buffering issue caused syntax errors to be displayed out
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
593
    of place by the on-line translator.
594

595
New in spot 2.1.2 (2016-10-14)
596

597 598 599 600 601 602
  Command-line tools:

  * genltl learned 5 new families of formulas
    (--tv-f1, --tv-f2, --tv-g1, --tv-g2, --tv-uu)
    defined in Tabakov & Vardi's RV'10 paper.

603 604 605 606 607 608
  * ltlcross's --csv and --json output was changed to not include
    information about the ambiguity or strength of the automata by
    default.   Computing those can be costly and not needed by
    every user, so it should now be requested explicitely using
    options --strength and --ambiguous.

609 610 611 612 613 614 615 616
  Library:

  * New LTL simplification rule:

    - GF(f & q) = G(F(f) & q) if q is
      purely universal and a pure eventuality.  In particular
      GF(f & GF(g)) now ultimately simplifies to G(F(f) & F(g)).

617 618
  Bug fixes:

619
  * Fix spurious uninitialized read reported by valgrind when
620
    is_Kleene_star() is compiled by clang++.
621

622
  * Using "ltlfilt some-large-file --some-costly-filter" could take
623 624 625 626 627 628 629
    to a lot of time before displaying the first results, because the
    output of ltlfilt is buffered: the buffer had to fill up before
    being flushed.  The issue did not manifest when the input is
    standard input, because of the C++ feature that reading std::cin
    should flush std::cout; however it was well visible when reading
    from files.  Flushing is now done more regularly.

630 631 632 633
  * Fix compilation warnings when -Wimplicit-fallthrough it enabled.

  * Fix python errors on Darwin when using methods from the spot module
    inside of the spot.ltsmin submodule.
634

635 636
  * Fix ltlcross crash when combining --no-check with --verbose.

637 638 639
  * Adjust paths and options used in bench/dtgbasat/ to match the
    changes introduced in Spot 2.0.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
640
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
641

642 643 644
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
645
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
646 647
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
648 649 650 651
       genltl --dac --format='%s,%f' | sort -n | cut -d, -f2
    or to group formulas by number of atomic propositions:
       genltl --dac --output='ap-%a.ltl'

652 653 654
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

660 661 662
  Bugs fixed:

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

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

668 669
  Command-line tools:

670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695
  * All tools that input formulas or automata (i.e., autfilt,
    dstar2tgba, ltl2tgba, ltl2tgta, ltlcross, ltldo, ltlfilt,
    ltlgrind) now have a more homogeneous handling of the default
    input.

    - If no formula/automaton have been specified, and the standard
    input is a not a tty, then the default is to read that. This is a
    change for ltl2tgba and ltl2tgta.  In particular, it simplifies

        genltl --dac | ltl2tgba -F- | autfilt ...

    into

        genltl --dac | ltl2tgba | autfilt ...

    - If standard input is a tty and no other input has been
    specified, then an error message is printed.  This is a change for
    autfilt, dstar2tgba, ltlcross, ltldo, ltlfilt, ltlgrind, that used
    to expect the user to type formula or automata at the terminal,
    confusing people.

    - All tools now accept - as a shorthand for -F-, to force reading
    input from the standard input (regardless of whether it is a tty
    or not).  This is a change for ltl2tgba, ltl2tgta, ltlcross, and
    ltldo.

696 697 698
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

699 700
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718
    arguments, and redirection of stdin and stdout, but nothing more).

  * ltlcross and ltldo learned a new syntax to specify that an input
    formula should be written in some given syntax after rewriting
    some operators away.  For instance the defaults arguments passed
    to ltl2dstar have been changed from
         --output-format=hoa %L %O
    into
         --output-format=hoa %[WM]L %O
    where [WM] specifies that operators W and M should be rewritten
    away.  As a consequence running
         ltldo ltl2dstar -f 'a M b'
    will now work and call ltl2dstar on the equivalent formula
    'b U (a & b)' instead.  The operators that can be listed between
    brackets are the same as those of ltlfilt --unabbreviate option.

  * ltlcross learned to show some counterexamples when diagnosing
    failures of cross-comparison checks against random state spaces.
719

720 721
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
722 723 724
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

725
  * autfilt learned --remove-unused-ap to remove atomic propositions
726 727
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
728
    declare atomic propositions (HOA & DSTAR).
729

730
  * autfilt learned two options to filter automata by count of used or
731 732 733 734
    unused atomic propositions: --used-ap=RANGE --unused-ap=RANGE.
    These differ from --ap=RANGE that only consider *declared* atomic
    propositions, regardless of whether they are actually used.

735 736
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
737

738
  * autfilt learned to filter automata representing stutter-invariant
739 740
    properties with --is-stutter-invariant.

741
  * autfilt learned two new options to highlight non-determinism:
742
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
743 744
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
745

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

750 751 752
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

753
  * genltl learned three new families: --dac-patterns=1..45,
754 755 756
    --eh-patterns=1..12, and --sb-patterns=1..27.  Unlike other options
    these do not output scalable patterns, but simply a list of formulas
    appearing in these three papers: Dwyer et al (FMSP'98), Etessami &
757
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
758

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

762 763 764 765 766 767 768 769 770 771 772 773 774
  * The formater used by --format (for ltlfilt, ltlgrind, genltl,
    randltl) or --stats (for autfilt, dstar2tgba, ltl2tgba, ltldo,
    randaut) learned to recognize double-quoted fields and double the
    double-quotes output inbetween as expected from RFC4180-compliant
    CSV files.  For instance
      ltl2tgba -f 'a U "b+c"' --stats='"%f",%s'
    will output
      "a U ""b+c""",2

  * The --csv-escape option of genltl, ltlfilt, ltlgrind, and randltl
    is now deprecated.  The option is still here, but hidden and
    undocumented.

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

780 781 782 783
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

784 785 786
  * Arguments passed to -x (in ltl2tgba, ltl2tgta, autfilt, dstar2tgba)
    that are not used are now reported as they might be typos.
    This ocurred a couple of times in our test-suite.  A similar
787
    check is done for the arguments of autfilt --sat-minimize=...
788

789 790 791 792 793 794 795 796 797
  Library:

  * The print_hoa() function will now output version 1.1 of the HOA
    format when passed the "1.1" option (i.e., use -H1.1 from any
    command-line tool).  As far as Spot is concerned, this allows
    negated properties to be expressed.  Version 1 of the HOA format
    is still the default, but we plan to default to version 1.1 in the
    future.

798 799 800 801 802 803 804
  * The "highlight-states" and "highlight-edges" named properties,
    which were introduced in 1.99.8, will now be output using
    "spot.highlight.edges:" and "spot.highlight.states:" headers if
    version 1.1 of the HOA format is selected.  The automaton parser
    was secretly able of reading that since 1.99.8, but that is now
    documented at https://spot.lrde.epita.fr/hoa.html#extensions

805 806 807
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

808
  * is_deterministic(), is_terminal(), is_weak(), and
809 810 811
    is_inherently_weak(), count_nondet_states(),
    highlight_nondet_edges(), highlight_nondet_states() will update
    the corresponding properties of the automaton as a side-effect of
812
    their check.
813

814 815 816 817 818 819
  * the sbacc() function, used by "ltl2tgba -S" and "autfilt -S" to
    convert automata to state-based acceptance, learned some tricks
    (using SCCs, pulling accepting marks common to all outgoing edges,
    and pushing acceptance marks common to all incoming edges) to
    reduce the number of additional states needed.

820 821 822 823
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

824 825 826
  * language_containment_checker now has default values for all
    parameters of its constructor.

827 828 829 830
  * spot::twa_run has a new method, project(), that can be used to
    project a run found in a product onto one of the original operand.
    This is for instance used by autfilt --highlight-word.

831 832 833 834
    The old spot::project_twa_run() function has been removed: it was
    not used anywhere in Spot, and had an obvious bug in its
    implementation, so it cannot be missed by anyone.

835 836
  * spot::twa has two new methods that supplement is_empty():
    twa::accepting_run() and twa::accepting_word().  They compute
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
837
    what their names suggest.  Note that twa::accepting_run(), unlike
838 839 840
    the two others, is currently restricted to automata with Fin-less
    acceptance.

841 842 843 844 845
  * spot::check_stutter_invariance() can now work on non-deterministic
    automata for which no corresponding formula is known.  This
    implies that "autfilt --check=stutter" will now label all
    automata, not just deterministic automata.

846
  * New LTL and PSL simplification rules:
847 848
    - if e is pure eventuality and g => e, then e U g = Fg
    - if u is purely universal and u => g, then u R g = Gg
849 850
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
851

852 853 854 855
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

856 857 858 859 860
  * spot::fair_kripke::state_acceptance_conditions() renamed to
    spot::fair_kripke::state_acceptance_mark() for consistency.  This
    is backward incompatible, but we are not aware of any actual use
    of this method.

861 862
  Python:

863
  * The __format__() method for formula supports the same
864 865 866 867
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

868 869
  * Bindings for language_containment_checker were added.

870 871
  * Bindings for randomize() were added.

872 873 874
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

880 881 882 883
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

884 885 886 887
  Documentation:

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

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

892
  * Another new page shows how to implement an on-the-fly Kripke
893
    structure for a custom state space.
894 895
    https://spot.lrde.epita.fr/tut51.html

896 897
  * The concepts.html page now lists all named properties
    used by automata.
898

899 900 901 902 903 904
  Bug fixes:

  * When ltlcross found a bug using a product of complemented
    automata, the error message would report "Comp(Ni)*Comp(Pj)" as
    non-empty while the actual culprit was "Comp(Nj)*Comp(Pi)".

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

908 909 910
  * print_lbtt() had a memory leak when printing states without
    successors.

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

913 914 915 916 917
  Bug fixes:

  * The degen-lcache=1 option of the degeneralization algorithm (which
    is a default option) did not behave exactly as documented: instead
    of reusing the first level ever created for a state where the
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
918 919
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
920
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
921
  * The generalized testing automata displayed by the online
922
    translator were incorrect (those output by ltl2tgta were OK).
923
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
924
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
925 926 927
    propositions even when they were still used in the output (e.g.,
    if a&p0 is relabeled to p0&p1).  This could cause ltldo and the
    online translator to report errors.
928

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
929 930 931 932 933 934 935 936
New in spot 2.0.2 (2016-06-17)

  Documentation:

  * We now have a citing page at https://spot.lrde.epita.fr/citing.html
    providing a list of references about Spot.
  * The Python examples have been augmented with the two examples
    from our ATVA'16 tool paper.
937

938 939 940 941
  Bug fixes:

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

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

947 948
  Library:

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

952 953 954 955 956
  Documentation:

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

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

960 961 962 963
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
964 965
  Bug fixes:

966
  * The automaton parser would choke on comments like /******/.
967
  * check_strength() should also set negated properties.
968 969 970
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
971 972
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
973
  * spot::ltsmin::kripke() had the same issue.
974 975 976 977
  * The sub_stats_reachable() function used to count the number
    of transitions based on the number of atomic propositions
    actually *used* by the automaton instead of using the number
    of AP declared.
978 979 980 981 982
  * print_hoa() will now output all the atomic propositions that have
    been registered, not only those that are used in the automaton.
    (Note that it will also throw an exception if the automaton uses
    an unregistered AP; this is how some of the above bugs were
    found.)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
983
  * For Small or Deterministic preference, the postprocessor
984 985 986
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
987 988
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
989
  * Various typos and minor documentation fixes.
990

991

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

994 995 996
  Command-line tools:

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

1000 1001 1002
  Python:

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

1005 1006 1007 1008
  Library:

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

1009 1010
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1011 1012 1013 1014 1015
  * The concepts page (https://spot.lrde.epita.fr/concepts.html) now
    includes a highlevel description of the architecture, and some
    notes aboute automata properties.

  * More Doxygen documentation for spot::formula and spot::digraph.
1016

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

1019 1020
  Command-line tools:

1021 1022 1023
  * autfilt has two new options: --accept-word=WORD and
    --reject-word=WORD for filtering automata that accept or reject
    some word.  The option may be used multiple times.
1024

1025 1026
  Library:

1027 1028 1029
  * The parse_word() function can be used to parse a lasso-shaped
    word and build a twa_word.  The twa_word::as_automaton()
    method can be used to create an automaton out of that.
1030
  * twa::ap_var() renamed to twa::ap_vars().
1031 1032 1033 1034
  * emptiness_check_instantiator::min_acceptance_conditions() and
    emptiness_check_instantiator::max_acceptance_conditions() renamed
    to emptiness_check_instantiator::min_sets() and
    emptiness_check_instantiator::max_sets().