Ariadne is a library for computation with hybrid automata under development by a joint team including University of Udine, PARADES, CWI, and University of Verona. The goal is to build an open and easily extensible package that features basic data structures and operators to support analysis and synthesis of systems described with hybrid automata. The ARIADNE computational kernel is written using generic programming, in which mathematical concepts, such as real numbers and continuous functions, can be implemented by different concrete types presenting the same (or similar) interfaces. In this way, we can write algorithms which work with any type having the same interface, and even if a type does not implement the full interface, some algorithms may still be available for that type. The advantage of this approach is that it greatly facilitates extensions: new types can be freely added as long as they conform to the syntax and semantics of the concept; new algorithms can be plugged-in to work with the new types, and user-defined algorithms can replace the algorithms supplied with the tool.

References in zbMATH (referenced in 9 articles , 1 standard article )

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

  1. Dreossi, Tommaso; Dang, Thao; Piazza, Carla: Reachability computation for polynomial dynamical systems (2017)
  2. Rebiha, Rachid; Moura, Arnaldo V.; Matringe, Nadir: Generating invariants for non-linear hybrid systems (2015)
  3. Benvenuti, Luca; Bresolin, Davide; Collins, Pieter; Ferrari, Alberto; Geretti, Luca; Villa, Tiziano: Assume-guarantee verification of nonlinear hybrid systems with ARIADNE (2014)
  4. Kersevan, Borut Paul; Richter-Wa\ogonek{s}, Elzbieta: 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 (2013)
  5. Benvenuti, Luca; Bresolin, Davide; Collins, Pieter; Ferrari, Alberto; Geretti, Luca; Villa, Tiziano: Ariadne: dominance checking of nonlinear hybrid automata using reachability analysis (2012)
  6. Collins, Pieter: Semantics and computability of the evolution of hybrid systems (2011)
  7. Collins, Pieter; Zapreev, Ivan S.: Computable CTL$ ^*$ for discrete-time and continuous-space dynamic systems (2009)
  8. Benvenuti, L.; Ferrari, Alberto; Mazzi, E.; Vincentelli, A.L.Sangiovanni: Contract-based design for computation and verification of a closed-loop hybrid system (2008)
  9. Collins, Pieter; Goldsztejn, Alexandre: The reach-and-evolve algorithm for reachability analysis of nonlinear dynamical systems (2008)

Further publications can be found at: