diff options
| author | Erin van der Veen | 2018-04-15 13:03:10 +0200 |
|---|---|---|
| committer | Erin van der Veen | 2018-04-15 13:03:10 +0200 |
| commit | 4ae23f3b27a16aeb0be31785c087351bff674710 (patch) | |
| tree | 28a9417c758da9ac088d95fd2ea5afbe62238d1f /Assignment1/summary.tex | |
| parent | Step 1 of syntactic algorithm (diff) | |
| parent | Add result by Sistla (1985): complexity of model checking for PLTL is the sam... (diff) | |
Merge branch 'master' of gitlab.science.ru.nl:eveen/Model-Checking
Diffstat (limited to 'Assignment1/summary.tex')
| -rw-r--r-- | Assignment1/summary.tex | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/Assignment1/summary.tex b/Assignment1/summary.tex index 6f243b2..a888df8 100644 --- a/Assignment1/summary.tex +++ b/Assignment1/summary.tex @@ -1,2 +1,14 @@ \subsection{Summary} % TODO: points to be added to 5.3 +\camil +\begin{itemize} + \item + PLTL is an extension to LTL which adds \emph{past modalities}. + The extension is not more expressive, but PLTL formulas can be exponentially more succinct than their LTL equivalents. + + \item + Because PLTL formulas need to be able to \enquote{look back}, the satisfaction relation $\vDash$ becomes ternary: + it is a subset of $\left(2^{AP}\right)^\omega \times \mathbb N \times PLTL$, + where the natural number indicates the index at which a trace satisfies a formula. +\end{itemize} +\cbend |