NEWS 132 KB
Newer Older
1
New in spot 2.0.3a (not yet released)
2

3
4
  Command-line tools:

5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
  * 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.

31
32
33
  * ltldo has a new option --errors=... to specify how to deal
    with errors from executed tools.

34
35
  * autfilt learned to filter automata by count of SCCs (--sccs=RANGE)
    or by type of SCCs (--accepting-sccs=RANGE,
36
37
38
    --rejecting-sccs=RANGE, trivial-sccs=RANGE, --terminal-sccs=RANGE,
    --weak-sccs=RANGE, --inherently-weak-sccs=RANGE).

39
40
41
42
  * autfilt learned --remove-unused-ap to remove atomic proposition
    that are declared in the input automaton, but not actually used.
    This of course makes sense only for input/output formats that
    declare atomic proposition (HOA & DSTAR).
43

44
  * autfilt learned two options to filter automata by count of used or
45
46
47
48
    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.

49
50
  * autfilt learned to filter automata by count of nondeterministsic
    states with --nondet-states=RANGE.
51

52
  * autfilt learned to filter automata representing stutter-invariant
53
54
    properties with --is-stutter-invariant.

55
  * autfilt learned two new options to highlight non-determinism:
56
    --highlight-nondet-states=NUM and --highlight-nondet-states=NUM
57
58
    where NUM is a color number.  Additionally --highlight-nondet=NUM is
    a shorthand for using the two.
59

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

64
  * ltlcross and ltldo learned a new syntax to specify that an input
65
66
67
68
69
70
71
72
73
74
75
76
77
    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.

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

81
  * genltl learned three new families: --dac-patterns=1..45,
82
83
84
    --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 &
85
    Holzmann (Concur'00), Somenzi & Bloem (CAV'00).
86

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

90
91
92
  * 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
93
    check is done for the arguments of autfilt --sat-minimize=...
94

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

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

111
112
113
  * highlight_nondet_states() and highlight_nondet_edges() are
    new functions that define the above two named properties.

114
  * is_deterministic(), is_terminal(), is_weak(), and
115
116
117
    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
118
    their check.
119

120
121
122
  * language_containment_checker now has default values for all
    parameters of its constructor.

123
124
125
126
  * 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.

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

131
132
133
134
135
136
  * spot::twa has two new methods that supplement is_empty():
    twa::accepting_run() and twa::accepting_word().  They compute
    what their name suggests.  Note that twa::accepting_run(), unlike
    the two others, is currently restricted to automata with Fin-less
    acceptance.

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

142
  * New LTL and PSL simplification rules:
143
144
    - 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
145
146
    - {s[*0..j]}[]->b = {s[*1..j]}[]->b
    - {s[*0..j]}<>->b = {s[*1..j]}<>->b
147

148
149
150
151
  * spot::twa::succ_iterable renamed to
    spot::internal::twa_succ_iterable to make it clear this is not for
    public consumption.

152
153
154
155
156
  * 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.

157
158
  Python:

159
  * The __format__() method for formula supports the same
160
161
162
163
    operator-rewritting feature introduced in ltldo and ltlcross.
    So "{:[i]s}".format(f) is the same as
    "{:s}".format(f.unabbreviate("i")).

164
165
  * Bindings for language_containment_checker were added.

166
167
  * Bindings for randomize() were added.

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

173
174
175
176
  * The %%dve and %%pml magics honor the SPOT_TMPDIR and
    TMPDIR environment variables.  This especially helps
    when the current directory is read-only.

177
178
179
180
  Documentation:

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

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

185
186
187
188
  * Another new page shows how to implement an on-the-fly Kripke
    structure to implement a custom state space.
    https://spot.lrde.epita.fr/tut51.html

189
190
  * The concepts.html page now lists all named properties
    used by automata.
191

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

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

201
202
203
  * print_lbtt() had a memory leak when printing states without
    successors.

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

206
207
208
209
210
  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
211
212
    choice of the level is free, it reused the last level ever used.
    This caused some posterior simulation-based reductions to be less
213
    efficient at reducing automata (on the average).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
214
  * The generalized testing automata displayed by the online
215
    translator were incorrect (those output by ltl2tgta were OK).
216
  * ltl2tgta should not offer options --ba, --monitor, --tgba and such.
217
  * the relabel() function could incorrectly unregister old atomic
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
218
219
220
    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.
221

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
222
223
224
225
226
227
228
229
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.
230

231
232
233
234
  Bug fixes:

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

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

240
241
  Library:

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

245
246
247
248
249
  Documentation:

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

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

253
254
255
256
  Python:

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
257
258
  Bug fixes:

259
  * The automaton parser would choke on comments like /******/.
260
  * check_strength() should also set negated properties.
261
262
263
  * Fix autfilt to apply --simplify-exclusive-ap only after
    the simplifications of (--small/--deterministic) have
    been performed.
264
265
  * The automaton parser did not fully register atomic propositions
    for automata read from never claim or as LBTT.
266
  * spot::ltsmin::kripke() had the same issue.
267
268
269
270
  * 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.
271
272
273
274
275
  * 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
276
  * For Small or Deterministic preference, the postprocessor
277
278
279
    will now unregister atomic propositions that are no longer
    used in labels.   Simplification of exclusive properties
    and remove_ap::strip() will do similarly.
280
281
  * bench/ltl2tgba/ was not working since the source code
    reorganization of 1.99.7.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
282
  * Various typos and minor documentation fixes.
283

284

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

287
288
289
  Command-line tools:

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

293
294
295
  Python:

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

298
299
300
301
  Library:

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

302
303
  Documentation:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
304
305
306
307
308
  * 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.
309

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

312
313
  Command-line tools:

314
315
316
  * 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.
317

318
319
  Library:

320
321
322
  * 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.
323
  * twa::ap_var() renamed to twa::ap_vars().
324
325
326
327
  * 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().
328
329
  * tgba_reachable_iterator (and subclasses) was renamed to
    twa_reachable_iterator for consistency.
330

331
332
333
334
  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
335
    it for (the upcoming) Spot 2.0.
336

337
338
339
340
  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
341
  * The shared libraries should now compile again on Darwin.
342

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

345
346
  Command-line tools:

347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
  * 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.

374
375
376
377
378
  * "autfilt --complement" now also works for non-deterministic
    automata but will output a deterministic automaton.
    "autfilt --complement --tgba" will likely output a
    nondeterministic TGBA.

379
380
381
  * autfilt has a new option, --included-in, to filter automata whose
    language are included in the language of a given automaton.

382
383
384
  * autfilt has a new option, --equivalent-to, to filter automata
    that are equivalent (language-wise) to a given automaton.

385
386
387
388
389
390
391
  * ltlcross has a new option --determinize to instruct it to
    complement non-deterministic automata via determinization.  This
    option is not enabled by default as it can potentially be slow and
    generate large automata.  When --determinize is given, option
    --product=0 is implied, since the tests based on products with
    random state-space are pointless for deterministic automata.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
392
393
394
  * ltl2tgba and ltldo now support %< and %> in the string passed
    to --stats when reading formulas from a CSV file.

395
396
397
398
399
  * ltlfilt's option --size-min=N, --size-max=N, --bsize-min=N, and
    --bsize-max=N have been reimplemented as --size=RANGE and
    --bsize=RANGE.  The old names are still supported for backward
    compatibility, but they are not documented anymore.

400
401
  * ltlfilt's option --ap=N can now take a RANGE as parameter.

402
403
404
  * autfilt now has a --ap=RANGE option to filter automata by number
    of atomic propositions.

405
406
407
408
409
  Library:

  * Building products with different dictionaries now raise an
    exception instead of using an assertion that could be disabled.

410
  * The load_ltsmin() function has been split in two.  Now you should
411
    first call ltsmin_model::load(filename) to create an ltsmin_model,
412
    and then call the ltsmin_model::kripke(...) method to create an
413
414
415
    automaton that can be iterated on the fly.  The intermediate
    object can be queried about the supported variables and their
    types.
416

417
418
419
420
421
422
423
424
425
426
427
428
  * print_dot() now accepts several new options:
    - use "<N" to specify a maximum number of states to output.
      Incomplete states are then marked appropriately.  For a quick
      example, compare
	ltl2tgba -D 'Ga | Gb | Gc' -d'<3'
      with
        ltl2tgba -D 'Ga | Gb | Gc' -d
    - use "C(color)" to specify the color to use for filling states.
    - use "#" to display the internal number of each transition
    - use "k" to use state-based labels when possible.  This is
      similar to the "k" option already supported by print_hoa(), and
      is useful when printing Kripke structures.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
429

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
430
431
  * Option "k" is automatically used by print_dot() and print_hoa()
    when printing Kripke structures.
432

433
434
435
436
  * print_dot() also honnor two new automaton properties called
    "highlight-edges" and "highlight-states".  These are used to color
    a subset of edges or transitions.

437
438
439
440
  * There is a new tgba_determinize() function.  Despite its name, it
    in facts works on transition-based Büchi automaton, and will first
    degeneralize any automaton with generalized Büchi acceptance.

441
442
443
  * The twa_safra_complement class has been removed.  Use
    tgba_determinize() and dtwa_complement() instead.

444
445
  * The twa::transition_annotation() and
    twa::compute_support_conditions() methods have been removed.
446

447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
  * The interface for all functions parsing formulas (LTL, PSL, SERE,
    etc.) has been changed to use an interface similar to the one used
    for parsing automata.  These function now return a parsed_formula
    object that includes both a formula and a list of syntax errors.

    Typically a function written as

       spot::formula read(std::string input)
       {
	  spot::parse_error_list pel;
	  spot::formula f = spot::parse_infix_psl(input, pel);
	  if (spot::format_parse_errors(std::cerr, input, pel))
	    exit(2);
	  return f;
       }

    should be updated to

       spot::formula read(std::string input)
       {
	  spot::parsed_formula pf = spot::parse_infix_psl(input);
	  if (pf.format_errors(std::cerr))
	    exit(2);
	  return pf.f;
       }

473
474
  Python:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
475
476
477
  * The ltsmin interface has been binded in Python.  It also
    comes with a %%dve cell magic to edit DiVinE models in the notebook.
    See https://spot.lrde.epita.fr/ipynb/ltsmin.html for a short example.
478

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
479
480
481
482
483
  * spot.setup() sets de maximum number of states to display in
    automata to 50 by default, as more states is likely to be
    unreadable (and slow to process by GraphViz).  This can be
    overridden by calling spot.setup(max_states=N).

484
485
486
487
  * Automata now have methods to color selected states and
    transitions.  See
    https://spot.lrde.epita.fr/ipynb/highlighting.html for an example.

488
489
490
491
492
  Documentation:

  * There is a new page giving informal illustrations (and extra
    pointers) for some concepts used in Spot.
    See https://spot.lrde.epita.fr/concepts.html
493

494
  Bug fixes:
495
496
497

  * Using ltl2tgba -U would fail to output the unambiguous property
    (regression introduced in 1.99.7)
498
499
  * ltlfilt, autfilt, randltl, and randaut could easily crash when
    compiled statically (i.e., with configure --disable-shared).
500
  * "1 U (a | Fb)" was not always simplified to "F(a | b)".
501
502
  * destroying the operands of an otf_product() before the product
    itself could crash.
503

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
504
New in spot 1.99.7 (2016-01-15)
505
506
507

  Command-line tools:

508
  * BACKWARD INCOMPATIBLE CHANGE: All tools that output automata now
509
    use the HOA format by default instead of the GraphViz output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
510
    This makes it easier to pipe several commands together.
511
512
513
514
515
516

    If you have an old script that relies on GraphViz being the default
    output and that you do not want to update it, use
       export SPOT_DEFAULT_FORMAT=dot
    to get the old behavior back.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
517
518
519
  * Tools that output automata now accept -d as a shorthand for --dot
    since requesting the GraphViz (a.k.a. dot) output by hand is now
    more frequent.
520
521
    randaut's short option for specifying edge-density used to be -d:
    it has been renamed to -e.
522

523
  * The SPOT_DEFAULT_FORMAT environment variable can be set to 'dot'
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
524
525
    or 'hoa' to force a default output format for automata.  Additional
    options may also be added, as in SPOT_DEFAULT_FORMAT='hoa=iv'.
526

527
528
  * autfilt has a new option: --is-inherently-weak.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
529
530
531
  * The --check=strength option of all tools that produce automata
    will also test if an automaton is inherently weak.

532
533
  Library:

534
535
536
537
538
539
540
541
542
  * Installed headers now assume that they will be included as
    #include <spot/subdir/header.hh>
    instead of
    #include <subdir/header.hh>

    This implies that when Spot headers are installed in
    /usr/include/spot/... (the default when using the Debian packages)
    or /usr/local/include/spot/... (the default when compiling from
    source), then it is no longuer necessary to add
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
543
544
545
    -I/usr/include/spot or -I/usr/local/include/spot when compiling,
    as /usr/include and /usr/local/include are usually searched by
    default.
546
547
548
549

    Inside the source distribution, the subdirectory src/ has been
    renamed to spot/, so that the root of the source tree can also be
    put on the preprocessor's search path to compile against a
550
551
    non-installed version of Spot.  Similarly, iface/ltsmin/ has been
    renamed to spot/ltsmin/, so that installed and non-installed
552
    directories can be used similarly.
553

554
555
556
557
  * twa::~twa() is now calling
      get_dict()->unregister_all_my_variable(this);
    so this does not need to be done in any subclass.

558
559
560
561
  * is_inherently_weak_automaton() is a new function, and
    check_strength() has been modified to also check inherently weak
    automata.

562
563
564
565
  * decompose_strength() is now extracting inherently weak SCCs
    instead of just weak SCCs.  This gets rid of some corner cases
    that used to require ad hoc handling.

566
567
568
569
  * acc_cond::acc_code's methods append_or(), append_and(), and
    shift_left() have been replaced by operators |=, &=, <<=, and for
    completeness the operators |, &, and << have been added.

570
571
572
  * Several methods have been removed from the acc_cond
    class because they were simply redundant with the methods of
    acc_cond::mark_t, and more complex to use.
573

574
       acc_cond::marks(...)      -> use acc_cond::mark_t(...)
575
       acc_cond::sets(m)         -> use m.sets()
576
       acc_cond::has(m, u)       -> use m.has(u)
577
578
579
580
       acc_cond::cup(l, r)       -> use l | r
       acc_cond::cap(l, r)       -> use l & r
       acc_cond::set_minus(l, r) -> use l - r

581
    Additionally, the following methods/functions have been renamed:
582
583
584

       acc_cond::is_tt() -> acc_cond::is_t()
       acc_cond::is_ff() -> acc_cond::is_f()
585
       parse_acc_code()  -> acc_cond::acc_code(...)
586

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
587
  * Automata property flags (those that tell whether the automaton is
588
589
590
    deterministic, weak, stutter-invariant, etc.) are now stored using
    three-valued logic: in addition to "maybe"/"yes" they can now also
    represent "no".  This is some preparation for the upcomming
591
592
593
594
595
596
597
598
    support of the HOA v1.1 format, but it also saves time in some
    algorithms (e.g, is_deterministic() can now return immediately on
    automata marked as not deterministic).

  * The automaton parser now accept negated properties as they will be
    introduced in HOA v1.1, and will check for some inconsistencies.
    These properties are stored and used when appropriate, but they
    are not yet output by the HOA printer.
599

600
601
  Python:

602
603
604
605
  * Iterating over the transitions leaving a state (the
    twa_graph::out() C++ function) is now possible in Python.  See
    https://spot.lrde.epita.fr/tut21.html for a demonstration.

606
607
608
609
  * Membership to acceptance sets can be specified using Python list
    when calling for instance the Python version of twa_graph::new_edge().
    See https://spot.lrde.epita.fr/tut22.html for a demonstration.

610
611
612
  * Automaton states can be named via the set_state_names() method.
    See https://spot.lrde.epita.fr/ipynb/product.html for an example.

613
614
615
616
617
  Documentation:

  * There is a new page explaining how to compile example programs and
    and link them with Spot.  https://spot.lrde.epita.fr/compile.html

618
619
620
621
622
  * Python bindings for manipulating acceptance conditions are
    demonstrated by https://spot.lrde.epita.fr/ipynb/acc_cond.html,
    and a Python implementation of the product of two automata is
    illustrated by https://spot.lrde.epita.fr/ipynb/product.html

623
624
625
626
627
628
629
630
631
632
633
634
  Source code reorganisation:

  * A lot of directories have been shuffled around in the
    distribution:
      src/                   ->  spot/    (see rational above)
      iface/ltsmin/  (code)  ->  spot/ltsmin/
      wrap/python/           ->  python/
      src/tests/             ->  tests/core/
      src/sanity/            ->  tests/sanity/
      iface/ltsmin/  (tests) ->  tests/ltsmin/
      wrap/python/tests      ->  tests/python/

635
636
  Bug fixes:

637
638
  * twa_graph would incorrectly replace named-states during
    purge_dead_states and purge_unreachable_states.
639
640
  * twa::ap() would contain duplicates when an atomic proposition
    was registered several times.
641
642
  * product() would incorrectly mark the product of two
    sttuter-sensitive automata as stutter-sensitive as well.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
643
644
  * complete() could incorrectly reuse an existing (but accepting!)
    state as a sink.
645

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
646
New in spot 1.99.6 (2015-12-04)
647

648
649
  Command-line tools:

650
651
652
653
  * autfilt has two new filters: --is-weak and --is-terminal.

  * autfilt has a new transformation: --decompose-strength,
    implementing the decomposition of our TACAS'13 paper.
654
655
    A demonstration of this feature via the Python bindings
    can be found at https://spot.lrde.epita.fr/ipynb/decompose.html
656

657
658
659
660
661
662
  * All tools that output HOA files accept a --check=strength option
    to request automata to be marked as "weak" or "terminal" as
    appropriate.  Without this option, these properties may only be
    set as a side-effect of running transformations that use this
    information.

663
664
665
666
667
668
669
  Library:

  * Properties of automata (like the "properties:" line of the HOA
    format) are stored as bits whose interpretation is True=yes,
    False=maybe.  Having getters like "aut->is_deterministic()" or
    "aut->is_unambiguous()" was confusing, because there are separate
    functions "is_deterministic(aut)" and "is_unambiguous(aut)" that
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
670
671
    do actually check the automaton.  The getters have been renamed to
    avoid confusion, and get names more in line with the HOA format.
672
673
674
675
676
677
678
679
680

    - twa::has_state_based_acc() -> twa::prop_state_acc()
    - twa::prop_state_based_acc(bool) -> twa::prop_state_acc(bool)
    - twa::is_inherently_weak() -> twa::prop_inherently_weak()
    - twa::is_deterministic() -> twa::prop_deterministic()
    - twa::is_unambiguous() -> twa::prop_unambiguous()
    - twa::is_stutter_invariant() -> twa::prop_stutter_invariant()
    - twa::is_stutter_sensitive() -> twa::prop_stutter_sensitive()

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
681
    The setters have the same names as the getters, except they take a
682
683
684
    Boolean argument.  This argument used to be optionnal (defaulting
    to True), but it no longer is.

685
686
687
688
689
690
691
692
693
694
  * Automata now support the "weak" and "terminal" properties in
    addition to the previously supported "inherently-weak".

  * By default the HOA printer tries not to bloat the output with
    properties that are redundant and probably useless.  The HOA
    printer now has a new option "v" (use "-Hv" from the command line)
    to output more verbose "properties:".  This currently includes
    outputing "no-univ-branch", outputting "unambiguous" even for
    automata already tagged as "deterministic", and "inherently-weak"
    or "weak" even for automata tagged "weak" or "terminal".
695

696
697
698
699
  * The HOA printer has a new option "k" (use "-Hk" from the command
    line) to output automata using state labels whenever possible.
    This is useful to print Kripke structures.

700
701
702
703
704
  * The dot output will display pair of states when displaying an
    automaton built as an explicit product.  This works in IPython
    with spot.product() or spot.product_or() and in the shell with
    autfilt's --product or --product-or options.

705
706
707
708
709
710
711
  * The print_dot() function supports a new option, +N, where N is a
    positive integer that will be added to all set numbers in the
    output.  This is convenient when displaying two automata before
    building their product: use +N to shift the displayed sets of the
    second automaton by the number of acceptance sets N of the first
    one.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
712
  * The sat minimization for DTωA now does a better job at selecting
713
714
715
716
717
    reference automata when the output acceptance is the the same as
    the input acceptance.  This can provide nice speedups when tring
    to syntethise larged automata with different acceptance
    conditions.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
718
  * Explicit Kripke structures (i.e., stored as explicit graphs) have
719
    been rewritten above the graph class, using an interface similar
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
720
721
    to the twa class.  The new class is called kripke_graph.  The ad
    hoc Kripke parser and printer have been removed, because we can
722
723
    now use print_hoa() with the "k" option to print Kripke structure
    in the HOA format, and furthermore the parse_aut() function now
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
724
    has an option to load such an HOA file as a kripke_graph.
725

726
727
728
729
  * The HOA parser now accepts identifier, aliases, and headernames
    containing dots, as this will be allowed in the next version of
    the HOA format.

730
731
  * Renamings:
    is_guarantee_automaton() -> is_terminal_automaton()
732
    tgba_run -> twa_run
733
    twa_word::print -> operator<<
734
735
    dtgba_sat_synthetize() -> dtwa_sat_synthetize()
    dtgba_sat_synthetize_dichotomy() -> dtwa_sat_synthetize_dichotomy()
736

737
  Python:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
738

739
  * Add bindings for is_unambiguous().
740
  * Better interface for sat_minimize().
741

742
  Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
743

744
  * the HOA parser was ignoring the "unambiguous" property.
745
746
  * --dot=Bb should work like --dot=b, allowing us to disable
    a B option set via an environment variable.
747

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
748
New in spot 1.99.5 (2015-11-03)
749

750
751
752
  Command-line tools:

  * autfilt has gained a --complement option.
753
    It currently works only for deterministic automata.
754

755
  * By default, autfilt does not simplify automata (this has not
756
    changed), as if the --low --any options were used.  But now, if
757
758
759
    one of --small, --deterministic, or --any is given, the
    optimization level automatically defaults to --high (unless
    specified otherwise).  For symmetry, if one of --low, --medium, or
760
    --high is given, then the translation intent defaults to --small
761
762
    (unless specified otherwise).

763
764
765
766
  * autfilt, dstar2tgba, ltlcross, and ltldo now trust the (supported)
    automaton properties declared in any HOA file they read.  This can
    be disabled with option --trust-hoa=no.

767
768
769
  * ltlgrind FILENAME[/COL] is now the same as
    ltlgrind -F FILENAME[/COL] for consistency with ltlfilt.

770
771
  Library:

772
773
774
775
776
  * dtgba_complement() was renamed to dtwa_complement(), moved to
    complement.hh, and its purpose was restricted to just completing
    the automaton and complementing its acceptance condition.  Any
    further acceptance condition transformation can be done with
    to_generalized_buchi() or remove_fin().
777
778
779
780
781

  * The remove_fin() has learnt how to better deal with automata that
    are declared as weak.  This code was previously in
    dtgba_complement().

782
783
784
785
786
  * scc_filter_states() has learnt to remove useless acceptance marks
    that are on transitions between SCCs, while preserving state-based
    acceptance.  The most visible effect is in the output of "ltl2tgba
    -s XXXa": it used to have 5 accepting states, it now has only one.
    (Changing removing acceptance of those 4 states has no effect on
787
    the language, but it speeds up some algorithms like NDFS-based
788
789
    emptiness checks, as discussed in our Spin'15 paper.)

790
791
792
  * The HOA parser will diagnose any version that is not v1, unless it
    looks like a subversion of v1 and no parse error was detected.

793
  * The way to pass option to the automaton parser has been changed to
794
    make it easier to introduce new options.  One such new option is
795
796
    "trust_hoa": when true (the default) supported properties declared
    in HOA files are trusted even if they cannot be easily be verified.
797
798
799
800
801
    Another option "raise_errors" now replaces the method
      automaton_stream_parser::parse_strict().

  * The output of the automaton parser now include the list of parse
    errors (that does not have to be passed as a parameters) and the
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
802
    input filename (making the output of error messages easier).
803

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
804
  * The following renamings make the code more consistent:
805
806
807
    ltl_simplifier -> tl_simplifier
    tgba_statistics::transitions -> twa_statistics::edges
    tgba_sub_statistics::sub_transitions -> twa_sub_statistics::transitions
808
    tgba_run -> twa_run
809
    reduce_run -> twa_run::reduce
810
811
812
813
    replay_tgba_run -> twa_run::replay
    print_tgba_run -> operator<<
    tgba_run_to_tgba -> twa_run::as_twa
    format_parse_aut_errors -> parsed_aut::format_errors
814
815
816
817
818
819
    twa_succ_iterator::current_state -> twa_succ_iterator::dst
    twa_succ_iterator::current_condition -> twa_succ_iterator::cond
    twa_succ_iterator::current_acceptance_conditions -> twa_succ_iterator::acc
    ta_succ_iterator::current_state -> ta_succ_iterator::dst
    ta_succ_iterator::current_condition -> ta_succ_iterator::cond
    ta_succ_iterator::current_acceptance_conditions -> ta_succ_iterator::acc
820

821
822
  Python:

823
  * The minimum supported Python version is now 3.3.
824
  * Add bindings for complete() and dtwa_complement()
825
826
  * Formulas now have a custom __format__ function.  See
    https://spot.lrde.epita.fr/tut01.html for examples.
827
828
  * The Debian package is now compiled for all Python3 versions
    supported by Debian, not just the default one.
829
  * Automata now have get_name()/set_name() methods.
830
831
832
  * spot.postprocess(aut, *options), or aut.postprocess(*options)
    simplify the use of the spot.postprocessor object.  (Just like we
    have spot.translate() on top of spot.translator().)
833
834
835
836
837
838
839
840
  * spot.automata() and spot.automaton() now have additional
    optional arguments:
    - timeout: to restrict the runtime of commands that
      produce automata
    - trust_hoa: can be set to False to ignore HOA properties
      that cannot be easily verified
    - ignore_abort: can be set to False if you do not want to
      skip automata ended with --ABORT--.
841

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
842
843
844
845
846
847
  Documentation:

  * There is a new page showing how to use spot::postprocessor
    to convert any type of automaton to Büchi.
    https://spot.lrde.epita.fr/tut30.html

848
849
  Bugs fixed:

850
  * Work around some weird exception raised when using the
851
852
853
854
855
    randltlgenerator under Python 3.5.
  * Recognize "nullptr" formulas as None in Python.
  * Fix compilation of bench/stutter/
  * Handle saturation of formula reference counts.
  * Fix typo in the Python code for the CGI server.
856
  * "randaut -Q0 1" used to segfault.
857
858
  * "ltlgrind -F FILENAME/COL" did not preserve other CSV columns.
  * "ltlgrind --help" did not document FORMAT.
859
  * unabbreviate could easily use forbidden operators.
860
861
  * "autfilt --is-unambiguous" could fail to detect the nonambiguity
    of some automata with empty languages.
862
863
864
  * When parsing long tokens (e.g, state labels representing
    very large strings) the automaton parser could die with
    "input buffer overflow, can't enlarge buffer because scanner uses REJECT"
865

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
866
New in spot 1.99.4 (2015-10-01)
867

868
869
  New features:

870
871
872
873
  * autfilt's --sat-minimize now takes a "colored" option to constrain
    all transitions (or states) in the output automaton to belong to
    exactly one acceptance sets.  This is useful when targeting parity
    acceptance.
874

875
876
877
878
879
880
881
882
883
884
  * autfilt has a new --product-or option.  This builds a synchronized
    product of two (completed of needed) automata in order to
    recognize the *sum* of their languages.  This works by just using
    the disjunction of their acceptance conditions (with appropriate
    renumbering of the acceptance sets).

    For consistency, the --product option (that builds a synchronized
    product that recognizes the *intersection* of the languages) now
    also has a --product-and alias.

885
886
887
888
889
890
891
892
893
894
  * the parser for ltl2dstar's format has been merged with the parser
    for the other automata formats.  This implies two things:
    - autfilt and dstar2tgba (despite its name) can now both read
      automata written in any of the four supported syntaxes
      (ltl2dstar's, lbtt's, HOA, never claim).
    - "dstar2tgba some files..." now behaves exactly like
      "autfilt --tgba --high --small some files...".
      (But dstar2tgba does not offer all the filtering and
      transformations options of autfilt.)

895
896
  Major code changes and reorganization:

897
898
899
  * The class hierarchy for temporal formulas has been entirely
    rewritten.  This change is actually quite massive (~13200 lines
    removed, ~8200 lines added), and brings some nice benefits:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
900
    - LTL/PSL formulas are now represented by lightweight formula
901
902
903
904
      objects (instead of pointers to children of an abstract
      formula class) that perform reference counting automatically.
    - There is no hierachy anymore: all operators are represented by
      a single type of node in the syntax tree, and an enumerator is
905
      used to distinguish between operators.
906
907
908
909
910
911
912
913
    - Visitors have been replaced by member functions such as map()
      or traverse(), that take a function (usually written as a
      lambda function) and apply it to the nodes of the tree.
    - As a consequence, writing algorithms that manipulate formula
      is more friendly, and several algorithms that spanned a few
      pages have been reduced to a few lines.
    The page https://spot.lrde.epita.fr/tut03.html illustrates the
    new interface, in both C++ and Python.
914

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
915
916
917
918
919
  * Directories ltlast/, ltlenv/, and ltlvisit/, have been merged into
    a single tl/ directory (for temporal logic).  This is motivated by
    the fact that these formulas are not restricted to LTL, and by the
    fact that we no longuer use the "visitor" pattern.

920
921
922
  * The LTL/PSL parser is now declared in tl/parse.hh (instead of
    ltlparse/public.hh).

923
924
925
926
927
928
929
930
931
932
933
  * The spot::ltl namespace has been merged with the spot namespace.

  * The dupexp_dfs() function has been renamed to copy(), and has
    learned to preserve named states if required.

  * Atomic propositions can be declared without going through an
    environment using the spot::formula::ap() static function.  They
    can be registered for an automaton directly using the
    spot::twa::register_ap() method.  The vector of atomic
    propositions used by an automaton can now be retrieved using the
    spot::twa::ap() method.
934

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
935
New in spot 1.99.3 (2015-08-26)
936

937
938
939
  * The CGI script for LTL translation offers a HOA download link
    for each generated automaton.

940
  * The html documentation now includes a HTML copies of the man
941
    pages, and HTML copies of the Python notebooks.
942

943
944
945
946
  * scc_filter(aut, true) does not remove Fin marks from rejecting
    SCCs, but it now does remove Fin marks from transitions between
    SCCs.

947
948
949
  * All the unabbreviation functions (unabbreviate_ltl(),
    unabbreviate_logic(), unabbreviate_wm()) have been merged into a
    single unabbreviate() function that takes a string representing
950
951
952
    the list of operators to remove among "eFGiMRW^" where 'e', 'i',
    and '^' stand respectively for <->, ->, and xor.
    This feature is also available via ltlfilt --unabbreviate.
953

954
955
956
957
  * In LTL formulas, atomic propositions specified using double-quotes
    can now include \" and \\.  (This is more consistent with the HOA
    format, which already allows that.)

958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
  * All the conversion routines that were written specifically for
    ltl2dstar's output format (DRA->BA & DRA->TGBA) have been ported
    to the new TωA structure supporting the HOA format.  The DRA->TGBA
    conversion was reimplemented in the previous release, and the
    DRA->BA conversion has been reimplemented in this release (but it
    is still restricted to state-based acceptance).  All these
    conversions are called automatically by to_generalized_buchi()
    or remove_fin() so there should be no need to call them directly.

    As a consequence:
    - "autfilt --remove-fin" or "autfilt -B" is better at converting
      state-based Rabin automata: it will produce a DBA if the input is
      deterministic and DBA-realizable, but will preserve as much
      determinism as possible otherwise.
    - a lot of obsolete code that was here only to support the old
      conversion routines has been removed.  (The number of lines
      removed by this release is twice the number of lines added.)
    - ltlcross now uses automata in ltl2dstar's format directly,
      without converting them to Büchi (this makes the statistics
      reported in CSV files more relevant).
    - ltlcross no longer outputs additional columns about the size
      of the input automaton in the case ltl2dstar's format is used.
    - ltldo uses results in ltl2dstar's format directly, without
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
981
      converting them to Büchi.
982
983
    - dstar2tgba has been greatly simplified and now uses the
      same output routines as all the other tools that output
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
984
      automata.  This implies a few minor semantic changes, for
985
      instance --stats=%A used to output the number of acceptance
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
986
      *pairs* in the input automaton, while it now outputs the
987
988
      number of acceptance sets like in all the other tools.

989
990
  * Bugs fixed
    - Some acceptance conditions like Fin(0)|Fin(1)|Fin(2)&Inf(3)
991
      were not detected as generalized-Rabin.
992
993
    - Unknown arguments for print_hoa() (i.e., option -H in command-line
      tools) are now diagnosed.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
994
    - The CGI script for LTL translation now forces transition-based
995
996
997
998
      acceptance on WDBA-minimized automata when TGBA is requested.
    - ltlgrind --help output had some options documented twice, or
      in the wrong place.
    - The man page for ltlcross had obsolete examples.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
999
1000
    - When outputting atomic propositions in double quotes, the
      escaping routine used by the two styles of LaTeX output was
For faster browsing, not all history is shown. View entire blame