hierarchy: Add is_persistence() and make is_recurrence() use it
* NEWS: Update. * bin/man/spot-x.x: Add environment variable. * spot/tl/hierarchy.cc: Implement them. * spot/tl/hierarchy.hh: Declare them.
This commit is contained in:
parent
e59274b609
commit
c827f75c37
4 changed files with 208 additions and 28 deletions
|
|
@ -99,6 +99,23 @@ in third-party tools that output incorrect HOA (e.g., declaring
|
|||
the automaton with property "univ-branch" when no universal branching
|
||||
is actually used)
|
||||
|
||||
.TP
|
||||
\fBSPOT_PR_CHECK\fR
|
||||
Select the default algorithm that must be used to check the persistence
|
||||
or recurrence property of a formula f. The values it can take are 1
|
||||
or 2. Both methods work either on f or !f thanks to the duality of
|
||||
persistence and recurrence classes.
|
||||
See "https://spot.lrde.epita.fr/hierarchy.html" for more details. If
|
||||
it is set to:
|
||||
.RS
|
||||
.IP 1
|
||||
It will try to check if f (or !f) is co-Büchi realizable in order to
|
||||
tell if f belongs to the persistence (or the recurrence) class.
|
||||
.IP 2
|
||||
It checks if f (or !f) is det-Büchi realizable to tell if f belongs
|
||||
to the recurrence (or the persistence) class.
|
||||
.RE
|
||||
|
||||
.TP
|
||||
\fBSPOT_SATLOG\fR
|
||||
If set to a filename, the SAT-based minimization routines will append
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue