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

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

1 2 3 4 next

  1. García Soto, Miriam; Prabhakar, Pavithra: Abstraction based verification of stability of polyhedral switched systems (2020)
  2. Goyal, Manish; Duggirala, Parasara Sridhar: Extracting counterexamples induced by safety violation in linear hybrid systems (2020)
  3. Malik, Avinash; Roop, Partha: A dynamic quantized state system execution framework for hybrid automata (2020)
  4. Sun, Hao; Li, Junfeng: Analysis on reachable set for spacecraft relative motion under low-thrust (2020)
  5. Bogomolov, Sergiy; Forets, Marcelo; Frehse, Goran; Potomkin, Kostiantyn; Schilling, Christian: JuliaReach: a toolbox for set-based reachability (2019)
  6. Gronski, Jessica; Ben Sassi, Mohamed-Amin; Becker, Stephen; Sankaranarayanan, Sriram: Template polyhedra and bilinear optimization (2019)
  7. Meyer, Pierre-Jean; Devonport, Alex; Arcak, Murat: TIRA: toolbox for interval reachability analysis (2019)
  8. Sánchez, César; Schneider, Gerardo; Ahrendt, Wolfgang; Bartocci, Ezio; Bianculli, Domenico; Colombo, Christian; Falcone, Yliès; Francalanza, Adrian; Krstić, Srđan; Lourenço, João M.; Nickovic, Dejan; Pace, Gordon J.; Rufino, Jose; Signoles, Julien; Traytel, Dmitriy; Weiss, Alexander: A survey of challenges for runtime verification from advanced application domains (beyond software) (2019)
  9. Sogokon, Andrew; Jackson, Paul B.; Johnson, Taylor T.: Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants (2019)
  10. Tran, Hoang-Dung; Nguyen, Luan Viet; Hamilton, Nathaniel; Xiang, Weiming; Johnson, Taylor T.: Reachability analysis for high-index linear differential algebraic equations (2019)
  11. Bogomolov, Sergiy; Forets, Marcelo; Frehse, Goran; Viry, Frédéric; Podelski, Andreas; Schilling, Christian: Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices (2018)
  12. Doyen, Laurent; Frehse, Goran; Pappas, George J.; Platzer, André: Verification of hybrid systems (2018)
  13. Le Coënt, Adrien; dit Sandretto, Julien Alexandre; Chapoutot, Alexandre; Fribourg, Laurent: An improved algorithm for the control synthesis of nonlinear sampled switched systems (2018)
  14. Villegas Pico, Hugo Nestor; Aliprantis, Dionysios C.: Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs (2018)
  15. Zhang, Hui; Wu, Jinzhao: Formal verification and quantitative metrics of MPSoC data dynamics (2018)
  16. Bak, Stanley; Bogomolov, Sergiy; Althoff, Matthias: Time-triggered conversion of guards for reachability analysis of hybrid automata (2017)
  17. Benerecetti, Massimo; Faella, Marco: Tracking smooth trajectories in linear hybrid systems (2017)
  18. Djaballah, Adel; Chapoutot, Alexandre; Kieffer, Michel; Bouissou, Olivier: Construction of parametric barrier functions for dynamical systems using interval analysis (2017)
  19. Dreossi, Tommaso: Sapo: reachability computation and parameter synthesis of polynomial dynamical systems (2017)
  20. Dreossi, Tommaso; Dang, Thao; Piazza, Carla: Reachability computation for polynomial dynamical systems (2017)

1 2 3 4 next

Further publications can be found at: