From 4a8205f8d47db9bd7b677de1fb379a882dd0f291 Mon Sep 17 00:00:00 2001
From: Camil Staps
Date: Sun, 15 Apr 2018 12:25:38 +0200
Subject: Add result by Sistla (1985): complexity of model checking for PLTL is
 the same as for LTL

---
 Assignment1/library.bib | 10 ++++++++++
 1 file changed, 10 insertions(+)

(limited to 'Assignment1/library.bib')

diff --git a/Assignment1/library.bib b/Assignment1/library.bib
index ade5101..23f73b8 100755
--- a/Assignment1/library.bib
+++ b/Assignment1/library.bib
@@ -87,3 +87,13 @@
 	year      = 2002,
 	pages     = {279--295}
 }
+
+@article{Sistla1985,
+	author    = {Sistla, A. P. and Clarke, E. M.},
+	title     = {The Complexity of Propositional Linear Temporal Logics},
+	journal   = {Journal of the ACM},
+	volume    = 32,
+	issue     = 3,
+	year      = 1985,
+	pages     = {733--749}
+}
-- 
cgit v1.2.3