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

ltlsynt: new algorithm, based on LAR

Browse source 
* bin/ltlsynt.cc: here
* tests/core/ltlsynt.test: test it
* NEWS: document it
This commit is contained in:
Maximilien Colange 2018-07-24 01:01:11 +02:00
parent bd75ab5b39
commit 8d5d453efa
3 changed files with 88 additions and 45 deletions
Download patch file Download diff file Expand all files Collapse all files

13
NEWS
View file

@ -34,13 +34,16 @@ New in spot 2.6.0.dev (not yet released)
- "ltlfilt --suspendable" is now a synonym for
"ltlfilt --universal --eventual".
- ltlsynt now has two algorithms for synthesis:
- ltlsynt now has three algorithms for synthesis:
--algo=sd is the historical one. The automaton of the formula
is split to separate inputs and outputs, then
determinized.
--algo=ds the automaton of the formula is determinized, then
split to separate inputs and outputs.
In both cases, the obtained parity game is solved using
determinized (with Safra construction).
--algo=ds the automaton of the formula is determinized (Safra),
then split to separate inputs and outputs.
--alog=lar translate the formula to a deterministic automaton
with an arbitrary acceptance condition, then turn it
into a parity automaton using LAR, and split it.
In all three cases, the obtained parity game is solved using
Zielonka algorithm. Calude's quasi-polynomial time algorithm has
been dropped as it was not used.