From 25ffc622afc727baa7c5c2918ee602b98bb291a3 Mon Sep 17 00:00:00 2001
From: Camil Staps
Date: Wed, 18 Apr 2018 21:48:33 +0200
Subject: Example: protocol dependencies

---
 Assignment1/bad-prefix.tex | 1 +
 1 file changed, 1 insertion(+)

(limited to 'Assignment1/bad-prefix.tex')

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$}
-- 
cgit v1.2.3

