NEWS 62.6 KB
Newer Older
1
2
New in spot 1.2.2a (not yet released)

3
4
5
  * Bug fixes:

    - More fixes for Python 3 compatibility.
6
7
8
    - Fix calculation of length_boolone(), were 'Xa|b|c' was
      considered as length 6 instead of 4 (because it is 'Xa|(b|a)'
      were (b|a) is Boolean).
9

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
10
New in spot 1.2.2 (2014-01-24)
11

12
13
14
15
16
17
18
19
  * Bug fixes:

    - Fix compilation *and* behavior of bitvectors on 32-bit
      architectures.
    - Fix some compilation errors observed using the antique G++ 4.0.1.
    - Fix compatibility with Python 3 in the test suite.
    - Fix a couple of new clang warnings (like "unused private member").
    - Add some missing #includes that are not included indirectly
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
20
      when the C++ compiler is in C++11 mode.
21
22
23
24
    - Fix detection of numbers that are too large in the ELTL parser.
    - Fix a memory leak in the ELTL parser, and avoid some unnecessary
      calls to strlen() at the same time.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
25
New in spot 1.2.1 (2013-12-11)
26

27
  * New features:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
28

29
30
31
32
33
34
    - commands for translators specified to ltlcross can now
      be given "short names" to be used in the CSV or JSON output.
      For instance
         ltlcross '{small} ltl2tgba -s --small %f >%N' ...
      will run the command "ltl2tgba -s --small %f >%N", but only
      print "small" in output files.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
35

36
37
38
39
40
41
42
    - ltlcross' CSV and JSON output now contains two additional
      columns: exit_status and exit_code, used to report failures of
      the translator.  If the translation failed, only the time is
      reported, and the rest of the statistics, which are missing,
      area left empty (in CVS) or null (in JSON).  A new option,
      --omit-missing can be used to remove lines for failed
      translations, and remove these two columns.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
43

44
45
46
    - if ltlcross is used with --products=+5 instead of --products=5
      then the stastics for each of the five products will be output
      separately instead of being averaged.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
47

48
49
50
51
52
    - if ltlcross is used with tools that produce deterministic Streett
      or Rabin automata (as specified with %D), then the statistics
      output in CSV or JSON will have some extra columns to report
      the size of these input automata before ltlcross converts them
      into TGBA to perform its regular checks.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
53

54
55
56
57
    - ltlfilt, ltl2tgba, ltl2tgta, and ltlcross can now read formulas
      from CSV files.  Use option -F FILE/COL to read formulas from
      column COL of FILE.  Use -F FILE/-COL if the first line of
      FILE be ignored.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
58

59
60
61
62
63
    - when ltlfilt processes formulas from a CSV file, it will output
      each CSV line whose formula matches the given constraints, with
      the rewriten formula.  The new escape sequence %< (text in
      columns before the formula) and %> (text after) can be used
      with the --format option to alter this output.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
64

65
66
    - ltlfile, genltl, randltl, and ltl2tgba have a --csv-escape option
      to help escape formulas in CSV files.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
67

68
69
70
    - Please check
            http://spot.lip6.fr/userdoc/csv.html
      for some discussion and examples of the last few features.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
71

72
  * Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
73

74
75
76
77
78
79
    - ltlcross' CSV output has been changed to be more RFC 4180
      compliant: it no longuer output useless cosmetic spaces, and
      use double-quotes with proper escaping for strings.  The only
      RFC 4180 rule that it does not follow is that it will terminate
      lines with \n instead of \r\n because the latter cause issues
      with a couple of tools.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
80

81
82
    - ltlcross failed to report missing input or output escape sequences
      on all but the first configured translator.
83

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
84
New in spot 1.2 (2013-10-01)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
85

86
87
88
89
90
91
92
93
  * Changes to command-line tools:

    - ltlcross has a new option --color to color its output.  It is
      enabled by default when the output is a terminal.

    - ltlcross will give an example of infinite word accepted by the
      two automata when the product between a positive automaton and a
      negative automaton is non-empty.
94

95
96
    - ltlcross can now read the Rabin and Streett automata output by
      ltl2dstar.  This type of output should be specified using '%D':
97

98
        ltlcross 'ltl2dstar --ltl2nba=spin:path/to/ltl2tgba@-s %L %D'
99

100
      However because Spot only supports Büchi acceptance, these Rabin
101
      and Streett automata are immediately converted to TGBAs before
102
103
      further processing by ltlcross.  This is still interesting to
      search for bugs in translators to Rabin or Streett automata, but
104
      the statistics (of the resulting TGBAs) might not be very relevant.
105

106
107
108
109
110
111
    - When ltlcross obtains a deterministic automaton from a
      translator it will now complement this automaton to perform
      additional intersection checks.  This is complementation is done
      only for deterministic automata (because that is cheap) and can
      be disabled with --no-complement.

112
113
114
115
    - To help with debugging problems detected by ltlcross, the
      environment variables SPOT_TMPDIR and SPOT_TMPKEEP control where
      temporary files are created and if they should be erased.  Read
      the man page of ltlcross for details.
116

117
    - There is a new command, named dstar2tgba, that converts a
118
119
120
121
122
123
124
125
126
127
128
129
      deterministic Rabin or Streett automaton (expressed in the
      output format of ltl2dstar) into a TGBA, BA or Monitor.

      In the case of Rabin acceptance, the conversion will output a
      deterministic Büchi automaton if one such automaton exist.  Even
      if no such automaton exists, the conversion will actually
      preserves the determinism of any SCC that can be kept
      deterministic.

      In the case of Streett acceptance, the conversion produces
      non-deterministic Büchi automata with Generalized acceptance.
      These are then degeneralized if requested.
130

131
132
133
      See http://spot.lip6.fr/userdoc/dstar2tgba.html for some
      examples, and the man page for more reference.

134
135
136
137
138
    - The %S escape sequence used by ltl2tgba --stats to display the
      number of SCCs in the output automaton has been renamed to %c.
      This makes it more homogeneous with the --stats option of the
      new dstar2tgba command.

139
      Additionally, the %p escape can now be used to show whether the
140
141
142
      output automaton is complete, and the %r escape will give the
      number of seconds spent building the output automaton (excluding
      the time spent parsing the input).
143

144
145
146
147
148
    - ltl2tgba, ltl2tgta, and dstar2tgba have a --complete option
      to output complete automata.

    - ltl2tgba, ltl2tgta, and dstar2tgba can use a SAT-solver to
      minimize deterministic automata.  Doing so is only needed on
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
149
150
      properties that are stronger than obligations (for obligations
      our WDBA-minimization procedure will return a minimimal
151
152
153
      deterministic automaton more efficiently) and is disabled by
      default.  See the spot-x(7) man page for documentation about the
      related options: sat-minimize, sat-states, sat-acc, state-based.
154
155
      See also http://spot.lip6.fr/userdoc/satmin.html for some
      examples.
156

157
158
159
160
    - ltlfilt, genltl, and randltl now have a --latex option to output
      formulas in a way that its easier to embed in a LaTeX document.
      Each operator is output as a command such as \U, \F, etc.
      doc/tl/spotltl.sty gives one possible definition for each macro.
161

162
163
164
165
    - ltlfilt, genltl, and randltl have a new --format option to
      indicate how to present the output formula, possibly with
      information about the input.

166
167
168
169
170
    - ltlfilt as a new option, --relabel-bool, to abstract independent
      Boolean subformulae as if they were atomic propositions.
      For instance "a & GF(c | d) & b & X(c | d)" would be rewritten
      as "p0 & GF(p1) & Xp1".

171
  * New functions and classes in the library:
172

173
174
    - dtba_sat_synthetize(): Use a SAT-solver to build an equivalent
      deterministic TBA with a fixed number of states.
175

176
177
    - dtba_sat_minimize(), dtba_sat_minimize_dichotomy(): Iterate
      dtba_sat_synthetize() to reduce the number of states of a TBA.
178

179
180
    - dtgba_sat_synthetize(), dtgba_sat_minimize(),
      dtgba_sat_minimize_dichotomy(): Likewise, for deterministic TGBA.
181

182
    - is_complete(): Check whether a TGBA is complete.
183

184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
    - tgba_complete(): Complete an automaton by adding a sink state
      if needed.

    - dtgba_complement(): Complement a deterministic TGBA.

    - satsolver(): Run an (external) SAT solver, honoring the
      SPOT_SATSOLVER environment variable if set.

    - tba_determinize(): Run a power-set construction, and attempt
      to fix the acceptance simulation to build a deterministic TBA.

    - dstar_parse(): Read a Streett or Rabin automaton in
      ltl2dstar's format.  Note that this format allows only
      deterministic automata.

    - nra_to_nba(): Convert a (possibly non-deterministic) Rabin
      automaton to a non-deterministic Büchi automaton.

    - dra_to_ba(): Convert a deterministic Rabin automaton to a Büchi
      automaton, preserving acceptance in all SCCs where this is possible.

    - nsa_to_tgba(): Convert a (possibly non-deterministic) Streett
      automaton to a non-deterministic TGBA.

    - dstar_to_tgba(): Convert any automaton returned by dstar_parse()
      into a TGBA.

    - build_tgba_mask_keep(): Build a masked TGBA that shows only
      a subset of states of another TGBA.

    - build_tgba_mask_ignore(): Build a masked TGBA that ignore
      a subset of states of another TGBA.

    - class tgba_proxy: Helps writing on-the-fly algorithms that
      delegate most of their methods to the original automaton.

    - class bitvect: A dynamic bit vector implementation.

    - class word: An infinite word, stored as prefix + cycle, with a
      simplify() methods to simplify cycle and prefix in obvious ways.

    - class temporary_file: A temporary file.  Can be instanciated with
      create_tmp_file() or create_open_tmpfile().

    - count_state(): Return the number of states of a TGBA.  Implement
      a couple of specializations for classes where is can be know
      without exploration.

232
233
    - to_latex_string(): Output a formula using LaTeX syntax.

234
235
236
    - relabel_bse(): Relabeling of Boolean Sub-Expressions.
      Implements ltlfilt's --relabel-bool option describe above.

237
238
239
240
241
  * Noteworthy internal changes:

    - When minimize_obligation() is not given the formula associated
      to the input automaton, but that automaton is deterministic, it
      can still attempt to call minimize_wdba() and check the correcteness
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
242
243
      using dtgba_complement().  This allows dstar2tgba to apply
      WDBA-minimization on deterministic Rabin automata.
244
245
246

    - tgba_reachable_iterator_depth_first has been redesigned to
      effectively perform a DFS.  As a consequence, it does not
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
247
      inherit from tgba_reachable_iterator anymore.
248

249
250
251
252
    - postproc::set_pref() was used to accept an argument among Any,
      Small or Deterministic.  These can now be combined with Complete
      as Any|Complete, Small|Complete, or Deterministic|Complete.

253
254
255
256
257
    - operands of n-ary operators (like & and |) are now ordered so
      that Boolean terms come first.  This speeds up syntactic
      implication checks slightly.  Also, literals are now sorted
      using strverscmp(), so that p5 comes before p12.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
258
259
260
261
    - Syntactic implication checks have been generalized slightly
      (for instance 'a & b & F(a & b)' is now reduced to 'a & b'
      while it was not changed in previous versions).

262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
    - All the parsers implemented in Spot now use the same type to
      store locations.

    - Cleanup of exported symbols

      All symbols in the library now have hidden visibility on ELF systems.
      Public classes and functions have been marked explicitely for export
      with the SPOT_API macro.

      During this massive update, some of functions that should not have
      been made public in the first place have been moved away so that
      they can only be used from the library.  Some old of unused
      functions have been removed.

      removed:
	- class loopless_modular_mixed_radix_gray_code

      hidden:
	- class acc_compl
	- class acceptance_convertor
	- class bdd_allocator
	- class free_list

  * Bug fixes:

    - Degeneralization was not indempotant on automata with an
      accepting initial state that was on a cycle, but without
      self-loop.

    - Configuring with --enable-optimization would reset the value of
      CXXFLAGS.
293

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
294

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
295
New in spot 1.1.4 (2013-07-29)
296

297
298
299
300
301
  * Bug fixes:
    - The parser for neverclaim, updated in 1.1.3, would fail to
      parse guards of the form (a) || (b) output by ltl2ba or
      ltl3ba, and would only understand ((a) || (b)).
    - When used from ltlcross, the same parser would fail to
302
303
      parse further neverclaims after the first failure.
    - Add a missing newline in some error message of ltlcross.
304
305
306
307
308
309
310
    - Expressions like {SERE} were wrongly translated and simplified
      for SEREs that accept the empty word: they were wrongly reduced
      to true.  Simplification and translation rules have been fixed,
      and the doc/tl/tl.pdf specifications have been updated to better
      explain that {SERE} has the semantics of a closure operator that
      is not exactly what one could expect after reading the PSL
      standard.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
311
    - Various typos.
312

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
313
New in spot 1.1.3 (2013-07-09)
314

315
316
317
318
319
320
321
322
  * New feature:
    - The neverclaim parser now understands the new style of output
      used by Spin 6.24 and later.
  * Bug fixes:
    - The scc_filter() function could abort with a BDD error.  If all
      the acceptance sets of an SCC but the first one were useless.
    - The script in bench/spin13/ would not work on MacOS X because
      of some non-portable command.
323
    - A memory corruption in ltlcross.
324

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
325
New in spot 1.1.2 (2013-06-09)
326

327
328
329
330
331
  * Bug fixes:
    - Uninitialized variables in ltlcross (affect the count of terminal
      weak, and strong SCCs).
    - Workaround an old GCC bug to allow compilation with g++ <= 4.5
    - Fix several Doxygen comments so that they display correctly.
332

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
333
New in spot 1.1.1 (2013-05-13):
334

335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
  * New features:

    - lbtt_reachable(), the function that outputs a TGBA in LBTT's
      format, has a new option to indicate that the TGBA being printed
      is in fact a Büchi automaton.  In this case it outputs an LBTT
      automaton with state-based acceptance.

      The output of the guards has also been changed in two ways:
      1. atomic propositions that do not match p[0-9]+ are always
         double-quoted.  This avoids issues where t or f were used as
         atomic propositions in the formula, output as-is in the
         automaton, and read back as true or false.  Other names that
         correspond to LBT operators would cause problem as well.
      2. formulas that label transitions are now output as
         irredundant-sums-of-products.

    - 'ltl2tgba --ba --lbtt' will now output automata with state-based
      acceptance.  You can use 'ltl2tgba --ba --lbtt=t' to force the
      output of transition-based acceptance like in the previous
      versions.

      Some illustrations of this point and the previous one can be
      found in the man page for ltl2tgba(1).

359
360
361
362
363
364
    - There is a new function scc_filter_states() that removes all
      useless states from a TGBA.  It is actually an abbridged version
      of scc_filter() that does not alter the acceptance conditions of
      the automaton.  scc_filter_state() should be used when
      post-processing TGBAs that actually represent BAs.

365
366
367
368
369
370
371
372
373
    - simulation_sba(), cosimulation_sba(), and
      iterated_simulations_sba() are new functions that apply to TGBAs
      that actually represent BAs.  They preserve the imporant
      property that if a state of the BA is is accepting, the outgoing
      transitions of that state are all accepting in the TGBA that
      represent the BA.  This is something that was not preserved by
      functions cosimultion() and iterated_simulations() as mentionned
      in the bug fixes below.

374
375
376
    - ltlcross has a new option --seed, that makes it possible to
      change the seed used by the random graph generator.

377
378
379
380
381
382
383
384
    - ltlcross has a new option --products=N to check the result of
      each translation against N different state spaces, and everage
      the statistics of these N products.  N default to 1; larger
      values increase the chances to detect inconsistencies in the
      translations, and also make the average size of the product
      built against the translated automata a more pertinent
      statistic.

385
386
387
388
    - bdd_dict::unregister_all_typed_variables() is a new function,
      making it easy to unregister all BDD variables of a given type
      owned by some object.

389
  * Bug fixes:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
390
391

    - genltl --gh-r generated the wrong formulas due to a typo.
392
393
    - ltlfilt --eventual and --universal were not handled properly.
    - ltlfilt --stutter-invariant would trigger an assert on PSL formulas.
394
395
    - ltl2tgba, ltl2tgta, ltlcross, and ltlfilt, would all choke on empty
      lines in a file of formulas.  They now ignore empty lines.
396
397
398
399
400
401
402
403
    - The iterated simulation applied on degeneralized TGBA was bogus
      for two reasons: one was that cosimulation was applied using the
      generic cosimulation for TGBA, and the second is that
      SCC-filtering, performed between iterations, was also a
      TGBA-based algorithm.  Both of these algorithms could lose the
      property that if a TGBA represents a BA, all the outgoing
      transitions of a state should be accepting.  As a consequence, some
      formulas where translated to incorrect Büchi automata.
404

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
405
New in spot 1.1 (2013-04-28):
406

407
408
409
410
411
412
413
  Several of the new features described below are discribed in

    Tomáš Babiak, Thomas Badie, Alexandre Duret-Lutz, Mojmír
    Křetínský, Jan Strejček: Compositional Approach to Suspension and
    Other Improvements to LTL Translation.  To appear in the
    proceedings of SPIN'13.

414
  * New features in the library:
415

416
417
418
    - The postprocessor class now takes an optional option_map
      argument that can be used to specify fine-tuning options, making
      it easier to benchmark different scenarios while developing new
419
420
      postprocessings.

421
422
423
424
425
426
    - A new translator class implements a complete translation chain,
      from LTL/PSL to TGBA/BA/Monitor.  It performs pre- and
      post-processings in addition to the core translation, and offers
      an interface similar to that used in the postprocessor class, to
      specify the intent of the translation.

427
428
429
430
    - The degeneralization algorithm has learned three new tricks:
      level reset, level caching, and SCC-based ordering.  The former
      two are enabled by default.  Benchmarking has shown that the
      latter one does not always have a positive effect, so it is
431
      disabled by default.  (See SPIN'13 paper.)
432
433
434
435

    - The scc_filter() function, which removes dead SCCs and also
      simplify acceptance conditions, has learnt how to simplify
      acceptance conditions in a few tricky situations that were not
436
      simplified previously.  (See SPIN'13 paper.)
437

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
438
439
440
441
442
443
444
445
446
    - A new translation, called compsusp(), for "Compositional
      Suspension" is implemented on top of ltl_to_tgba_fm().
      (See SPIN'13 paper.)

    - Some experimental LTL rewriting rules that trie to gather
      suspendable formulas are implemented and can be activated
      with the favor_event_univ option of ltl_simplifier.  As
      always please check doc/tl/tl.tex for the list of rules.

447
448
449
450
451
    - An experimental "don't care" (direct) simulation has been
      implemented.  This simulations consider the acceptance
      of out-of-SCC transitions as "don't care".  It is not
      enabled by default because it currently is very slow.

452
453
454
455
456
457
458
459
460
461
462
    - remove_x() is a function that take a formula, and rewrite it
      without the X operator.  The rewriting is only correct for
      stutter-insensitive LTL formulas (See K. Etessami's paper in IFP
      vol. 75(6). 2000) This algorithm is accessible from the
      command-line using ltlfilt's --remove-x option.

    - is_stutter_insensitive() takes any LTL formula, and check
      whether it is stutter-insensitive.  This algorithm is accessible
      from the command-line using ltlfilt's --stutter-insensitive
      option.

463
464
465
466
467
468
469
470
471
472
473
474
475
    - Several functions have been introduced to check the
      strength of an SCC.
        is_inherently_weak_scc()
	is_weak_scc()
	is_syntactic_weak_scc()
	is_complete_scc()
	is_terminal_scc()
	is_syntactic_terminal_scc()

      Beware that the costly is_weak_scc() function introduced in Spot
      1.0, which is based on a cycle enumeration, has been renammed to
      is_inherently_weak_scc() to match established vocabulary.

476
  * Command-line tools:
477
478

    - ltl2tgba and ltl2tgta now honor a new --extra-options (or -x)
479
480
481
      flag to fine-tune the algorithms used.  The available options
      are documented in the spot-x (7) manpage.  For instance use '-x
      comp-susp' to use the afore-mentioned compositional suspension.
482

483
484
485
486
487
488
    - The output format of 'ltlcross --json' has been changed slightly.
      In a future version we will offer some reporting script that turn
      such JSON output into various tables and graphs, and these change
      are required to make the format usable for other benchmarks (not
      just ltlcross).

489
490
491
492
    - ltlcross will now count the number of non-accepting, terminal,
      weak, and strong SCCs, as well as the number of terminal, weak,
      and strong automata produced by each tool.

493
  * Documentation:
494
495
496
497
498
499

    - org-mode files used to generate the documentation about
      command-line tools (shown at http://spot.lip6.fr/userdoc/tools.html)
      is distributed in doc/org/.  The resulting html files are also
      in doc/userdoc/.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
500
501
502
503
504
505
506
507
508
509
  * Web interface:

    - A new "Compositional Suspension" tab has been added to experiment
      with compositional suspension.

  * Benchmarks:

    - See bench/spin13/README for instructions to reproduce our Spin'13
      benchmark for the compositional suspension.

510
511
  * Bug fixes:

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
512
513
    - There was a memory leak in the LTL simplification code, that could
      only be triggered when disabling advanced simplifications.
514

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
515
516
    - The translation of the PSL formula !{xxx} was incorrect when xxx
      simplified to false.
517

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
518
    - Various warnings triggered by new compilers.
519

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
520
New in spot 1.0.2 (2013-03-06):
521

522
523
524
525
  * New features:
    - the on-line ltl2tgba.html interface can output deterministic or
      non-deterministic monitors.  However, and unlike the ltl2tgba
      command-line tool, it doesn't different output formats.
526
527
528
529
530
531
532
533
534
535
    - the class ltl::ltl_simplifier now has an option to rewrite Boolean
      subformulaes as irredundante-sum-of-product during the simplification
      of any LTL/PSL formula.  The service is also available as a method
      ltl_simplifier::boolean_to_isop() that applies this rewriting
      to a Boolean formula and implements a cache.
      ltlfilt as a new option --boolean-to-isop to try to apply the
      above rewriting from the command-line:
      	    % ltlfilt --boolean-to-isop -f 'GF((a->b)&(b->c))'
	    GF((!a & !b) | (b & c))
      This is currently not used anywhere else in the library.
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
  * Bug fixes:
    - 'ltl2tgba --high' is documented to be the same as 'ltl2tgba',
      but by default ltl2tgba forgot to enable LTL simplifications based
      on language containment, which --high do enable.  There are now
      enabled by default.
    - the on-line ltl2tgba.html interface failed to output monitors,
      testing automata, and generalized testing automata due to two
      issues with the Python bindings.  It also used to display
      Testing Automaton Options when the desired output was set to Monitor.
    - bench/ltl2tgba would not work in a VPATH build.
    - a typo caused some .dir-locals.el configuration parameters to be
      silently ignored by emacs
    - improved Doxygen comments for formula_to_bdd, bdd_to_formula,
      and bdd_dict.
    - src/tgbatest/ltl2tgba (not to be confused with src/bin/ltl2tgba)
      would have a memory leak when passed the conflicting option -M
      and -O.  It probably has many other problems.  Do not use
      src/tgbatest/ltl2tgba if you are not writing a test case for
      Spot.  Use src/bin/ltl2tgba instead.
555

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
556
New in spot 1.0.1 (2013-01-23):
557

558
559
560
561
562
563
564
565
566
  * Bug fixes:
    - Two executions of the simulation reductions could produce
      two isomorphic automata, but with transitions in a different
      order.
    - ltlcross did not diagnose write errors to temporary files,
      and certain versions of g++ would warn about it.
    - "P0.init" is parsed as an atomic even without the double quotes,
      but it was always output with double quotes.  This version will
      not quote this atomic proposition anymore.
567
568
569
570
    - "U", "W", "M", "R" were correctly parsed as atomic propositions
      (instead of binary operators) when placed in double quotes, but
      on output they were output without quotes, making the result
      unparsable.
571
572
    - the to_lbt_string() functions would always output a trailing space.
      This is not the case anymore.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
573
574
    - tgba_product::transition_annotation() would segfault when
      called in a product against a Kripke structure.
575
576
577
578
579
580
  * Minor improvements:
    - Four new LTL simplifications rules:
        GF(a|Xb) = GF(a|b)
        GF(a|Fb) = GF(a|b)
        FG(a&Xb) = FG(a&b)
        FG(a&Gb) = FG(a&b)
581
582
    - The on-line version of ltl2tgba now displays edge and
      transition counts, just as the ltlcross tool.
583
584
    - ltlcross will display the number of timeouts at the end
      of its execution.
585
586
    - ltlcross will diagnose tools with missing input or
      output %-sequence before attempting to run any of them.
587
588
589
590
    - The parser for LBT's prefix-style LTL formulas will now
      read atomic propositions that are not of the form p1, p2...
      This makes it possible to process formulas written in
      ltl2dstar's syntax.
591
592
593
594
595
596
597
598
599
600
601
602
603
  * Pruning:
    - lbtt has been removed from the distribution.  A copy of the last
      version we distributed is still available at
        http://spot.lip6.fr/dl/lbtt-1.2.1a.tar.gz
      and our test suite will use it if it is installed, but the same
      tests are already performed by ltlcross.
    - the bench/ltl2tgba/ benchmark, that used lbtt to compare various
      LTL-to-Büchi translators, has been updated to use ltlcross.  It
      now output summary tables in LaTeX.  Support for Modella (no
      longer available online), and Wring (requires a too old Perl
      version) have been dropped.
    - the half-baked and underdocumented "Event TGBA" support in
      src/evtgba*/ has been removed, as it was last worked on in 2004.
604

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
605
New in spot 1.0 (2012-10-27):
606

607
608
609
610
  * License change: Spot is now distributed using GPL v3+ instead
    of GPL v2+.  This is because we started using some third-party
    files distributed under GPL v3+.

611
612
613
614
  * Command-line tools

    Useful command-line tools are now installed in addition to the
    library.  Some of these tools were originally written for our test
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
615
    suite and had evolved organically into useful programs with crappy
616
617
618
    interfaces: they have now been rewritten with better argument
    parsing, saner defaults, and they come with man pages.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
619
    - genltl:   Generate LTL formulas from scalable patterns.
620
621
622
623
624
625
                This offers 20 patterns so far.

    - randltl:  Generate random LTL/PSL formulas.

    - ltlfilt:  Filter lists of formulas according to several criteria
                (e.g., match only safety formulas that are larger than
626
627
628
629
630
		some given size).  Besides being used as a "grep" tool
		for formulas, this can also be used to convert
		files of formulas between different syntaxes, apply
		some simplifications, check whether to formulas are
		equivalent, ...
631

632
    - ltl2tgba: Translate LTL/PSL formulas into Büchi automata (TGBA,
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
633
                BA, or Monitor).  A fundamental change to the
634
635
636
                interface is that you may now specify the goal of the
                translation: do you you favor deterministic or smaller
                automata?
637
638
639

    - ltl2tgta: Translate LTL/PSL formulas into Testing Automata.

640
    - ltlcross: Compare the output of translators from LTL/PSL to
641
642
643
644
                Büchi automata, to find bug or for benchmarking.  This
                is essentially a Spot-based reimplementation of LBTT
                that supports PSL in addition to LTL, and that can
                output more statistics.
645

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
646
647
648
649
650
    An introduction to these tools can be found on-line at
      http://spot.lip6.fr/userdoc/tools.html

    The former test versions of genltl and randltl have been removed
    from the source tree.  The old version of ltl2tgba with its
651
    gazillion options is still in src/tgbatest/ and is meant to be
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
652
653
654
    used for testing only.  Although ltlcross is meant to replace
    LBTT, we are still using both tools in this release; however this
    is likely to be the last release of Spot that redistributes LBTT.
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684

  * New features in the Spot library:

    - Support for various flavors of Testing Automata.

      The flavors are:
      + "classical" Testing Automata, as used for instance by
	Geldenhuys and Hansen (Spin'06), using Büchi and
	livelock acceptance conditions.
      + Generalized Testing Automata, extending the previous
	with multiple Büchi acceptance sets.
      + Transition-based Generalized Testing Automata moving Büchi
        acceptance to transitions, and getting rid of livelock
        acceptance conditions by expliciting stuttering self-loops.

      Supporting algorithms include anything required to run
      the automata-theoretic approach using testing automata:

      + dedicated synchronized product
      + dedicated emptiness-check for TA and GTA, as these
        may require two passes because of the two kinds of
	acceptance, while a TGTA can be checked for emptiness
	with the same one-pass algorithm as a TGBA.
      + conversion from a TGBA to any of the above kind, with
        options to reduce these automata with bisimulation,
	and to produce a BA/GBA that require a single pass
	(at the expense of determinism).
      + output in dot format for display

      A discussion of these automata, part of Ala Eddine BEN SALEM's
685
      PhD work, should appear in ToPNoC VI (LNCS 7400).  The web-based
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
686
      interface and the aforementioned ltl2tgta tool can be used
687
      to build testing automata.
688
689
690
691
692
693
694

    - TGBA can now be reduced by Reverse Simulation (in addition to
      the Direct Simulation introduced in 0.9).  A function called
      iterated_simulations() will alternate direct and reverse
      simulations in a loop as long as it diminishes the size of the
      automaton.

695
    - The enumerate_cycles class implements the Loizou-Thanisch
696
697
698
699
      algorithm to enumerate elementary cycles in a SCC.  As an
      example of use, is_weak_scc() will tell whether an SCC is
      inherently weak (all its cycles are accepting, or none of them
      are).
700
701
702
703
704
705

    - parse_lbt() will parse an LTL formula expressed in the prefix
      syntax used (at least) by LBT, LBTT and Scheck.
      to_lbt_string() can be used to print an LTL formula using this
      syntax.

706
707
708
    - to_wring_string() can be used to print an LTL formula into
      Wring's syntax.

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
709
    - The LTL/PSL parser now has a lenient mode that can be useful
710
711
712
713
714
715
716
      to interpret atomic proposition with language-specific constructs.
      In lenient mode, any (...) or {...} block that cannot be parsed
      as formula will be assumed to be an atomic proposition.
      For instance the input (a < b) U (process[2]@ok), normally
      flagged as a syntax error, is read as "a < b" U "process[2]@ok"
      in lenient mode.

717
718
719
    - minimize_obligation() has a new option to disable WDBA
      minimization it cases it would produce a deterministic automaton
      that is bigger than the original TGBA.  This can help
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
720
      choosing between less states or more determinism.
721
722
723
724
725
726

    - new functions is_deterministic() and count_nondet_states()
      (The count of nondeterministic states is now displayed on
      automata generated with the web interface.)

    - A new class, "postprocessor", makes it easier to apply
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
727
      all available simplification algorithms on a TGBA/BA/Monitors.
728
729
730
731
732
733
734
735

  * Minor changes:

    - The '*' operator can (again) be used as an AND in LTL formulas.
      This is for compatibility with formula written in Wring's
      syntax.  However inside SERE it is interpreted as the Kleen
      star.

736
737
738
739
740
741
742
    - When printing a formula using Spin's LTL syntax, we don't
      double-quote complex atomic propositions (that was not valid
      Spin input anyway).   For instance F"foo == 2" used to be
      output as <>"foo == 2".  We now output <>(foo == 2) instead.
      The latter syntax is understood by Spin 6.  It can be read
      back by Spot in lenient mode (see above).

743
744
745
    - The gspn-ssp benchmark has been removed.


Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
746
New in spot 0.9.2 (2012-07-02):
747

748
749
750
  * New features to the web interface.
    - It can run ltl3ba (Babiak et al., TACAS'12) where available.
    - "a loading logo" is displayed when result is not instantaneous.
751
752
753
754
755
  * Speed improvements:
    - The unicity hash table of BuDDy has been separated separated
      node table for better cache-friendliness.  The resulting speedup
      is around 5% on BDD-intensive algorithms.
    - A new BDD operation, called bdd_implies() has been added to
756
      BuDDy to check whether one BDD implies another.  This benefits
757
      mostly the simulation and degeneralization algorithms of Spot.
758
759
760
    - A new offline implementation of the degeneralization (which
      had always been performed on-the-fly so far) available.  This
      especially helps the Safra complementation.
761
762
763
  * Bug fixes:
    - The CGI script running for ltl2tgba.html will correctly timeout
      after 30s when Spot's translation takes more time.
764
765
766
767
768
769
    - Applying WDBA-minimization on an automaton generated by the
      Couvreur/LaCIM translator could lead to an incorrect automaton
      due to a bug in the definition of product with symbolic
      automata.
    - The Makefile.am of BuDDy, LBTT, and Spot have been adjusted to
      accomodate Automake 1.12 (while still working with 1.11).
770
    - Better error recovery when parsing broken LTL formulae.
771
772
    - Fix errors and warnings reported by clang 3.1 and the
      upcoming g++ 4.8.
773

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
774
New in spot 0.9.1 (2012-05-23):
775

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
776
  * The version of LBTT we distribute includes a patch from Tomáš
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
    Babiak to count the number of non-deterministic states, and the
    number of deterministic automata produced.
    See lbtt/NEWS for the list of other differences with the original
    version of LBTT 1.2.1.
  * The Couvreur/FM translator has learned two new tricks.  These only
    help to speedup the translation by not issuing states or
    acceptance conditions that would be latter suppresed by other
    optimizations.
    - The translation rules used to translate subformulae of the G
      operator have been adjusted not to produce useless loops
      already implied by G.  This generalizes the "GF" trick
      presented in Couvreur's original FM'99 paper.
    - Promises generated for formula of the form P(a U (b U c))
      are reduced into P(c), avoiding the introduction of many
      promises that imply each other.
792
793
  * The tgba_parse() function is now available via the Python
    bindings.
794
795
796
  * Bug fixes:
    - The random SERE generator was using the wrong operators
      for "and" and "or", mistaking And/Or with AndRat/OrRat.
797
798
    - The translation of !{r} was incorrect when this subformula
      was recurring (e.g. in G!{r}) and r had loops.
799
    - Correctly recognize ltl2tgba's option -rL.
800
801
802
803
804
805
806
    - Using LTL simplification rules based on syntactic implication,
      or based on language containment checks, caused BDD variables
      to be allocated in an "unnatural" order, resulting in a slower
      translation and a less optimal degeneralization.
    - When ltl2tgba reads a neverclaim, it now considers the resulting
      TGBA as a Büchi automaton, and will display double circles in
      the dotty output.
807

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
808
New in spot 0.9 (2012-05-09):
809

810
  * New features:
811
812
813
814
815
816
817
818
819
    - Operators from the linear fragment of PSL are supported.  This
      basically extends LTL with Sequential Extended Regulat
      Expressions (SERE), and a couple of operators to bridge SERE and
      LTL.  See doc/tl/tl.pdf for the list of operators and their
      semantics.
    - Formula rewritings have been completely revamped, and augmented
      with rules for PSL operators (and some new LTL rules as well).
      See doc/tl/tl.pdf for the list of the rewritings implemented.
    - Some of these rewritings that may produce larger formulas
820
      (for instance to rewrite "{a;b;c}" into "a & X(b & Xc)")
821
822
823
824
825
826
827
828
      may be explicitely disabled with a new option.
    - The src/ltltest/randltl tool can now generate random SEREs
      and random PSL formulae.
    - Only one translator (ltl2tgba_fm) has been augmented to
      translate the new SERE and PSL operators.  The internal
      translation from SERE to DFA is likely to be rewriten in a
      future version.
    - A new function, length_boolone(), computes the size of an
829
830
831
832
833
834
835
      LTL/PSL formula while considering that any Boolean term has
      length 1.
    - The LTL/PSL parser recognizes some UTF-8 characters (like ◇ or
      ∧) as operators, and some output routines now have an UTF-8
      output mode.  Tools like randltl and ltl2tgba have gained an -8
      option to enable such output.  See doc/tl/tl.pdf for the list
      of recognized codepoints.
836
    - A new direct simulation reduction has been implemented.  It
837
      works directly on TGBAs.  It is in src/tgbaalgos/simlation.hh,
838
      and it can be tested via ltl2tgba's -RDS option.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
839
    - unabbreviate_wm() is a function that rewrites the W and M operators
840
841
842
843
844
      of LTL formulae using R and U.  This is called whenever we output
      a formula in Spin syntax.  By combining this with the aforementioned
      PSL rewriting rules, many PSL formulae that use simple SERE can be
      converted into LTL formulae that can be feed to tools that only
      understand U and R.  The web interface will let you do this.
845
846
847
    - changes to the on-line translator:
      + SVG output is available
      + can display some properties of a formula
848
849
      + new options for direct simulation, larger rewritings, and
        utf-8 output
850
851
852
853
    - configure --without-included-lbtt will prevent LBTT from being
      configured and built.  This helps on systems (such as MinGW)
      where LBTT cannot be built.  The test-suite will skip any
      LBTT-based test if LBTT is missing.
854
  * Interface changes:
855
    - Operators ->, <->, U, W, R, and M are now parsed as
856
      right-associative to better match the PSL standard.
857
858
859
860
861
862
863
864
865
866
867
868
869
870
    - The constructors for temporal formulae will perform some trivial
      simplifications based on associativity, commutativity,
      idempotence, and neutral elements.  See doc/tl/tl.pdf for the
      list of such simplifications.
    - Formula instances now have many methods to inspect their
      properties (membership to syntactic classes, absence of X
      operator, etc...) in constant time.
    - LTL/PSL formulae are now handled everywhere as 'const formula*'
      and not just 'formula*'.  This reflects the true nature of these
      (immutable) formula objects, and cleanups a lot of code.
      Unfortunately, it is a backward incompatible change: you may have
      to add 'const' to a couple of lines in your code, and change
      'ltl::const_vistitor' into 'ltl::visitor' if you have written a
      custom visitor.
871
872
873
874
    - The new entry point for LTL/PSL simplifications is the function
      ltl_simplifier::simplify() declared in src/ltlvisit/simplify.hh.
      The ltl_simplifier class implements a cache.
      Functions such as reduce() or reduce_tau03() are deprecated.
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
    - The old game-theory-based implementations for direct and delayed
      simulation reductions have been removed.  The old direct
      simulation would only work on degeneralized automata, and yet
      produce results inferior to the new direct simulation introduced
      in this release.  The implementation of delayed simulation was
      unreliable.  The function reduc_tgba_sim() has been kept
      for compatibility (it calls the new direct simulation whatever
      the type of simulation requested) and marked as deprecated.
      ltl2tgba's options -Rd, -RD are gone.  Options -R1t, -R1s,
      -R2s, and -R2t are deprecated and all made equivalent to -RDS.
    - The tgba_explicit hierarchy has been reorganized in order to
      make room for sba_explicit classes that share most of the code.
      The main consequence is that the tgba_explicit type no longuer
      exists.  However the tgba_explicit_number,
      tgba_explicit_formula, and tgba_explicit_string still do.
890

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
891
New in spot 0.8.3 (2012-03-09):
892

893
894
  * Support for both Python 2.x and Python 3.x.
    (Previous versions would only work with Python 2.x.)
895
896
  * The online ltl2tgba.html now stores its state in the URL so that
    history is preserved, and links to particular setups can be sent.
897
898
899
900
  * Bug fixes:
    - Fix a segfault in the compression code used by the -Z
      option of dve2check.
    - Fix a race condition in the CGI script.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
901
    - Fix a segfault in the CGI script when computing a Büchi run.
902

903
New in spot 0.8.2 (2012-01-19):
904

905
906
  * configure now has a --disable-python option to disable
    the compilation of Python bindings.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
907
  * Minor speedups in the Safra complementation.
908
  * Better memory management for the on-the-fly degeneralization
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
909
    algorithm.  This mostly benefits to the Safra complementation.
910
911
912
  * Bug fixes:
    - spot::ltl::length() forgot to count the '&' and '|' operators
      in an LTL formula.
913
914
    - minimize_wdba() could fail to mark some transiant SCCs as accepting,
      producing an automaton that was not fully minimized.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
915
    - minimize_dfa() could produce incorrect automata, but it is not
916
917
918
      clear whether this could have had an inpact on WDBA minimization
      (the worse case is that some TGBA would not have been minimized
      when they could).
919
    - Fix a Python syntax error in the CGI script.
920
921
    - Fix compilation with g++ 4.0.
    - Fix a make check failure when valgrind is missing.
922

923
New in spot 0.8.1 (2011-12-18):
924

925
926
927
928
929
930
931
932
  * Only bug fixes:
    - When ltl2tgba is set to perform both WDBA minimization and
      degeneralization, do the latter only if the former failed.
      In previous version, automata were (uselessly) degeneralized
      before WDBA minimization, causing important slowdowns.
    - Fix compilation with Clang 3.0.
    - Fix a Makefile setup causing a "make check" failure on MacOS X.
    - Fix an mkdir error in the CGI script.
933

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
934
New in spot 0.8 (2011-11-28):
935

936
937
  * Major new features:
    - Spot can read DiVinE models.  See iface/dve2/README for details.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
938
    - The genltl tool can now output 20 different LTL formula families.
939
      It also replaces the LTLcounter Perl scripts.
940
    - There is a printer and parser for Kripke structures in text format.
941
942
943
944
945
  * Major interface changes:
    - The destructor of all states is now private.  Any code that looks like
      "delete some_state;" will cause an compile error and should be
      updated to "some_state->destroy();".  This new syntax is supported
      since version 0.7.
946
    - The experimental Nips interface has been removed.
947
948
949
950
951
952
  * Minor changes:
    - The dotty_reachable() function has a new option "assume_sba" that
      can be used for rendering automata with state-based acceptance.
      In that case, acceptance states are displayed with a double
      circle. ltl2tgba (both command line and on-line) Use it to display
      degeneralized automata.
953
954
955
    - The dotty_reachable() function will also display transition
      annotations (as returned by the tgba::transitition_annotation()).
      This can be useful when displaying (small) state spaces.
956
957
958
    - Identifiers used to name atomic proposition can contain dots.
      E.g.: X.Y is now an atomic proposition, while it was understood
      as X&Y in previous versions.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
959
    - The Doxygen documentation is no longer built as a PDF file.
960
961
962
  * Internal improvements:
    - The on-line ltl2tgba CGI script uses a cache to produce faster
      answers.
963
964
965
    - Better memory management for the states of explicit automata.
      Thanks to the aforementioned ->destroy() change, we can avoid
      cloning explicit states.
966
967
968
969
    - tgba_product has learned how to be faster when one of the operands
      is a Kripke structure (15% speedup).
    - The reduction rule for "a M b" has been improved: it can be
      reduced to "a & b" if "a" is a pure eventuallity.
970
971
972
973
974
    - More useless acceptance conditions are removed by SCC simplifications.
  * Bug fixes:
    - Safra complementation has been fixed in cases where more than
      one acceptance conditions where needed to convert the
      deterministic Streett automaton as a TGBA.
975
    - The degeneralization is now idempotent.  Previously, degeneralizing
976
977
978
979
      an already degeneralized automaton could add some states.
    - The degeneralization now has a deterministic behavior.  Previously
      it was possible to obtain different output depending on the
      memory layout.
980
981
982
983
984
985
986
987
    - Spot now outputs neverclaims with fully parenthesized guards.
      I.e., instead of
         (!x && y) -> goto S1
      it now outputs
         ((!(x)) && (y)) -> goto S1
      This prevents problems when the model defines `x' as
         #define x flag==0
      because !x then evaluated to (!flag)==0 instead of !(flag==0).
988

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
989
New in spot 0.7.1 (2011-02-07):
990

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
991
992
993
994
995
996
  * The LTL parser will accept operator ~ (for not) as well
    as --> and <--> (for implication and equivalence), allowing
    formulae from the Büchi Store to be read directly.
  * The neverclaim parser will accept guards of the form
        :: !(...) -> goto ...
    instead of the more commonly used
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
997
        :: (!(...)) -> goto ...
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
998
999
    This makes it possible to read neverclaims provided by the Büchi Store.
  * A new ltl2tgba option, -kt, will count the number of "sub-transitions".
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1000
    I.e., a transition labelled by "true" counts for 4 "sub-transitions"