swMATH10939MaRDI QIDQ22891FDOQ22891
Author name not available (Why is that?)
Official website: http://spaceex.imag.fr/
Cited In (only showing first 100 items - show all)
- An axiomatic approach to existence and liveness for differential equations
- Efficient bounded reachability computation for rectangular automata
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Effective hybrid system falsification using Monte Carlo tree search guided by QB-robustness
- Verisig 2.0: verification of neural network controllers using Taylor model preconditioning
- Satellite rendezvous and conjunction avoidance: case studies in verification of nonlinear hybrid systems
- Analysis on reachable set for spacecraft relative motion under low-thrust
- Event-B refinement for continuous behaviours approximation
- Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices
- Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants
- Quantitative Model Checking for a Controller Design
- Finite state approximation for verification of partially observable stochastic hybrid systems
- Rigorous simulation-based analysis of linear hybrid systems
- Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems
- ReachNN
- Discretizing affine hybrid automata with uncertainty
- Eliminating spurious transitions in reachability with support functions
- Quasi-dependent variables in hybrid automata
- Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Scalable static hybridization methods for analysis of nonlinear systems
- Lagrangian methods for approximating the viability kernel in high-dimensional systems
- A compositional modelling and analysis framework for stochastic hybrid systems
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
- Safety preserving control synthesis for sampled data systems
- Template polyhedra and bilinear optimization
- \(\epsilon\)-semantics computations on biological systems
- A dynamic quantized state system execution framework for hybrid automata
- Pegasus: sound continuous invariant generation
- An improved algorithm for the control synthesis of nonlinear sampled switched systems
- Hybrid automata-based CEGAR for rectangular hybrid systems
- Hybrid automata-based CEGAR for rectangular hybrid systems
- Verification of Hybrid Systems
- Computing branching distances with quantitative games
- Quantifier-free encoding of invariants for hybrid systems
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
- Change-of-bases abstractions for non-linear hybrid systems
- NLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical Systems
- Crossing the Bridge between Similar Games
- Linear hybrid system falsification through local search
- Counterexample-Guided Refinement of Template Polyhedra
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
- Tracking smooth trajectories in linear hybrid systems
- Time-triggered conversion of guards for reachability analysis of hybrid automata
- Parameter synthesis of polynomial dynamical systems
- Extracting counterexamples induced by safety violation in linear hybrid systems
- Reachability analysis for high-index linear differential algebraic equations
- Abstraction based verification of stability of polyhedral switched systems
- Generalized property-directed reachability for hybrid systems
- NNVODE
- Lazysets.jl
- Verisig
- Kaa
- Order-reduction abstractions for safety verification of high-dimensional linear systems
- Adaptive reachability algorithms for nonlinear systems using abstraction error analysis
- Formal verification and quantitative metrics of MPSoC data dynamics
- Construction of parametric barrier functions for dynamical systems using interval analysis
- Reachability analysis of a general class of neural ordinary differential equations
- Reachset Conformance Testing of Hybrid Automata
- Approximately bisimilar symbolic models for randomly switched stochastic systems
- ModelPlex: verified runtime validation of verified cyber-physical system models
- Forward inner-approximated reachability of non-linear continuous systems
- Reachability computation for polynomial dynamical systems
- DyverseRBT
- Data-driven and model-based verification via Bayesian identification and reachability analysis
- Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties
- A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
- An accurate join for zonotopes, preserving affine input/output relations
- Formal system verification. State-of the-art and future trends
- An introduction to the verification of hybrid systems using \textsc{Ariadne}
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
- A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems
- Verification and parameter synthesis for real-time programs using refinement of trace abstraction
- Numerically-aided deductive safety proof for a powertrain control system
- Reachability of weakly nonlinear systems using Carleman linearization
- Non-convex invariants and urgency conditions on linear hybrid automata
- Formal Verification Applied to Robotic Surgery
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point
- Reachability Analysis of Nonlinear Differential-Algebraic Systems
- LOLA
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
- Reachability analysis of polynomial systems using linear programming relaxations
- IMITATOR
- Benchmarks
- ARMC
- Aspic
- PPL
- MATISSE
- ToolboxLS
- Ariadne
- dReal
- mctau
- HSolver
- Ptolemy
- CAPD
- RunLim
- NLTOOLBOX
- AERN
This page was built for software: SpaceEx
