alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

translate: use relabel_bse() to speed translations with a lot of APs

Browse source 
Fixes #268, reported by Yann Thierry-Mieg.

* spot/twaalgos/translate.cc, spot/twaalgos/translate.hh: Call
relabel_bse() + relabel_here().
* tests/core/format.test: Add a test case.
* bin/spot-x.cc, NEWS: Document the change.
This commit is contained in:
Alexandre Duret-Lutz 2017-06-20 13:42:58 +02:00
parent 0bc1dd4446
commit 05abed6d2f
5 changed files with 73 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

11
NEWS
View file

@ -123,6 +123,17 @@ New in spot 2.3.4.dev (not yet released)
names from another automaton, honoring "original-states" if
present.
- Building automata for LTL formula with a large number N of atomic
propositions can be costly, because several loops and
data-structures are exponential into N. However a formula like
((a & b & c) | (d & e & f)) U ((d & e & f) | (g & h & i))
can be translated more efficiently by first building an automaton
for (p0 | p1) U (p1 | p2), and then substituting p0, p1, p2 by the
appropriate Boolean formula. Such a trick is now attempted
for translation of formulas with 4 atomic propositions or
more (this threshold can be changed, see -x relabel-bool=N in
the spot-x(7) man page).
Python:
- The 'spot.gen' package exports the functions from libspotgen.