# HG changeset patch
# User Eugen Sawin <sawine@me73.com>
# Date 1306600272 -7200
# Node ID 8057b328e9d3e4eb9357e8fb96cb2de11f5cfcad
# Parent  3485ca2769799a872949461abbfd2cd0d37e7cd9
Not much.

diff -r 3485ca276979 -r 8057b328e9d3 paper/comments.txt
--- a/paper/comments.txt	Sat May 28 01:43:28 2011 +0200
+++ b/paper/comments.txt	Sat May 28 18:31:12 2011 +0200
@@ -6,6 +6,7 @@
 - syntax mixed with interpretation
 - no introduction to omega-regular languages
 - short introduction to LTL semantics
+- no automata complement construction
 
 
 
@@ -14,4 +15,4 @@
 + time progression, linear time ect.
 + infinite words as functions
 + ltl model as graph
-
++ state space culling
diff -r 3485ca276979 -r 8057b328e9d3 paper/src/paper.tex
--- a/paper/src/paper.tex	Sat May 28 01:43:28 2011 +0200
+++ b/paper/src/paper.tex	Sat May 28 18:31:12 2011 +0200
@@ -7,17 +7,21 @@
 \usepackage{typearea}
 \usepackage{algorithm}
 \usepackage{algorithmic}
-%\pagestyle{empty}
 
+\pagestyle{headings}
 \renewcommand{\familydefault}{\sfdefault}
 \title{\textbf{Verification of Reactive Systems}}
+%\title{\textbf{An Extension of Linear Temporal Logic}}
+%\title{\textbf{Verification of Concurrent Systems}}
+%\title{\textbf{Temporal Reasoning}}
 \author{Eugen Sawin\\   
   University of Freiburg, Germany\\\\
   \texttt{sawine@informatik.uni-freiburg.de}}
 \date{May, 2011}
 \begin{document}
+
 \maketitle
-
+\thispagestyle{empty}
 %\itshape
 %\renewcommand\abstractname{Abstract} 
 \begin{abstract}
@@ -31,7 +35,7 @@
 efficient techniques which work on-the-fly.
 \end{abstract}
 %\normalfont
-
+\newpage
 \section{Introduction}
 Program verification is a fundamental area of study in computer science. The broad goal
 is to verify whether a program is “correct”—i.e., whether the implementation of a program