From 25ffc622afc727baa7c5c2918ee602b98bb291a3 Mon Sep 17 00:00:00 2001
From: Camil Staps
Date: Wed, 18 Apr 2018 21:48:33 +0200
Subject: Example: protocol dependencies

---
 Assignment1/exercises.tex | 1 +
 1 file changed, 1 insertion(+)

(limited to 'Assignment1/exercises.tex')

diff --git a/Assignment1/exercises.tex b/Assignment1/exercises.tex
index 647755e..ba056d5 100644
--- a/Assignment1/exercises.tex
+++ b/Assignment1/exercises.tex
@@ -64,6 +64,7 @@
 \end{exercise}
 
 \begin{exercise}
+	\label{ex:succinctness}
 	In this exercise we prove that PLTL formulas can be exponentially more succinct.
 	The proof followed here is that of \citet{Markey2003} which, in turn, is based on work by \citet{Etessami2002}.
 	The proof is achieved by giving an example of a formula which can be expressed in $\mathcal O(n)$ in PLTL but requires $\Omega(n)$ in LTL.
-- 
cgit v1.2.3

