Ariadne

swMATH6670MaRDI QIDQ18756FDOQ18756

Author name not available (Why is that?)

Described by source

• Ariadne: dominance checking of nonlinear hybrid automata using reachability analysis

Cited In (15)

• Semantics and computability of the evolution of hybrid systems
• Parametrised second-order complexity theory with applications to the study of interval computation
• A probabilistic calculus of cyber-physical systems
• Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
• Generating invariants for non-linear hybrid systems
• Axiomatic reals and certified efficient exact real computation
• Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System
• An introduction to the verification of hybrid systems using \textsc{Ariadne}
• The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
• 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
• A higher order method for input-affine uncertain systems
• Parameter synthesis of polynomial dynamical systems
• Computable analysis with applications to dynamic systems
• Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems
• Reachability computation for polynomial dynamical systems

This page was built for software: Ariadne