diff options
| author | Camil Staps | 2018-04-18 21:48:33 +0200 |
|---|---|---|
| committer | Camil Staps | 2018-04-18 21:48:33 +0200 |
| commit | 25ffc622afc727baa7c5c2918ee602b98bb291a3 (patch) | |
| tree | f1bffb5db779cc505c70892b91acdfc3e13f24dc /Assignment1/bad-prefix.tex | |
| parent | Bars everywhere (diff) | |
Example: protocol dependencies
Diffstat (limited to 'Assignment1/bad-prefix.tex')
| -rw-r--r-- | Assignment1/bad-prefix.tex | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/Assignment1/bad-prefix.tex b/Assignment1/bad-prefix.tex index a2101ba..c9145b3 100644 --- a/Assignment1/bad-prefix.tex +++ b/Assignment1/bad-prefix.tex @@ -25,6 +25,7 @@ Once a state reoccurs, $j$ is found. This algorithm, more formally described in \cref{alg:bad-prefix}, is obviously guaranteed to find the smallest $i,j$ for which $vw^i$ and $vw^j$ lead to the same state. However, it is not guaranteed to find a minimal bad prefix (for instance, when a prefix of $v$ already is a minimal bad prefix). +% TODO: fix placement; see https://tex.stackexchange.com/q/427278/23992 \begin{algorithm}[H] % NOTE: ugly hardcoded spacing to mimic ugly algorithm layout by Baier-Katoen \caption{Finding a bad prefix for a safety property from a counterexample $vw^\omega$} |