[PPL-devel] [GIT] ppl/ppl(master): Reference added.

[Patricia Hill]

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

Author: Patricia Hill <patricia.hill at bugseng.com>
Date:   Thu Jan  9 20:51:44 2014 +0000

Reference added.

---

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

diff --git a/doc/ppl_citations.bib b/doc/ppl_citations.bib
index f8faf73..2d9f547 100644
--- a/doc/ppl_citations.bib
+++ b/doc/ppl_citations.bib
@@ -874,6 +874,28 @@ Summarizing:
              special PTIME cases."
 }
 
+ at Inproceedings{BenerecettiF13,
+ Author = "M. Benerecetti and M. Faella",
+ Title = "Tracking Differentiable Trajectories Across Polyhedra Boundaries",
+ Booktitle = "Proceedings of the 16th International Conference on
+              Hybrid Systems: Computation and Control ({HSCC} '13)",
+ Year = 2013,
+ ISBN = "978-1-4503-1567-8",
+ Address = "Philadelphia, Pennsylvania, USA",
+ Pages = "193--202",
+ Publisher = "ACM Press",
+ Abstract = "We analyze the properties of differentiable trajectories
+             subject to a constant differential inclusion which
+             constrains the first derivative to belong to a given
+             convex polyhedron. We present the first exact algorithm
+             that computes the set of points from which there is a
+             trajectory that reaches a given polyhedron while avoiding
+             another (possibly non-convex) polyhedron. We discuss the
+             connection with (Linear) Hybrid Automata and in
+             particular the relationship with the classical algorithm
+             for reachability analysis for Linear Hybrid Automata."
+}
+
 @Inproceedings{BerendsenJV10,
   Author = "J. Berendsen and D. N. Jansen and F. W. Vaandrager",
   Title = "Fortuna: Model Checking Priced Probabilistic Timed Automata",