Commit 2bcaff13 by Alexandre Duret-Lutz

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

parent 0e9ccabb
 ... @@ -624,12 +624,12 @@ positive and negative formulas by the ith translator). ... @@ -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 ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment