NEWS 182 KB
Newer Older
1
New in spot 2.4.4.dev (net yet released)
2

3
4
5
6
7
8
9
10
  Build:

  - We no longuer distribute the doxygen-generated documentation in
    the tarball of Spot to save space.  This documentation is still
    available online at https://spot.lrde.epita.fr/doxygen/.  If you
    want to build a local copy you can configure Spot with
    --enable-doxygen, or simply run "cd doc && make doc".

11
12
13
  - All the images that illustrate the documentation have been
    converted to SVG, to save space and improve quality.

14
15
  Tools:

16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
  - ltlsynt is a new tool for synthesizing a controller from LTL/PSL
    specifications.

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

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

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

  - 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:
36
37
    --gf-equiv=RANGE       (GFa1 & GFa2 & ... & GFan) <-> GFz
    --gf-implies=RANGE     (GFa1 & GFa2 & ... & GFan) -> GFz
38
39
40
41
    --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})|(...))
42

43
44
45
46
47
  - autfilt learned a couple of acceptance transformations:
      --streett-like converts automata with DNF acceptance
                     into automata with Streett-like acceptance.
      --dca          converts automata with DNF or Streett-like
                     acceptance into deterministic co-Büchi.
48

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

54
55
  - ltldo learned to limit the number of automata it outputs using -n.

56
57
  - ltlfilt learned to measure wall-time using --format=%r, and
    cpu-time with --format=%R.
58

59
60
  - The --format=%g option of tools that output automata used to
    print the acceptance condition as a *formula* in the HOA format.
61
    This %g may now take optional arguments to print the acceptance
62
63
64
65
66
67
68
69
    *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.

70
71
72
  - Tools that produce formulas now support --format=%[OP]n to
    display the nesting depth of operator OP.

73
74
75
76
  - The new -x tls-impl=N option allows to fine-tune the
    implication-based simplification rules of ltl2tgba.  See the
    spot-x man-page for details.

77
78
79
80
  - All tools learned to check the SPOT_OOM_ABORT environment
    variable.  This is only useful for debuging out-of-memory
    conditions; see the spot-x(7) man page for detail.

81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
  New functions in the library:

  - 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
    automata.  spot::to_dca() dispatches between the last two
    functions.  The language of produced automata include the original
    language, but may be larger if the original automaton is not
    co-Büchi realizable.  Based on Boker & Kupferman FOSSACS'11 paper.

  - spot::scc_info::states_on_acc_cycle_of() return all states
    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
110
111
    (i.e., every transition belongs to exactly one acceptance set)

112
113
  - spot::change_parity() convert between different parity acceptance
    conditions.
114

115
116
117
  - spot::colorize_parity() transform an automaton with parity
    acceptance into a colored automaton (which is often what people
    working with parity automata expect).
118

119
120
  - spot::cleanup_parity_acceptance() simplify a parity acceptance
    condition.
121

122
123
124
  - spot::parity_product() and spot::parity_product_or() are
    specialized (but expensive) products that preserve parity
    acceptance.
125

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

130
131
132
133
134
  - spot::stutter_invariant_states(),
    spot::stutter_invariant_letters(),
    spot::highlight_stutter_invariant_states(), ...  These function
    help study a stutter-sensitive automaton and detect the subset of
    states that are stutter-invariant.  See
135
    https://spot.lrde.epita.fr/ipynb/stutter-inv.html for examples.
136

137
138
139
140
  - spot::acc_cond::name(fmt) is a new method that names well-known
    acceptance conditions.  The fmt parameter specify the format to
    use for that name (e.g. to the style used in HOA, or that used by
    print_dot()).
141

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

145
146
  - spot::nesting_depth() computes the nesting depth of any LTL
    operator.
147

148
149
  - spot::check_determinism() sets both prop_semi_deterministic()
    and prop_universal() appropriately.
150

151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
  Improvements to existing functions in the library:

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

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

  - In some cases, spot::degeneralize() would output Büchi automata
    with more SCCs than its input.  This was hard to notice, because
    very often simulation-based simplifications remove those extra
    SCCs.  This situation is now detected by spot::degeneralized()
    and fixed before returning the automaton.  A new optionnal
    argument can be passed to disable this behavior (or use -x
    degen-remscc=0 from the command-line).

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

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

  - spot::remove_fin() will now call simplify_acceptance(),
    introduced in 2.4, before attempting its different Fin-removal
    strategies.

  - spot::simplify_acceptance() was already merging identical
    acceptance sets, and detecting complementary sets i and j to
    perform the following simplifications
192
193
194
195
196
197
198
      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

199
200
201
202
  - spot::formula::map(fun) and spot::formula::traverse(fun) will
    accept additionnal arguments and pass them to fun().  See
    https://spot.lrde.epita.fr/tut03.html for some examples.

203
  Python-specific changes:
204
205

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

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

212
213
  - The test suite is now using v4 of the Jupyter Notebook format.

214
215
216
217
218
  Deprecation notices:

  (These functions still work but compilers emit warnings.)

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

223
224
225
226
  Backward incompatible changes:

  - The spot::closure(), spot::sl2(), spot::is_stutter_invariant()
    functions no longuer takes && arguments.  The former two have
227
228
    spot::closure_inplace() and spot::sl2_inplace() variants.  These
    functions also do not take a list of atomic propositions as an
229
230
    argument anymore.

231
232
233
234
  - The spot::bmrand() and spot::prand() functions have been removed.
    They were not used at all in Spot, and it's not Spot's objective
    to provide such random functions.

235
236
237
238
  - The spot::bdd_dict::register_all_propositions_of() function has
    been removed.  It's a low-level function was not used anywhere in
    Spot anymore, since it's better to use spot::twa::copy_ap_of().

239
240
  Bugs fixed:

241
242
243
244
  - 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().
245

246
247
248
  - ltlcross could crash when calling remove_fin() on an automaton
    with 32 acceptance sets would need an additional set.

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

251
252
253
254
255
256
  Bugs fixed:

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

257
258
259
260
  - 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.
261

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
264
  Bugs fixed:
265
266
267
268

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

269
270
  - Some mismatched placement-new/delete reported by ASAN were fixed.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
271
272
273
274
275
276
277
  - 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
278
279
280
281
282
New in spot 2.4.2 (2017-11-07)

  Tools:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
284
285
286
287
288
  Bugs fixed:

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

289
290
291
  - 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
292
New in spot 2.4.1 (2017-10-05)
293

294
295
  Bugs fixed:

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

299
300
301
302
303
304
305
306
307
308
  - spot::scc_info::determine_unknown_acceptance() incorrectly
    considered some rejecting SCC as accepting.

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

Maximilien Colange's avatar
Typos    
Maximilien Colange committed
309
310
311
312
  - 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.
313

Maximilien Colange's avatar
Typos    
Maximilien Colange committed
314
315
  - spot::simulation() could incorrectly flag an automaton as
    non-deterministic.
316

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

319
320
321
322
323
324
325
326
327
328
329
  Build:

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

330
331
  Tools:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
332
333
334
335
336
337
338
339
  - genaut is a new binary that produces families of automata defined
    in the literature (in the same way as we have genltl for LTL
    formulas).

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

340
  - genltl learned two generate two new families of formulas:
341
342
343
344
345
346
      --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).

347
  - autfilt learned to build the union (--sum) or the intersection
Maximilien Colange's avatar
Typos    
Maximilien Colange committed
348
349
    (--sum-and) of two languages by putting two automata side-by-side
    and fiddling with the initial states.  This complements the already
350
351
    implemented intersection (--product) and union (--product-or),
    both based on a product.
352

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

356
357
358
359
  - autfilt learned --split-edges to convert labels that are Boolean
    formulas into labels that are min-terms.  (See spot::split_edges()
    below.)

360
361
362
  - autfilt learned --simplify-acceptance to simplify some acceptance
    conditions.  (See spot::simplify_acceptance() below.)

363
364
365
366
  - 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.)

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

370
371
372
373
374
375
  - 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.

376
377
  Library:

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

381
  - spot::sum() and spot::sum_and() implements the union and the
382
    intersection of two automata by putting them side-by-side and
383
    using non-deterministim or universal branching on the initial
384
    state.
385

386
387
388
  - twa objects have a new property: prop_complete().  This obviously
    acts as a cache for the is_complete() function.

Maximilien Colange's avatar
Typos    
Maximilien Colange committed
389
  - spot::dualize() complements any alternating automaton.  Since
390
391
392
    the dual of a deterministic automaton is still deterministic, the
    function spot::dtwa_complement() has been deprecated and simply
    calls spot::dualize().
393

394
395
396
397
398
399
  - spot::decompose_strength() was extended and renamed to
    spot::decompose_scc() as it can now also extract a subautomaton
    leading to a particular SCC.  A demonstration of this feature via
    the Python bindings can be found at
    https://spot.lrde.epita.fr/ipynb/decompose.html

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

405
406
407
408
409
  - 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
      https://spot.lrde.epita.fr/oaut.html#dot2tex

410
411
412
413
  - 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
414
415
416
417
418
    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
419
420
421
422
423
424
425

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

426
427
428
429
  - 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".

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

435
436
437
438
439
440
  - 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.
441

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

447
448
449
450
451
452
453
  - 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.

454
455
456
  - spot::scc_info has two new methods to easily iterate over the
    edges of an SCC: edges_of() and inner_edges_of().

457
458
459
  - spot::scc_info can now be passed a filter function to ignore
    or cut some edges.

460
461
462
463
464
  - 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.

465
466
467
468
469
470
  - 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().

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

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

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

483
484
485
486
487
  - 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.

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

493
494
495
496
  - twa_graph::copy_state_names_from() can be used to copy the state
    names from another automaton, honoring "original-states" if
    present.

497
498
  - 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
499
    data-structures are exponential in N.  However a formula like
500
501
502
503
504
505
506
507
      ((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).

508
509
510
511
  - 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).

512
513
514
515
    When working with SERE, the simplification of "expr[*0..1]" was
    improved.  E.g. {{a[*]|b}[*0..1]} becomes {a[*]|b} instead of
    {{a[+]|b}[*0..1]}.

516
517
518
519
  - 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.

520
521
  - spot::sbacc() is can now also convert alternating automata
    to state-based acceptance.
522

523
524
525
  - spot::sbacc() and spot::degeneralize() learned to merge
    accepting sinks.

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

529
  - The & and | operators for acceptannce conditions have been changed
530
    slightly to be more symmetrical.  In older versions, operator &
531
532
533
534
    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
535

536
537
538
539
  - 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).

540
541
542
543
544
545
546
547
548
  - 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
Typos    
Maximilien Colange committed
549
  - The parser for HOA now recognizes and verifies correct use of the
550
    "univ-branch" property.  This is known to be a problem with option
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
551
    -H1 of ltl3ba 1.1.2 and ltl3dra 0.2.4, so the environment variable
552
553
    SPOT_HOA_TOLERANT can be set to disable the diagnostic.

554
555
556
557
558
  Python:

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

559
560
561
562
  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
Typos    
Maximilien Colange committed
563
    generalized co-Büchi), it would sometimes output an automaton with
564
565
    transition-based acceptance but marked as state-based.

566
567
  - The complete() function could complete an empty co-Büchi automaton
    into an automaton accepting everything.
568

569
570
571
572
573
574
575
576
577
578
  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.

579
580
581
582
583
584
585
  - 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.

586
587
588
  - spot::acc_cond::mark_t::sets() now returns an internal iterable
    object instead of an std::vector<unsigned>.

589
590
591
592
  - 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.

593
  deprecation notices:
594

595
  (these functions still work but compilers emit warnings.)
596

597
598
599
  - spot::decompose_strength() is deprecated, it has been renamed
    to spot::decompose_scc().

600
  - spot::dtwa_complement() is deprecated.  prefer the more generic
601
602
    spot::dualize() instead.

603
  - the spot::twa::prop_deterministic() methods have been renamed to
604
    spot::twa::prop_universal() for consistency with the change to
605
    is_deterministic() listed above.  we have kept
606
607
    spot::twa::prop_deterministic() as a deprecated synonym for
    spot::twa::prop_universal() to help backward compatibility.
608

609
  - the spot::copy() function is deprecated.  use
610
611
    spot::make_twa_graph() instead.

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

614
615
  Bugs fixed:

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

620
621
622
623
624
  - 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.

625
626
627
628
629
630
  - 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
631
632
633
  - Our verson of BuDDy had an incorrect optimization for the
    biimp operator.

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

636
637
  Bugs fixed:

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

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

644
645
646
  - ltldo and ltlcross could leave temporary files behind when
    aborting on error.

647
648
649
650
  - 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.

651
652
653
654
  - 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
655
New in spot 2.3.3 (2017-04-11)
656

657
658
659
660
661
  Tools:

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

662
  - genltl learned --spec-patterns as an alias for --dac-patterns; it
663
664
665
    also learned two new sets of LTL formulas under --hkrss-patterns
    (a.k.a. --liberouter-patterns) and --p-patterns
    (a.k.a. --beem-patterns).
666

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
672
673
  - The output of 'genltl --r-left=1 --r-right=1 --format=%F' had
    typos.
674

675
676
677
678
  - 'ltl2tgba Fa | autfilt --complement' would incorrectly claim that
    the output is "terminal" because dtwa_complement() failed to reset
    that property.

679
680
681
  - spot::twa_graph::purge_unreachable_states() was misbehaving on
    alternating automata.

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

685
686
687
688
689
690
  - 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
691
New in spot 2.3.2 (2017-03-15)
692

693
694
  Tools:

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

701
702
  Python:

703
704
  - The bdd_to_formula(), and to_generalized_buchi() functions can now
    be called in Python.
705

706
707
708
709
710
  Documentation:

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

711
712
713
714
715
  Bugs fixed:

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

716
717
718
  - Because of a typo, the output of --stats='...%P...' was correct
    only if %p was used as well.

719
720
721
  - genltl was never meant to have (randomly attributed) short
    options for --postive and --negative.

722
723
724
725
  - 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).

726
727
  - 'ltl2tgba --any -C -M ...' would not complete automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
728
  - While not incorrect, the HOA properties output by 'ltl2tgba -M'
729
730
731
732
    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'.

733
734
735
  - spot::twa_graph::set_univ_init_state() could not be called with
    an initializer list.

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
739
  - Instantiating an emptiness check on an automaton with unsupported
740
741
742
743
    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
744
  Deprecation notice:
745
746
747
748

  - 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
749
750
    for consistency with tools producing automata, where %a means
    something else.
751

752

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

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

761
762
763
  - The colors used in the output of ltlcross have been adjusted to
    work better with white backgrounds and black backgrounds.

764
765
766
  - The option (y) has been added to --dot. It splits the universal
    edges with the same targets but different colors.

767
768
769
770
771
  - 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.

772
773
774
775
  Library:

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

776
777
778
779
  - 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.

780
781
782
783
784
785
786
  Bugs fixed:

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

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

788
789
790
791
792
793
  - 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.

794
795
796
  - alternation_removal() was not always reporting the unsupported
    non-weak automata.

797
798
799
800
  - a long-standing typo in the configure code checking for Python
    caused any user-defined CPPFLAGS to be ignored while building
    Spot.

801
802
803
804
  - 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
805
New in spot 2.3 (2017-01-19)
806

807
808
809
810
811
812
813
814
815
816
817
  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.

818
819
820
  * The development Debian packages for Spot now install static
    libraries as well.

821
822
  * We now install configuration files for users of pkg-config.

823
824
  Tools:

825
826
827
  * 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
828
829
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.
830

831
832
833
834
835
836
  * 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.

837
838
839
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

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

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

846
847
848
849
850
  * '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/.
851

852
853
854
855
  * 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
856
    See https://spot.lrde.epita.fr/hierarchy.html
857

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

862
863
864
865
866
867
  * 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.

868
869
870
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

871
872
873
  Library:

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

877
  * Couvreur's emptiness check has been rewritten to use the explicit
878
879
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
880
881
882
    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.
883

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

888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
  * 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.

906
    - scc_info has been adjusted to handle universal edges as if they
907
908
909
      were existential edges.  As a consequence, acceptance
      information is not accurate.

910
911
912
913
914
915
916
    - 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
917
918
919
    - 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.
920

921
922
923
924
  * 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().
925

926
927
928
929
930
931
  * 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.

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

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

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

940
941
942
943
  * 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.
944

945
946
947
948
  * 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).
949

950
951
952
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

953
954
955
956
957
958
959
960
961
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.

962
Bugs fixed:
963
964
965
966
967
968
969
970

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

971
972
973
974
  * 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.

975
976
977
978
  * 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.

979
980
981
  * 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
982
New in spot 2.2.2 (2016-12-16)
983

984
985
986
987
988
  Build:

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

989
990
991
992
  Bug fixes:

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

994
995
996
997
998
  * 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.

999
1000
1001
1002
1003
  * 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.

1004
1005
1006
1007
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

1008
1009
1010
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

1011
1012
1013
  * 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
1014
New in spot 2.2.1 (2016-11-21)
1015

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1016
  Bug fix:
1017

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1018
1019
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
1020

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

1023
1024
1025
1026
1027
1028
  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
1029
1030
1031
1032
  * "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.

1033
1034
1035
  * 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
1036
1037
1038
1039
    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
1040

1041
1042
  Library:

1043
1044
1045
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

1046
  * is_unambiguous() was rewritten in a more efficient way.
1047

1048
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1049
    of a single self-loop without resorting to remove_fin() for complex
1050
1051
1052
1053
1054
1055
    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.
1056

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1057
1058
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
1059
1060
1061
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

1062
1063
  * scc_filter() learned to preserve state names and highlighted states.

1064
1065
1066
1067
1068
  * 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).

1069
1070
1071
1072
1073
1074
1075
1076
  * 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
1077
1078
1079
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
1080

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1081
  Bug fixes:
1082

1083
  * ltl2tgba was always using the highest settings for the LTL
1084
1085
1086
1087
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

1088
1089
1090
  * 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.)
1091

1092
1093
1094
  * 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
1095
  * Running the LTL parser in debug mode would crash.
1096

1097
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1098
    when run with use_simulation=true (the default) on non-simplified
1099
1100
    automata.

1101
1102
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
1103
1104
1105
1106
    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.
1107

1108
1109
1110
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1111
1112
1113
  * 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.
1114

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

1118
New in spot 2.1.2 (2016-10-14)
1119

1120
1121
1122
1123
1124
1125
  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.

1126
1127
1128
1129
1130
1131
  * 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.

1132
1133
1134
1135
1136
1137
1138
1139
  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)).

1140
1141
  Bug fixes:

1142
  * Fix spurious uninitialized read reported by valgrind when
1143
    is_Kleene_star() is compiled by clang++.
1144

1145
  * Using "ltlfilt some-large-file --some-costly-filter" could take
1146
1147
1148
1149
1150
1151
1152
    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.

1153
1154
1155
1156
  * 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.
1157

1158
1159
  * Fix ltlcross crash when combining --no-check with --verbose.

1160
1161
1162
  * 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
1163
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1164

1165
1166
1167
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1168
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1169
1170
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
1171
1172
1173
1174
       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'

1175
1176
1177
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

1183
1184
1185
  Bugs fixed:

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

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

1191
1192
  Command-line tools:

1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
  * 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.

1219
1220
1221
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

1222
1223
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
    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.
1242

1243
1244
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
1245
1246
1247
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

1248
  * autfilt learned --remove-unused-ap to remove atomic propositions
1249
1250
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
1251
    declare atomic propositions (HOA & DSTAR).
1252

1253
  * autfilt learned two options to filter automata by count of used or
1254
1255
1256
1257
    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.

1258
1259
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
1260

1261
  * autfilt learned to filter automata representing stutter-invariant
1262
1263
    properties with --is-stutter-invariant.

1264
  * autfilt learned two new options to highlight non-determinism:
1265
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
1266
1267
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
1268

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

1273
1274
1275
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.