GSPeeDI – A Verification Tool for Generalized Polygonal Hybrid Systems

  • Hallstein Asheim Hansen
  • Gerardo Schneider
Conference paper

DOI: 10.1007/978-3-642-03466-4_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5684)
Cite this paper as:
Hansen H.A., Schneider G. (2009) GSPeeDI – A Verification Tool for Generalized Polygonal Hybrid Systems. In: Leucker M., Morgan C. (eds) Theoretical Aspects of Computing - ICTAC 2009. ICTAC 2009. Lecture Notes in Computer Science, vol 5684. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hallstein Asheim Hansen
    • 1
  • Gerardo Schneider
    • 2
  1. 1.Buskerud University CollegeKongsbergNorway
  2. 2.Dept. of InformaticsUniversity of OsloOsloNorway

Personalised recommendations