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

* doc/org/ltlcross.org: Fix explanation.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2016-05-11 16:19:13 +02:00
parent 0e9ccabbe8
commit 2bcaff138a
1 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
doc/org/ltlcross.org
View file

@ -624,12 +624,12 @@ positive and negative formulas by the ith translator).
followed by a cycle that should be repeated infinitely often. followed by a cycle that should be repeated infinitely often.
The cycle part is denoted by =cycle{...}=. The cycle part is denoted by =cycle{...}=.
- Complemented intersection check. If $P_i$ and $P_j$ are - Complemented intersection check. If $P_i$ and $N_i$ are
deterministic, =ltlcross= builds their complements, $Comp(P_i)$ deterministic, =ltlcross= builds their complements, $Comp(P_i)$
and $Comp(P_j)$, and then ensures that $Comp(P_i)\otimes and $Comp(N_i)$, and then ensures that $Comp(P_i)\otimes
Comp(P_j)$ is empty. If only one of them is deterministic, Comp(N_i)$ is empty. If only one of them is deterministic, for
for instance $P_i$, we check that $P_j\otimes Comp(P_i)$ for all instance $P_i$, we check that $P_j\otimes Comp(P_i)$ for all $j
$j \ne i$; likewise if it's $N_i$ that is deterministic. \ne i$; likewise if it's $N_i$ that is deterministic.
By default this check is only done for deterministic automata, By default this check is only done for deterministic automata,
because complementation is relatively cheap is that case (at least because complementation is relatively cheap is that case (at least