summaryrefslogtreecommitdiff
path: root/Assignment1
diff options
context:
space:
mode:
authorCamil Staps2018-04-12 23:04:14 +0200
committerCamil Staps2018-04-12 23:04:14 +0200
commitdf152a92fad87dafb7948e8165d8e25b44e4c236 (patch)
tree9d35c0f2a7c876e3c5646a8ce9cc9d5286e7c673 /Assignment1
parentAdd an exercise based on Markey's proof; extend the grammar because we allow ... (diff)
Correct section counts
Diffstat (limited to 'Assignment1')
-rw-r--r--Assignment1/assignment1.tex27
1 files changed, 15 insertions, 12 deletions
diff --git a/Assignment1/assignment1.tex b/Assignment1/assignment1.tex
index 610f7ec..6d79892 100644
--- a/Assignment1/assignment1.tex
+++ b/Assignment1/assignment1.tex
@@ -80,7 +80,10 @@
\maketitle
-\section{Past Modalities in LTL}
+\setcounter{section}{5}
+\setcounter{subsection}{2}
+
+\subsection{Past Modalities in LTL}
% Explain that past Modalities are not necessary for a complete logic
% Explain that PLTL does make the logic more succinct (Paper 1)
%TODO: Give example on what kind of things we want to express with PLTL
@@ -106,7 +109,7 @@ They are also included in many model checking tools, such as NuSMV.
For this reason, it is useful to discuss them here.
\cbend
-\subsection{Syntax}
+\subsubsection{Syntax}
% Provide formal syntax
% Provide intuitive semantics
%TODO: Provide formal semantics
@@ -260,7 +263,7 @@ Before turning to the formal semantics in the next subsection, we provide some e
\end{example}
\cbend
-\subsection{Semantics}
+\subsubsection{Semantics}
\erin
The semantics of LTL and PLTL are defined in a very similar way.
However, we must make some modifications to the definitions.
@@ -368,28 +371,28 @@ Additionally, we can define another form of equivalence, initial equivalence:
\end{definition}
\cbend
-\subsection{LTL and PLTL}
+\subsubsection{LTL and PLTL}
%TODO: Consider/Analyse differences between LTL and PLTL
-\subsection{PLTL to LTL}
+\subsubsection{PLTL to LTL}
%TODO: 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
%TODO: (Section?) Assess if PLTL is actually more succinct using the examples from the SSH Paper
-\subsection{Minimal Bad Prefix in NuSMV}
+\subsubsection{Minimal Bad Prefix in NuSMV}
%TODO: Given a formula of the form vw^\omega, can we find a n \in \mathbb{N} such that vw^n is a bad prefix?
-\section{Summary}
+\subsection{Summary}
% TODO: points to be added to 5.3
-\section{Bibliographic Notes}
+\subsection{Bibliographic Notes}
% TODO: points to be added to 5.4
% A possibly helpful list is at https://cstheory.stackexchange.com/a/29452
% Also the bibliography file should be worked through.
-\section{Exercises}
+\subsection{Exercises}
% After the exam documentclass; http://compgroups.net/comp.text.tex/-if-else-fi-in-new-environment/263869
\newif\ifshowanswers\showanswerstrue
\newenvironment{answer}%
@@ -532,7 +535,9 @@ Additionally, we can define another form of equivalence, initial equivalence:
\end{exercise}
\cbend
-\section{Contribution}
+\printbibliography
+
+\section*{Contribution}
%TODO: Like we are some immature group of children, we have to provide proof of contribution
\camil
Erin has started writing the text.
@@ -543,6 +548,4 @@ In the above, yellow bars indicate content primarily contributed by Erin, wherea
Unfortunately, disabilities of the \textsf{changebar} package make it impossible to indicate the fine-grainedness of our redaction process.
\cbend
-\printbibliography
-
\end{document}