NEWS 167 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
New in spot 2.3.5.dev (not yet released)
2

3
4
  Tools:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
5
6
7
8
9
10
11
12
  - 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).

13
14
15
16
17
  - 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.
18

19
20
  - autfilt learned to complement any alternating automaton with
    option --dualize.
Thomas Medioni's avatar
Thomas Medioni committed
21

22
23
24
25
  - autfilt learned --split-edges to convert labels that are Boolean
    formulas into labels that are min-terms.  (See spot::split_edges()
    below.)

26
27
28
  - autfilt learned --simplify-acceptance to simplify some acceptance
    conditions.  (See spot::simplify_acceptance() below.)

29
30
31
32
  - 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.)

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

36
37
  Library:

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

41
  - spot::sum() and spot::sum_and() implements the union and the
42
    intersection of two automata by putting them side-by-side and
43
44
    using non-deterministim or universal branching on the initial
    statae.
45

46
47
48
  - twa objects have a new property: prop_complete().  This obviously
    acts as a cache for the is_complete() function.

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

54
55
  - spot::dtwa_complement now simply returns the result of dualize()

56
57
58
59
60
61
  - 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

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

65
66
67
68
  - 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
69
70
71
72
73
    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
74
75
76
77
78
79
80

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

81
82
83
84
  - 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".

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

90
91
92
93
94
95
  - 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.
96

97
98
99
100
101
  - 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.

102
103
104
105
106
107
108
  - 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.

109
110
111
  - spot::scc_info has two new methods to easily iterate over the
    edges of an SCC: edges_of() and inner_edges_of().

112
113
114
  - spot::scc_info can now be passed a filter function to ignore
    or cut some edges.

115
116
117
118
119
  - 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.

120
121
122
123
124
125
  - 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().

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

131
132
133
134
  - 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.

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

138
139
140
141
  - 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.
142

143
144
145
146
  - twa_graph::copy_state_names_from() can be used to copy the state
    names from another automaton, honoring "original-states" if
    present.

147
148
  - 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
149
    data-structures are exponential in N.  However a formula like
150
151
152
153
154
155
156
157
      ((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).

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

162
163
  - spot::sbacc() is now able to work on alternating automata.

164
165
166
  - spot::sbacc() and spot::degeneralize() learned to merge
    accepting sinks.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
167
168
169
  - If the SPOT_BDD_TRACE envorinment variable is set, statistics
    about BDD garbage collection and table resizing are shown.

170
171
172
173
174
175
  - The & and | operators for acceptannce conditions have been changed
    slightly to be more symmetrical.  In older version, operator &
    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
176

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

181
182
183
184
185
186
187
188
189
  - 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.

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

195
196
197
198
199
  Python:

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

200
201
202
203
204
205
206
  Bugs fixed:

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

207
208
209
210
211
212
213
214
215
216
  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.

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

224
225
226
  - spot::acc_cond::mark_t::sets() now returns an internal iterable
    object instead of an std::vector<unsigned>.

227
228
229
230
  - 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.

231
232
  Deprecation notice:

233
234
235
  - spot::decompose_strength() is deprecated, it has been renamed
    to spot::decompose_scc().

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

245
246
247
  - The spot::copy() function is deprecated.  Use
    spot::make_twa_graph() instead.

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

250
251
  Bugs fixed:

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

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

261
262
263
264
265
266
  - 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
267
268
269
  - Our verson of BuDDy had an incorrect optimization for the
    biimp operator.

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

272
273
  Bugs fixed:

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

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

280
281
282
  - ltldo and ltlcross could leave temporary files behind when
    aborting on error.

283
284
285
286
  - 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.

287
288
289
290
  - 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
291
New in spot 2.3.3 (2017-04-11)
292

293
294
295
296
297
  Tools:

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

298
  - genltl learned --spec-patterns as an alias for --dac-patterns; it
299
300
301
    also learned two new sets of LTL formulas under --hkrss-patterns
    (a.k.a. --liberouter-patterns) and --p-patterns
    (a.k.a. --beem-patterns).
302

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
308
309
  - The output of 'genltl --r-left=1 --r-right=1 --format=%F' had
    typos.
310

311
312
313
314
  - 'ltl2tgba Fa | autfilt --complement' would incorrectly claim that
    the output is "terminal" because dtwa_complement() failed to reset
    that property.

315
316
317
  - spot::twa_graph::purge_unreachable_states() was misbehaving on
    alternating automata.

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

321
322
323
324
325
326
  - 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
327
New in spot 2.3.2 (2017-03-15)
328

329
330
  Tools:

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

337
338
  Python:

339
340
  - The bdd_to_formula(), and to_generalized_buchi() functions can now
    be called in Python.
341

342
343
344
345
346
  Documentation:

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

347
348
349
350
351
  Bugs fixed:

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

352
353
354
  - Because of a typo, the output of --stats='...%P...' was correct
    only if %p was used as well.

355
356
357
  - genltl was never meant to have (randomly attributed) short
    options for --postive and --negative.

358
359
360
361
  - 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).

362
363
  - 'ltl2tgba --any -C -M ...' would not complete automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
364
  - While not incorrect, the HOA properties output by 'ltl2tgba -M'
365
366
367
368
    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'.

369
370
371
  - spot::twa_graph::set_univ_init_state() could not be called with
    an initializer list.

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
375
  - Instantiating an emptiness check on an automaton with unsupported
376
377
378
379
    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
380
  Deprecation notice:
381
382
383
384

  - 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
385
386
    for consistency with tools producing automata, where %a means
    something else.
387

388

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

391
392
393
394
395
396
  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.

397
398
399
  - The colors used in the output of ltlcross have been adjusted to
    work better with white backgrounds and black backgrounds.

400
401
402
  - The option (y) has been added to --dot. It splits the universal
    edges with the same targets but different colors.

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

408
409
410
411
  Library:

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

412
413
414
415
  - 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.

416
417
418
419
420
421
422
  Bugs fixed:

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

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

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

430
431
432
  - alternation_removal() was not always reporting the unsupported
    non-weak automata.

433
434
435
436
  - a long-standing typo in the configure code checking for Python
    caused any user-defined CPPFLAGS to be ignored while building
    Spot.

437
438
439
440
  - 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
441
New in spot 2.3 (2017-01-19)
442

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

454
455
456
  * The development Debian packages for Spot now install static
    libraries as well.

457
458
  * We now install configuration files for users of pkg-config.

459
460
  Tools:

461
462
463
  * 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
464
465
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.
466

467
468
469
470
471
472
  * 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.

473
474
475
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

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

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

482
483
484
485
486
  * '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/.
487

488
489
490
491
  * 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
492
    See https://spot.lrde.epita.fr/hierarchy.html
493

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

498
499
500
501
502
503
  * 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.

504
505
506
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

507
508
509
  Library:

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

513
  * Couvreur's emptiness check has been rewritten to use the explicit
514
515
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
516
517
518
    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.
519

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

524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
  * 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.

542
    - scc_info has been adjusted to handle universal edges as if they
543
544
545
      were existential edges.  As a consequence, acceptance
      information is not accurate.

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

557
558
559
560
  * 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().
561

562
563
564
565
566
567
  * 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.

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

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

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

576
577
578
579
  * 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.
580

581
582
583
584
  * 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).
585

586
587
588
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

589
590
591
592
593
594
595
596
597
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.

598
Bugs fixed:
599
600
601
602
603
604
605
606

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

607
608
609
610
  * 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.

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

615
616
617
  * 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
618
New in spot 2.2.2 (2016-12-16)
619

620
621
622
623
624
  Build:

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

625
626
627
628
  Bug fixes:

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

630
631
632
633
634
  * 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.

635
636
637
638
639
  * 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.

640
641
642
643
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

644
645
646
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

647
648
649
  * 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
650
New in spot 2.2.1 (2016-11-21)
651

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
652
  Bug fix:
653

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
654
655
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
656

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

659
660
661
662
663
664
  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
665
666
667
668
  * "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.

669
670
671
  * 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
672
673
674
675
    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
676

677
678
  Library:

679
680
681
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

682
  * is_unambiguous() was rewritten in a more efficient way.
683

684
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
685
    of a single self-loop without resorting to remove_fin() for complex
686
687
688
689
690
691
    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.
692

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
693
694
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
695
696
697
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

698
699
  * scc_filter() learned to preserve state names and highlighted states.

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

705
706
707
708
709
710
711
712
  * 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
713
714
715
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
716

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
717
  Bug fixes:
718

719
  * ltl2tgba was always using the highest settings for the LTL
720
721
722
723
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

724
725
726
  * 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.)
727

728
729
730
  * 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
731
  * Running the LTL parser in debug mode would crash.
732

733
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
734
    when run with use_simulation=true (the default) on non-simplified
735
736
    automata.

737
738
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
739
740
741
742
    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.
743

744
745
746
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
747
748
749
  * 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.
750

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

754
New in spot 2.1.2 (2016-10-14)
755

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

762
763
764
765
766
767
  * 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.

768
769
770
771
772
773
774
775
  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)).

776
777
  Bug fixes:

778
  * Fix spurious uninitialized read reported by valgrind when
779
    is_Kleene_star() is compiled by clang++.
780

781
  * Using "ltlfilt some-large-file --some-costly-filter" could take
782
783
784
785
786
787
788
    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.

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

794
795
  * Fix ltlcross crash when combining --no-check with --verbose.

796
797
798
  * 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
799
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
800

801
802
803
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
804
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
805
806
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
807
808
809
810
       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'

811
812
813
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

819
820
821
  Bugs fixed:

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

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

827
828
  Command-line tools:

829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
  * 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.

855
856
857
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

858
859
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
    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.
878

879
880
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
881
882
883
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

884
  * autfilt learned --remove-unused-ap to remove atomic propositions
885
886
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
887
    declare atomic propositions (HOA & DSTAR).
888

889
  * autfilt learned two options to filter automata by count of used or
890
891
892
893
    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.

894
895
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
896

897
  * autfilt learned to filter automata representing stutter-invariant
898
899
    properties with --is-stutter-invariant.

900
  * autfilt learned two new options to highlight non-determinism:
901
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
902
903
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
904

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

909
910
911
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

912
  * genltl learned three new families: --dac-patterns=1..45,
913
914
915
    --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 &
916
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
917

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

921
922
923
924
925
926
927
928
929
930
931
932
933
  * 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.

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

939
940
941
942
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

943
944
945
  * 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
946
    check is done for the arguments of autfilt --sat-minimize=...
947

948
949
950
951
952
953
954
955
956
  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.

957
958
959
960
961
962
963
  * 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

964
965
966
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

967
  * is_deterministic(), is_terminal(), is_weak(), and
968
969
970
    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
971
    their check.
972

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

979
980
981
982
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

983
984
985
  * language_containment_checker now has default values for all
    parameters of its constructor.

986
987
988
989
  * 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.

990
991
992
993
    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.

994
995
  * 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
996
    what their names suggest.  Note that twa::accepting_run(), unlike
997
998
999
    the two others, is currently restricted to automata with Fin-less
    acceptance.

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

1005
  * New LTL and PSL simplification rules:
1006
1007
    - 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
1008
1009
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
1010

1011
1012
1013
1014
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

1015
1016
1017
1018
1019
  * 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.

1020
1021
  Python:

1022
  * The __format__() method for formula supports the same
1023
1024
1025
1026
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

1027
1028
  * Bindings for language_containment_checker were added.

1029
1030
  * Bindings for randomize() were added.

1031
1032
1033
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

1039
1040
1041
1042
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

1043
1044
1045
1046
  Documentation:

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

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

1051
  * Another new page shows how to implement an on-the-fly Kripke
1052
    structure for a custom state space.
1053
1054
    https://spot.lrde.epita.fr/tut51.html

1055
1056
  * The concepts.html page now lists all named properties
    used by automata.
1057

1058
1059
1060
1061
1062
1063
  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)".

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

1067
1068
1069
  * print_lbtt() had a memory leak when printing states without
    successors.

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

1072
1073
1074
1075
1076
  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
1077
1078
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
1079
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1080
  * The generalized testing automata displayed by the online
1081
    translator were incorrect (those output by ltl2tgta were OK).
1082
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
1083
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1084
1085
1086
    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.
1087

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1088
1089
1090
1091
1092
1093
1094
1095
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.
1096

1097
1098
1099
1100
  Bug fixes:

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

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

1106
1107
  Library:

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

1111
1112
1113
1114
1115
  Documentation:

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

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

1119
1120
1121
1122
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1123
1124
  Bug fixes:

1125
  * The automaton parser would choke on comments like /******/.
1126
  * check_strength() should also set negated properties.
1127
1128
1129
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
1130
1131
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
1132
  * spot::ltsmin::kripke() had the same issue.
1133
1134
1135
1136
  * 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.
1137
1138
1139
1140
1141
  * 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
1142
  * For Small or Deterministic preference, the postprocessor
1143
1144
1145
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
1146
1147
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1148
  * Various typos and minor documentation fixes.
1149

1150

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

1153
1154
1155
  Command-line tools:

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

1159
1160
1161
  Python:

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

1164
1165
1166
1167
  Library:

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

1168
1169
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1170
1171
1172
1173
1174
  * 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.
1175

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

1178
1179
  Command-line tools:

1180
1181
1182
  * 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.
1183

1184
1185
  Library:

1186
1187
1188
  * 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.
1189
  * twa::ap_var() renamed to twa::ap_vars().
1190
1191
1192
1193
  * 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().
1194
1195
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
1196

1197
1198
1199
1200
  Documentation:

  * The page https://spot.lrde.epita.fr/upgrade2.html should help
    people migrating old C++ code written for Spot 1.2.x, and update
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1201
    it for (the upcoming) Spot 2.0.
1202

1203
1204
1205
1206
  Bug fixes:

  * spot/twaalgos/gtec/gtec.hh was incorrectly installed as
  spot/tgbaalgos/gtec/gtec.hh.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1207
  * The shared libraries should now compile again on Darwin.
1208

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1209
New in spot 1.99.8 (2016-02-18)
1210

1211
1212
  Command-line tools:

1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
  * ltl2tgba now also support the --generic option (already supported
    by ltldo and autfilt) to lift any restriction on the acceptance
    condition produced.  This option now has a short version: -G.

  * ltl2tgba and autfilt have learnt how to determinize automata.
    For this to work, --generic acceptance should be enabled (this
    is the default for autfilt, but not for ltl2tgba).

    "ltl2tgba -G -D" will now always outpout a deterministic automaton.
    It can be an automaton with transition-based parity acceptance in
    case Spot could not find a deterministic automaton with (maybe
    generalized) Büchi acceptance.

    "ltl2tgba -D" is unchanged (the --tgba acceptance is the default),
    and will output a deterministic automaton with (generalized) Büchi
    acceptance only if one could be found.  Otherwise a
    non-deterministic automaton is output, but this does NOT mean that
    no deterministic Büchi automaton exist for this formula.  It only
    means Spot could not find it.

    "autfilt -D" will determinize any automaton, because --generic
    acceptance is the default for autfilt.

    "autfilt -D --tgba" will behave like "ltl2tgba -D", i.e., it may
    fail to find a deterministic automaton (even if one exists) and
    return a nondeterministic automaton.

1240
1241