Skip to main content
Conference Proceedings

GSPeeDI - A verification tool for generalized polygonal hybrid systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5684 LNCS 343-348
DOI: 10.1007/978-3-642-03466-4_23
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The GSPeeDI tool implements a decision procedure for the reachability analysis of GSPDIs, planar hybrid systems whose dynamics is given by differential inclusions, and that are not restricted by the goodness assumption from previous work on the so-called SPDIs. Unlike SPeeDI (a tool for reachability analysis of SPDIs) the underlying analysis of GSPeeDI is based on a breadth-first search algorithm, and it can handle more general systems. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hansen, H. A., & Schneider, G. (2009). GSPeeDI - A verification tool for generalized polygonal hybrid systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5684 LNCS, pp. 343–348). https://doi.org/10.1007/978-3-642-03466-4_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free