summaryrefslogtreecommitdiff
path: root/Assignment1
diff options
context:
space:
mode:
Diffstat (limited to 'Assignment1')
-rw-r--r--Assignment1/assignment1.tex1
-rw-r--r--Assignment1/comparison.tex2
-rw-r--r--Assignment1/summary.tex12
3 files changed, 12 insertions, 3 deletions
diff --git a/Assignment1/assignment1.tex b/Assignment1/assignment1.tex
index 3c9d766..b4ed04c 100644
--- a/Assignment1/assignment1.tex
+++ b/Assignment1/assignment1.tex
@@ -90,7 +90,6 @@
\input{semantics}
\input{specifying-properties}
\input{equivalence}
-\input{comparison}
\input{conversion}
%TODO: (Section?) Assess if PLTL is actually more succinct using the examples from the SSH Paper
\input{bad-prefix}
diff --git a/Assignment1/comparison.tex b/Assignment1/comparison.tex
deleted file mode 100644
index 5876153..0000000
--- a/Assignment1/comparison.tex
+++ /dev/null
@@ -1,2 +0,0 @@
-\subsubsection{LTL and PLTL}
-%TODO: Consider/Analyse differences between LTL and PLTL
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