[PPL-devel] [GIT] ppl/ppl(master): Removed duplicate entry.

[Roberto Bagnara]

Module: ppl/ppl
Branch: master
Commit: f9ccf58636a2ff7f1f8b911b4acf51ed93eb492d
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f9ccf58636a2ff7f1f8b911b4acf51ed93eb492d

Author: Roberto Bagnara <roberto.bagnara at bugseng.com>
Date:   Sat Dec 28 09:01:10 2013 +0100

Removed duplicate entry.

---

 doc/ppl_citations.bib |   31 -------------------------------
 1 files changed, 0 insertions(+), 31 deletions(-)

diff --git a/doc/ppl_citations.bib b/doc/ppl_citations.bib
index 9782924..f00982c 100644
--- a/doc/ppl_citations.bib
+++ b/doc/ppl_citations.bib
@@ -824,37 +824,6 @@ Summarizing:
              special PTIME cases."
 }
 
- at Article{benerecettiFM13,
-  Author= "M. Benerecetti and M. Faella and S. Minopoli",
-  Title = "Automatic synthesis of switching controllers for linear hybrid systems: Safety control",
-  Journal = "Theoretical Computer Science",
-  Year = 2013,
-  Volume = 493,
-  Pages = "116--138",
-  DOI = "10.1016/j.tcs.2012.10.042",
-  Publisher="Elsevier Science B.V.",
-  Abstract = "In this paper we study the problem of automatically
-              generating switching con- trollers for the class of
-              Linear Hybrid Automata, with respect to safety
-              objectives. While the same problem has been already
-              considered in the literature, no sound and complete
-              solution has been provided so far. We identify and solve
-              inaccuracies contained in previous characterizations of
-              the problem, providing a sound and complete symbolic
-              xpoint procedure to compute the set of states from which
-              a controller can keep the system in a given set of
-              desired states.  While the overall procedure may not
-              terminate, we prove the termination of each iteration,
-              thus paving the way to an effective implementation.  The
-              techniques needed to effectively and efficiently
-              implement the proposed solution procedure, based on
-              polyhedral abstractions of the state space, are
-              thoroughly illustrated and discussed. Finally, some
-              supporting and promising experimental results, based on
-              the implementation of the proposed techniques on top of
-              the tool PHAVer, are presented."
-}
-
 @Inproceedings{BerendsenJV10,
   Author = "J. Berendsen and D. N. Jansen and F. W. Vaandrager",
   Title = "Fortuna: Model Checking Priced Probabilistic Timed Automata",