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

3
4
5
6
7
8
9
10
  Tools:

  - genltl learned to generate 4 new families of formulas, taken
    from Müller & Sickert's GandALF'17 paper:
    --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})|(...))
11

12
13
14
15
  - autfilt learned --streett-like to convert an automaton in order to
    have a Streett-like acceptance condition. It only works with
    ω-automata having an acceptance in disjunctive normal form.

16
17
18
19
20
  - autfilt learned --dca to convert a Streett-like automaton or an
    automaton with an acceptance in disjunctive normal form to a
    deterministic co-Büchi automaton using the new functions
    [nsa-dnf]_to_dca() described below.

21
22
23
24
25
  Library:

  - Rename three methods of spot::scc_info. New names are clearer. The
    old names have been deprecated.

26
27
28
29
30
  - The new function scc_info::states_on_acc_cycle_of() is able to
    return all states visited by any accepting cycles of the
    specified SCC. It must only be called on automata with a
    Streett-like acceptance condition.

31
32
33
34
35
  - The new function dnf_to_streett() is able to convert any automaton
    with an acceptance condition in Disjunctive Normal Form to a
    Streett-like automaton. This is used by the new option
    '--streett-like' of autfilt.

36
37
38
39
40
41
42
43
  - The new functions spot::nsa_to_[nca-dca]()
    (or spot::dnf_to_[nca-dca]()) are able to convert when possible a
    Streett-like automaton (or any automaton with an acceptance in DNF)
    to an equivalent 'nca' (nondeterministic co-Büchi automaton) or
    'dca' (deterministic co-Büchi automaton).  Actually the resulting
    automaton will always recognize at least the same language.  It can
    recognize more if the original language can not be expressed with
    a co-Büchi acceptance condition.
44

45
46
47
48
49
50
51
52
53
  Deprecation notices:

  (These functions still work but compilers emit warnings.)

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

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

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

67
68
  Tools:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
69
70
71
72
73
74
75
76
  - 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).

77
  - genltl learned two generate two new families of formulas:
78
79
80
81
82
83
      --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).

84
  - autfilt learned to build the union (--sum) or the intersection
Maximilien Colange's avatar
Typos    
Maximilien Colange committed
85
86
    (--sum-and) of two languages by putting two automata side-by-side
    and fiddling with the initial states.  This complements the already
87
88
    implemented intersection (--product) and union (--product-or),
    both based on a product.
89

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

93
94
95
96
  - autfilt learned --split-edges to convert labels that are Boolean
    formulas into labels that are min-terms.  (See spot::split_edges()
    below.)

97
98
99
  - autfilt learned --simplify-acceptance to simplify some acceptance
    conditions.  (See spot::simplify_acceptance() below.)

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

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

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

113
114
  Library:

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

118
  - spot::sum() and spot::sum_and() implements the union and the
119
    intersection of two automata by putting them side-by-side and
120
    using non-deterministim or universal branching on the initial
121
    state.
122

123
124
125
  - 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
126
  - spot::dualize() complements any alternating automaton.  Since
127
128
129
    the dual of a deterministic automaton is still deterministic, the
    function spot::dtwa_complement() has been deprecated and simply
    calls spot::dualize().
130

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

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

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

147
148
149
150
  - 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
151
152
153
154
155
    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
156
157
158
159
160
161
162

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

163
164
165
166
  - 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".

167
168
169
170
171
  - 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.

172
173
174
175
176
177
  - 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.
178

179
180
181
182
183
  - 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.

184
185
186
187
188
189
190
  - 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.

191
192
193
  - spot::scc_info has two new methods to easily iterate over the
    edges of an SCC: edges_of() and inner_edges_of().

194
195
196
  - spot::scc_info can now be passed a filter function to ignore
    or cut some edges.

197
198
199
200
201
  - 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.

202
203
204
205
206
207
  - 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().

208
209
210
211
212
  - 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.

213
214
215
216
  - 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.

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

220
221
222
223
224
  - 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.

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

230
231
232
233
  - twa_graph::copy_state_names_from() can be used to copy the state
    names from another automaton, honoring "original-states" if
    present.

234
235
  - 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
236
    data-structures are exponential in N.  However a formula like
237
238
239
240
241
242
243
244
      ((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).

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

249
250
251
252
    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]}.

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

257
258
  - spot::sbacc() is can now also convert alternating automata
    to state-based acceptance.
259

260
261
262
  - spot::sbacc() and spot::degeneralize() learned to merge
    accepting sinks.

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

266
  - The & and | operators for acceptannce conditions have been changed
267
    slightly to be more symmetrical.  In older versions, operator &
268
269
270
271
    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
272

273
274
275
276
  - 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).

277
278
279
280
281
282
283
284
285
  - 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
286
  - The parser for HOA now recognizes and verifies correct use of the
287
    "univ-branch" property.  This is known to be a problem with option
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
288
    -H1 of ltl3ba 1.1.2 and ltl3dra 0.2.4, so the environment variable
289
290
    SPOT_HOA_TOLERANT can be set to disable the diagnostic.

291
292
293
294
295
  Python:

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

296
297
298
299
  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
300
    generalized co-Büchi), it would sometimes output an automaton with
301
302
    transition-based acceptance but marked as state-based.

303
304
  - The complete() function could complete an empty co-Büchi automaton
    into an automaton accepting everything.
305

306
307
308
309
310
311
312
313
314
315
  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.

316
317
318
319
320
321
322
  - 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.

323
324
325
  - spot::acc_cond::mark_t::sets() now returns an internal iterable
    object instead of an std::vector<unsigned>.

326
327
328
329
  - 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.

330
  deprecation notices:
331

332
  (these functions still work but compilers emit warnings.)
333

334
335
336
  - spot::decompose_strength() is deprecated, it has been renamed
    to spot::decompose_scc().

337
  - spot::dtwa_complement() is deprecated.  prefer the more generic
338
339
    spot::dualize() instead.

340
  - the spot::twa::prop_deterministic() methods have been renamed to
341
    spot::twa::prop_universal() for consistency with the change to
342
    is_deterministic() listed above.  we have kept
343
344
    spot::twa::prop_deterministic() as a deprecated synonym for
    spot::twa::prop_universal() to help backward compatibility.
345

346
  - the spot::copy() function is deprecated.  use
347
348
    spot::make_twa_graph() instead.

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

351
352
  Bugs fixed:

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

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

362
363
364
365
366
367
  - 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
368
369
370
  - Our verson of BuDDy had an incorrect optimization for the
    biimp operator.

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

373
374
  Bugs fixed:

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

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

381
382
383
  - ltldo and ltlcross could leave temporary files behind when
    aborting on error.

384
385
386
387
  - 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.

388
389
390
391
  - 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
392
New in spot 2.3.3 (2017-04-11)
393

394
395
396
397
398
  Tools:

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

399
  - genltl learned --spec-patterns as an alias for --dac-patterns; it
400
401
402
    also learned two new sets of LTL formulas under --hkrss-patterns
    (a.k.a. --liberouter-patterns) and --p-patterns
    (a.k.a. --beem-patterns).
403

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
409
410
  - The output of 'genltl --r-left=1 --r-right=1 --format=%F' had
    typos.
411

412
413
414
415
  - 'ltl2tgba Fa | autfilt --complement' would incorrectly claim that
    the output is "terminal" because dtwa_complement() failed to reset
    that property.

416
417
418
  - spot::twa_graph::purge_unreachable_states() was misbehaving on
    alternating automata.

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

422
423
424
425
426
427
  - 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
428
New in spot 2.3.2 (2017-03-15)
429

430
431
  Tools:

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

438
439
  Python:

440
441
  - The bdd_to_formula(), and to_generalized_buchi() functions can now
    be called in Python.
442

443
444
445
446
447
  Documentation:

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

448
449
450
451
452
  Bugs fixed:

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

453
454
455
  - Because of a typo, the output of --stats='...%P...' was correct
    only if %p was used as well.

456
457
458
  - genltl was never meant to have (randomly attributed) short
    options for --postive and --negative.

459
460
461
462
  - 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).

463
464
  - 'ltl2tgba --any -C -M ...' would not complete automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
465
  - While not incorrect, the HOA properties output by 'ltl2tgba -M'
466
467
468
469
    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'.

470
471
472
  - spot::twa_graph::set_univ_init_state() could not be called with
    an initializer list.

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
476
  - Instantiating an emptiness check on an automaton with unsupported
477
478
479
480
    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
481
  Deprecation notice:
482
483
484
485

  - 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
486
487
    for consistency with tools producing automata, where %a means
    something else.
488

489

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

492
493
494
495
496
497
  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.

498
499
500
  - The colors used in the output of ltlcross have been adjusted to
    work better with white backgrounds and black backgrounds.

501
502
503
  - The option (y) has been added to --dot. It splits the universal
    edges with the same targets but different colors.

504
505
506
507
508
  - 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.

509
510
511
512
  Library:

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

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

517
518
519
520
521
522
523
  Bugs fixed:

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

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

525
526
527
528
529
530
  - 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.

531
532
533
  - alternation_removal() was not always reporting the unsupported
    non-weak automata.

534
535
536
537
  - a long-standing typo in the configure code checking for Python
    caused any user-defined CPPFLAGS to be ignored while building
    Spot.

538
539
540
541
  - 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
542
New in spot 2.3 (2017-01-19)
543

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

555
556
557
  * The development Debian packages for Spot now install static
    libraries as well.

558
559
  * We now install configuration files for users of pkg-config.

560
561
  Tools:

562
563
564
  * 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
565
566
    --no-check --product=0 --csv=..." will work with any alternating
    automaton if you just want satistics.
567

568
569
570
571
572
573
  * 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.

574
575
576
  * autfilt has three new filters: --is-very-weak, --is-alternating,
    and --is-semi-deterministic.

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

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

583
584
585
586
587
  * '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/.
588

589
590
591
592
  * 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
593
    See https://spot.lrde.epita.fr/hierarchy.html
594

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

599
600
601
602
603
604
  * 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.

605
606
607
  * ltldo and ltlcross have learned how to call ltl3hoa, so
    'ltl3hoa -f %f>%O' can be abbreviated to just 'ltl3hoa'.

608
609
610
  Library:

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

614
  * Couvreur's emptiness check has been rewritten to use the explicit
615
616
    interface when possible, to avoid overkill memory allocations.
    The new version has further optimizations for weak and terminal
617
618
619
    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.
620

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

625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
  * 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.

643
    - scc_info has been adjusted to handle universal edges as if they
644
645
646
      were existential edges.  As a consequence, acceptance
      information is not accurate.

647
648
649
650
651
652
653
    - 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
654
655
656
    - 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.
657

658
659
660
661
  * 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().
662

663
664
665
666
667
668
  * 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.

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

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

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

677
678
679
680
  * 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.
681

682
683
684
685
  * 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).
686

687
688
689
  * The new function mp_class(f) returns the class of the formula
    f in the temporal hierarchy of Manna & Pnueli.

690
691
692
693
694
695
696
697
698
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.

699
Bugs fixed:
700
701
702
703
704
705
706
707

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

708
709
710
711
  * 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.

712
713
714
715
  * 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.

716
717
718
  * 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
719
New in spot 2.2.2 (2016-12-16)
720

721
722
723
724
725
  Build:

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

726
727
728
729
  Bug fixes:

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

731
732
733
734
735
  * 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.

736
737
738
739
740
  * 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.

741
742
743
744
  * Some of the installed headers (spot/misc/fixpool.hh,
    spot/misc/mspool.hh, spot/twaalgos/emptiness_stats.hh) were not
    self-contained.

745
746
747
  * ltlfilt --from-ltlf should ensure that "alive" holds initially in
    order to reject empty traces.

748
749
750
  * 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
751
New in spot 2.2.1 (2016-11-21)
752

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
753
  Bug fix:
754

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
755
756
  * The bdd_noderesize() function, as modified in 2.2, would always
    crash.
757

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

760
761
762
763
764
765
  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
766
767
768
769
  * "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.

770
771
772
  * 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
773
774
775
776
    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
777

778
779
  Library:

780
781
782
  * from_ltlf() is a new function implementing the --from-ltlf
    transformation described above.

783
  * is_unambiguous() was rewritten in a more efficient way.
784

785
  * scc_info learned to determine the acceptance of simple SCCs made
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
786
    of a single self-loop without resorting to remove_fin() for complex
787
788
789
790
791
792
    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.
793

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
794
795
  * Simulation-based reductions now implement just bisimulation-based
    reductions on deterministic automata, to save time.  As an example,
796
797
798
    this halves the run time of
       genltl --rv-counter=10 | ltl2tgba

799
800
  * scc_filter() learned to preserve state names and highlighted states.

801
802
803
804
805
  * 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).

806
807
808
809
810
811
812
813
  * 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
814
815
816
    with any Fin-acceptance removal performed before the product.
    However the plan is to implement these more efficiently in the
    future.
817

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
818
  Bug fixes:
819

820
  * ltl2tgba was always using the highest settings for the LTL
821
822
823
824
    simplifier, ignoring the --low and --medium options.  Now
      genltl --go-theta=12 | ltl2tgba --low --any
    is instantaneous as it should be.

825
826
827
  * 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.)
828

829
830
831
  * 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
832
  * Running the LTL parser in debug mode would crash.
833

834
  * tgba_determinize() could produce incorrect deterministic automata
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
835
    when run with use_simulation=true (the default) on non-simplified
836
837
    automata.

838
839
  * When the automaton_stream_parser reads an automaton from an
    already opened file descriptor, it will not close the file
840
841
842
843
    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.
844

845
846
847
  * remove_fin() could produce incorrect result on incomplete
    automata tagged as weak and deterministic.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
848
849
850
  * 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.
851

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

855
New in spot 2.1.2 (2016-10-14)
856

857
858
859
860
861
862
  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.

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

869
870
871
872
873
874
875
876
  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)).

877
878
  Bug fixes:

879
  * Fix spurious uninitialized read reported by valgrind when
880
    is_Kleene_star() is compiled by clang++.
881

882
  * Using "ltlfilt some-large-file --some-costly-filter" could take
883
884
885
886
887
888
889
    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.

890
891
892
893
  * 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.
894

895
896
  * Fix ltlcross crash when combining --no-check with --verbose.

897
898
899
  * 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
900
New in spot 2.1.1 (2016-09-20)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
901

902
903
904
  Command-line tools:

  * ltlfilt, randltl, genltl, and ltlgrind learned to display the size
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
905
    (%s), Boolean size (%b), and number of atomic propositions (%a)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
906
907
    with the --format and --output options.  A typical use-case is to
    sort formulas by size:
908
909
910
911
       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'

912
913
914
  * autfilt --stats learned the missing %D, %N, %P, and %W sequences,
    to complete the existing %d, %n, %p, and %w.

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

920
921
922
  Bugs fixed:

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

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

928
929
  Command-line tools:

930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
  * 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.

956
957
958
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

959
960
  * ltlcross and ltldo learned to bypass the shell when executing
    simple commands (with support for single or double-quoted
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
    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.
979

980
981
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
982
983
984
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

985
  * autfilt learned --remove-unused-ap to remove atomic propositions
986
987
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
988
    declare atomic propositions (HOA & DSTAR).
989

990
  * autfilt learned two options to filter automata by count of used or
991
992
993
994
    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.

995
996
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
997

998
  * autfilt learned to filter automata representing stutter-invariant
999
1000
    properties with --is-stutter-invariant.

1001
  * autfilt learned two new options to highlight non-determinism:
1002
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
1003
1004
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
1005

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

1010
1011
1012
  * autfilt learned two options --generalized-rabin and
    --generalized-streett to convert the acceptance conditions.

1013
  * genltl learned three new families: --dac-patterns=1..45,
1014
1015
1016
    --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 &
1017
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
1018

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

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

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

1040
1041
1042
1043
  * autfilt and dstar2tgba learned to read automata from columns in
    CSV files, specified using the same filename/COLUMN syntax used by
    tools reading formulas.

1044
1045
1046
  * 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
1047
    check is done for the arguments of autfilt --sat-minimize=...
1048

1049
1050
1051
1052
1053
1054
1055
1056
1057
  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.

1058
1059
1060
1061
1062
1063
1064
  * 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

1065
1066
1067
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

1068
  * is_deterministic(), is_terminal(), is_weak(), and
1069
1070
1071
    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
1072
    their check.
1073

1074
1075
1076
1077
1078
1079
  * 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.

1080
1081
1082
1083
  * to_generalized_rabin() and to_generalized_streett() are two new
    functions that convert the acceptance condition as requested
    without changing the transition structure.

1084
1085
1086
  * language_containment_checker now has default values for all
    parameters of its constructor.

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

1091
1092
1093
1094
    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.

1095
1096
  * 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
1097
    what their names suggest.  Note that twa::accepting_run(), unlike
1098
1099
1100
    the two others, is currently restricted to automata with Fin-less
    acceptance.

1101
1102
1103
1104
1105
  * 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.

1106
  * New LTL and PSL simplification rules:
1107
1108
    - 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
1109
1110
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
1111

1112
1113
1114
1115
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

1116
1117
1118
1119
1120
  * 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.

1121
1122
  Python:

1123
  * The __format__() method for formula supports the same
1124
1125
1126
1127
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

1128
1129
  * Bindings for language_containment_checker were added.

1130
1131
  * Bindings for randomize() were added.

1132
1133
1134
  * Iterating over edges via "aut.out(s)" or "aut.edges()"
    now allows modifying the edge fields.

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

1140
1141
1142
1143
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

1144
1145
1146
1147
  Documentation:

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

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

1152
  * Another new page shows how to implement an on-the-fly Kripke
1153
    structure for a custom state space.
1154
1155
    https://spot.lrde.epita.fr/tut51.html

1156
1157
  * The concepts.html page now lists all named properties
    used by automata.
1158

1159
1160
1161
1162
1163
1164
  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)".

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

1168
1169
1170
  * print_lbtt() had a memory leak when printing states without
    successors.

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

1173
1174
1175
1176
1177
  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
1178
1179
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
1180
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1181
  * The generalized testing automata displayed by the online
1182
    translator were incorrect (those output by ltl2tgta were OK).
1183
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
1184
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1185
1186
1187
    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.
1188

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1189
1190
1191
1192
1193
1194
1195
1196
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.
1197

1198
1199
1200
1201
  Bug fixes:

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

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

1207
1208
  Library:

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

1212
1213
1214
1215
1216
  Documentation:

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

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

1220
1221
1222
1223
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1224
1225
  Bug fixes:

1226
  * The automaton parser would choke on comments like /******/.
1227
  * check_strength() should also set negated properties.
1228
1229
1230
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
1231
1232
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
1233
  * spot::ltsmin::kripke() had the same issue.
1234
1235
1236
1237
  * 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.
1238
1239
1240
1241
1242
  * 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
1243
  * For Small or Deterministic preference, the postprocessor
1244
1245
1246
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
1247
1248
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1249
  * Various typos and minor documentation fixes.
1250

1251

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

1254
1255
1256
  Command-line tools:

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

1260
1261
1262
  Python:

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