diff options
author | Camil Staps | 2018-04-22 22:04:48 +0200 |
---|---|---|
committer | Camil Staps | 2018-04-22 22:04:48 +0200 |
commit | e26ef4b469b5aaccbac8c562fe92ba81ff90e8ae (patch) | |
tree | bef51c9c8ac997e5bdad164d63dc4587b17b87c6 /Assignment1/bad-prefix.tex | |
parent | Examples for equivalence (diff) |
Resolve LaTeX warnings
Diffstat (limited to 'Assignment1/bad-prefix.tex')
-rw-r--r-- | Assignment1/bad-prefix.tex | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/Assignment1/bad-prefix.tex b/Assignment1/bad-prefix.tex index e357359..c4b10fa 100644 --- a/Assignment1/bad-prefix.tex +++ b/Assignment1/bad-prefix.tex @@ -30,8 +30,11 @@ However, it is not guaranteed to find a minimal bad prefix (for instance, when a \caption{Finding a bad prefix for a safety property from a counterexample $vw^\omega$} \label{alg:bad-prefix} \vspace{5pt} - \textit{Input:} finite transition system $TS$, safety property $P$ and a counterexample $vw^\omega$.\\ - \textit{Output:} an $i\in\mathbb N$ for which $vw^i$ is a bad prefix.\\[-5pt] + \textit{Input:} finite transition system $TS$, safety property $P$ and a counterexample $vw^\omega$. + + \textit{Output:} an $i\in\mathbb N$ for which $vw^i$ is a bad prefix. + + \vspace{5pt} \hrule \begin{algorithmic}[0] \State $\mathcal A \gets \text{an NBA such that $\mathcal L_\omega(\mathcal A) = \textsl{Words}(\lnot P)$}$ |