Ariadne

swMATH6670MaRDI QIDQ18756

No author found.

Described by source

• Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis

Related Items (15)

Axiomatic reals and certified efficient exact real computation ⋮ An Introduction to the Verification of Hybrid Systems Using Ariadne ⋮ A higher order method for input-affine uncertain systems ⋮ Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System ⋮ The Monte Carlo event generator AcerMC versions 2.0 to 3.8 with interfaces to PYTHIA 6.4, HERWIG 6.5 and ARIADNE 4.1 ⋮ Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp> ⋮ Semantics and Computability of the Evolution of Hybrid Systems ⋮ Reachability computation for polynomial dynamical systems ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ A probabilistic calculus of cyber-physical systems ⋮ Computable analysis with applications to dynamic systems ⋮ The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems ⋮ Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems ⋮ Parameter synthesis of polynomial dynamical systems ⋮ Generating invariants for non-linear hybrid systems

This page was built for software: Ariadne