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 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 31 articles )

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

1 2 next

  1. Dreossi, Tommaso; Dang, Thao; Piazza, Carla: Reachability computation for polynomial dynamical systems (2017)
  2. Bak, Stanley; Bogomolov, Sergiy; Henzinger, Thomas A.; Johnson, Taylor T.; Prakash, Pradyot: Scalable static hybridization methods for analysis of nonlinear systems (2016)
  3. 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)
  4. Aréchiga, Nikos; Kapinski, James; Deshmukh, Jyotirmoy V.; Platzer, André; Krogh, Bruce: Numerically-aided deductive safety proof for a powertrain control system (2015)
  5. Bak, Stanley; Bogomolov, Sergiy; Johnson, Taylor T.: HYST: a source transformation and translation tool for hybrid automaton models (2015)
  6. Frehse, Goran; Bogomolov, Sergiy; Greitschus, Marius; Strump, Thomas; Podelski, Andreas: Eliminating spurious transitions in reachability with support functions (2015)
  7. Hagemann, Willem: Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (2015)
  8. Lesser, Kendra; Oishi, Meeko: Finite state approximation for verification of partially observable stochastic hybrid systems (2015)
  9. Matsumoto, Shota; Kono, Fumihiko; Kobayashi, Teruya; Ueda, Kazunori: HyLaGi: symbolic implementation of a hybrid constraint language HydLa (2015) ioport
  10. Prabhakar, Pavithra; Duggirala, Parasara Sridhar; Mitra, Sayan; Viswanathan, Mahesh: Hybrid automata-based CEGAR for rectangular hybrid systems (2015)
  11. Bogomolov, Sergiy; Herrera, Christian; Muñiz, Marco; Westphal, Bernd; Podelski, Andreas: Quasi-dependent variables in hybrid automata (2014)
  12. Casagrande, A.; Dreossi, T.; Fabriková, J.; Piazza, C.: $\epsilon$-semantics computations on biological systems (2014)
  13. Cimatti, Alessandro; Mover, Sergio; Tonetta, Stefano: Quantifier-free encoding of invariants for hybrid systems (2014)
  14. Minopoli, Stefano; Frehse, Goran: Non-convex invariants and urgency conditions on linear hybrid automata (2014)
  15. Mitsch, Stefan; Passmore, Grant Olney; Platzer, André: Collaborative verification-driven engineering of hybrid systems (2014) ioport
  16. Xie, Dingbao; Bu, Lei; Zhao, Jianhua; Li, Xuandong: SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (2014)
  17. Zamani, Majid; Abate, Alessandro: Approximately bisimilar symbolic models for randomly switched stochastic systems (2014)
  18. Bourke, Timothy; Pouzet, Marc: Zélus: a synchronous language with ODEs (2013)
  19. Hahn, Ernst Moritz; Hartmanns, Arnd; Hermanns, Holger; Katoen, Joost-Pieter: A compositional modelling and analysis framework for stochastic hybrid systems (2013)
  20. Mitchell, Ian M.; Kaynama, Shahab; Chen, Mo; Oishi, Meeko: Safety preserving control synthesis for sampled data systems (2013)

1 2 next

Further publications can be found at: