diff options
| author | Camil Staps | 2018-04-18 19:33:40 +0200 |
|---|---|---|
| committer | Camil Staps | 2018-04-18 19:33:40 +0200 |
| commit | 32f1f4867bad79eb4d5afd179697b92699521698 (patch) | |
| tree | b617e249813c3d0b2d38a47abc8939e88e499d04 /Assignment1/conversion.tex | |
| parent | Finish(?) SSH example (diff) | |
Minor enhancements
Diffstat (limited to 'Assignment1/conversion.tex')
| -rw-r--r-- | Assignment1/conversion.tex | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/Assignment1/conversion.tex b/Assignment1/conversion.tex index 72304d2..3f4cf0f 100644 --- a/Assignment1/conversion.tex +++ b/Assignment1/conversion.tex @@ -7,6 +7,7 @@ The second algorithm makes use of the translation of PLTL formulas to automata a This algorithm is described in more detail below. \paragraph{Syntactic Algorithm} +\label{pltl:to-ltl:syntactic} The syntactic algorithm as proposed by Gabbay has its foundation in the following three facts:% \footnote{% Note that Gabbay used a slightly different, \enquote{non-strict} definition for the $\Uop$ and $\Sop$ operators. @@ -144,7 +145,7 @@ These equivalences also hold when the path is reversed, so similar elimination r The final step of the algorithm entails removing the parts of the formula that contains the $\Sop$-operators. \camil -\begin{example}[Properties for an Authentication System] +\begin{example}[A property for an Authentication System] \label{ex:pltl-to-ltl:authentication} Consider again the property from \cref{ex:pltl:authentication-system}, repeated here with less verbose names: $\phi = \square (c \rightarrow \lnot f \Sop s)$. @@ -338,8 +339,8 @@ Let us first define the Muller Automaton: Converting a NBA to a Muller automaton was shown to be possible by R. McNaughton~\cite{McNaughton1966} and is part of what is known as McNaughton's theorem. - \cbend + %Provide the syntactic algorithm to convert PLTL to LTL %TODO: Provide algorithm via automata to convert PLTL to LTL %TODO: In both cases make use of examples from SSH Paper |