1.1 --- a/paper/comments.txt	Sat May 28 01:43:28 2011 +0200
     1.2 +++ b/paper/comments.txt	Sat May 28 18:31:12 2011 +0200
     1.3 @@ -6,6 +6,7 @@
     1.4  - syntax mixed with interpretation
     1.5  - no introduction to omega-regular languages
     1.6  - short introduction to LTL semantics
     1.7 +- no automata complement construction
     1.8  
     1.9  
    1.10  
    1.11 @@ -14,4 +15,4 @@
    1.12  + time progression, linear time ect.
    1.13  + infinite words as functions
    1.14  + ltl model as graph
    1.15 -
    1.16 ++ state space culling

     2.1 --- a/paper/src/paper.tex	Sat May 28 01:43:28 2011 +0200
     2.2 +++ b/paper/src/paper.tex	Sat May 28 18:31:12 2011 +0200
     2.3 @@ -7,17 +7,21 @@
     2.4  \usepackage{typearea}
     2.5  \usepackage{algorithm}
     2.6  \usepackage{algorithmic}
     2.7 -%\pagestyle{empty}
     2.8  
     2.9 +\pagestyle{headings}
    2.10  \renewcommand{\familydefault}{\sfdefault}
    2.11  \title{\textbf{Verification of Reactive Systems}}
    2.12 +%\title{\textbf{An Extension of Linear Temporal Logic}}
    2.13 +%\title{\textbf{Verification of Concurrent Systems}}
    2.14 +%\title{\textbf{Temporal Reasoning}}
    2.15  \author{Eugen Sawin\\   
    2.16    University of Freiburg, Germany\\\\
    2.17    \texttt{sawine@informatik.uni-freiburg.de}}
    2.18  \date{May, 2011}
    2.19  \begin{document}
    2.20 +
    2.21  \maketitle
    2.22 -
    2.23 +\thispagestyle{empty}
    2.24  %\itshape
    2.25  %\renewcommand\abstractname{Abstract} 
    2.26  \begin{abstract}
    2.27 @@ -31,7 +35,7 @@
    2.28  efficient techniques which work on-the-fly.
    2.29  \end{abstract}
    2.30  %\normalfont
    2.31 -
    2.32 +\newpage
    2.33  \section{Introduction}
    2.34  Program verification is a fundamental area of study in computer science. The broad goal
    2.35  is to verify whether a program is “correct”—i.e., whether the implementation of a program