* NEWS: Mention lenient parsing.
This commit is contained in:
parent
86dac4aadf
commit
ff0eada81d
1 changed files with 18 additions and 2 deletions
20
NEWS
20
NEWS
|
|
@ -40,7 +40,8 @@ New in spot 0.9.2a:
|
||||||
These binaries are built in the src/bin/ directory. The former
|
These binaries are built in the src/bin/ directory. The former
|
||||||
test versions of genltl and randltl have been removed from the
|
test versions of genltl and randltl have been removed from the
|
||||||
source tree. The old version of ltl2tgba with its gazillion
|
source tree. The old version of ltl2tgba with its gazillion
|
||||||
options is still is src/tgbatest/ and used for testing.
|
options is still is src/tgbatest/ and is meant to be used for
|
||||||
|
testing only.
|
||||||
|
|
||||||
* New features in the Spot library:
|
* New features in the Spot library:
|
||||||
|
|
||||||
|
|
@ -72,7 +73,7 @@ New in spot 0.9.2a:
|
||||||
|
|
||||||
A discussion of these automata, part of Ala Eddine BEN SALEM's
|
A discussion of these automata, part of Ala Eddine BEN SALEM's
|
||||||
PhD work, should appear in ToPNoC VI (LNCS 7400). The web-based
|
PhD work, should appear in ToPNoC VI (LNCS 7400). The web-based
|
||||||
interface and the aformentioned ltl2tgta tool, can be used
|
interface and the aformentioned ltl2tgta tool can be used
|
||||||
to build testing automata.
|
to build testing automata.
|
||||||
|
|
||||||
- TGBA can now be reduced by Reverse Simulation (in addition to
|
- TGBA can now be reduced by Reverse Simulation (in addition to
|
||||||
|
|
@ -91,6 +92,14 @@ New in spot 0.9.2a:
|
||||||
to_lbt_string() can be used to print an LTL formula using this
|
to_lbt_string() can be used to print an LTL formula using this
|
||||||
syntax.
|
syntax.
|
||||||
|
|
||||||
|
- The LTL/PSL parser now has a lenient mode that can be usefull
|
||||||
|
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.
|
||||||
|
|
||||||
- minimize_obligation() has a new option to disable WDBA
|
- minimize_obligation() has a new option to disable WDBA
|
||||||
minimization it cases it would produce a deterministic automaton
|
minimization it cases it would produce a deterministic automaton
|
||||||
that is bigger than the original TGBA. This can help
|
that is bigger than the original TGBA. This can help
|
||||||
|
|
@ -110,6 +119,13 @@ New in spot 0.9.2a:
|
||||||
syntax. However inside SERE it is interpreted as the Kleen
|
syntax. However inside SERE it is interpreted as the Kleen
|
||||||
star.
|
star.
|
||||||
|
|
||||||
|
- 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).
|
||||||
|
|
||||||
- The gspn-ssp benchmark has been removed.
|
- The gspn-ssp benchmark has been removed.
|
||||||
|
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue