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

improve documentation for -x sat-minimize

Browse source 
* bin/man/spot-x.x, bin/spot-x.cc: Improve documentation of SAT-based
minimization.  It was still referring to TGBA although it works for
TwA.
* spot/twaalgos/postproc.cc: Typo.
This commit is contained in:
Alexandre Duret-Lutz 2021-04-19 16:46:30 +02:00
parent 803a61a03d
commit cfa3417449
3 changed files with 22 additions and 15 deletions
Download patch file Download diff file Expand all files Collapse all files

12
bin/man/spot-x.x
View file

@ -10,11 +10,17 @@ spot-x \- Common fine-tuning options and environment variables.
.\" Add any additional description here
[SAT\-MINIMIZE VALUES]
When the sat-minimize=K option is used to enable SAT-based
minimization of deterministic automata, a SAT solver is
used to minimize an input automaton with N states into an
output automaton with 1≤M≤N states. The parameter K specifies
how the smallest possible M should be searched.
.TP
\fB1\fR
Used by default, \fB1\fR performs a binary search, checking N/2, etc.
The upper bound being N (the size of the starting automaton), the lower bound
is always 1 except when \fBsat-langmap\fR option is used.
The default, \fB1\fR, performs a binary search between 1 and N. The
lower bound can sometimes be improved when the \fBsat-langmap\fR
option is used.
.TP
\fB2\fR