SpaceEx

SpaceEx: Scalable Verification of Hybrid Systems. We present a scalable reachability algorithm for hybrid systems with piecewise affine, non-deterministic dynamics. It combines polyhedra and support function representations of continuous sets to compute an over-approximation of the reachable states. The algorithm improves over previous work by using variable time steps to guarantee a given local error bound. In addition, we propose an improved approximation model, which drastically improves the accuracy of the algorithm. The algorithm is implemented as part of SpaceEx, a new verification platform for hybrid systems, available at spaceex.imag.fr. Experimental results of full fixed-point computations with hybrid systems with more than 100 variables illustrate the scalability of the approach.


References in zbMATH (referenced in 21 articles )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Konečný, Michal; Taha, Walid; Bartha, Ferenc A.; Duracz, Jan; Duracz, Adam; Ames, Aaron D.: Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point (2016)
  2. Hagemann, Willem: Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (2015)
  3. Prabhakar, Pavithra; Duggirala, Parasara Sridhar; Mitra, Sayan; Viswanathan, Mahesh: Hybrid automata-based CEGAR for rectangular hybrid systems (2015)
  4. Casagrande, A.; Dreossi, T.; Fabriková, J.; Piazza, C.: $\epsilon$-semantics computations on biological systems (2014)
  5. Cimatti, Alessandro; Mover, Sergio; Tonetta, Stefano: Quantifier-free encoding of invariants for hybrid systems (2014)
  6. Minopoli, Stefano; Frehse, Goran: Non-convex invariants and urgency conditions on linear hybrid automata (2014)
  7. Mitsch, Stefan; Passmore, Grant Olney; Platzer, André: Collaborative verification-driven engineering of hybrid systems (2014)
  8. Xie, Dingbao; Bu, Lei; Zhao, Jianhua; Li, Xuandong: SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (2014)
  9. Zamani, Majid; Abate, Alessandro: Approximately bisimilar symbolic models for randomly switched stochastic systems (2014)
  10. Hahn, Ernst Moritz; Hartmanns, Arnd; Hermanns, Holger; Katoen, Joost-Pieter: A compositional modelling and analysis framework for stochastic hybrid systems (2013)
  11. Mitchell, Ian M.; Kaynama, Shahab; Chen, Mo; Oishi, Meeko: Safety preserving control synthesis for sampled data systems (2013)
  12. Prabhakar, Pavithra; Duggirala, Parasara Sridhar; Mitra, Sayan; Viswanathan, Mahesh: Hybrid automata-based CEGAR for rectangular hybrid systems (2013)
  13. Seladji, Yassamine; Bouissou, Olivier: Fixpoint computation in the polyhedra abstract domain using convex and numerical analysis tools (2013)
  14. Testylier, Romain; Dang, Thao: NLTOOLBOX: a library for reachability computation of nonlinear dynamical systems (2013)
  15. Ben Sassi, Mohamed Amin; Testylier, Romain; Dang, Thao; Girard, Antoine: Reachability analysis of polynomial systems using linear programming relaxations (2012)
  16. Goubault, Eric; Le Gall, Tristan; Putot, Sylvie: An accurate join for zonotopes, preserving affine input/output relations (2012)
  17. Johnson, Taylor T.; Green, Jeremy; Mitra, Sayan; Dudley, Rachel; Erwin, Richard Scott: Satellite rendezvous and conjunction avoidance: case studies in verification of nonlinear hybrid systems (2012)
  18. Abbas, Houssam; Fainekos, Georgios: Linear hybrid system falsification through local search (2011)
  19. Chen, Xin; Ábrahám, Erika; Frehse, Goran: Efficient bounded reachability computation for rectangular automata (2011)
  20. Dang, Thao; Gawlitza, Thomas Martin: Discretizing affine hybrid automata with uncertainty (2011)

1 2 next


Further publications can be found at: http://spaceex.imag.fr/documentation/publications