Guaranteed Error Bounds on Approximate Model Abstractions through Reachability Analysis

Guaranteed Error Bounds on Approximate Model Abstractions through Reachability Analysis

Show other versions (1)

Bibliographic Details
Main Authors:	Cardelli, L, Tribastone, M, Tschaikowski, M, Vandin, A
Format:	Conference item
Published:	Springer 2018

Similar Items

Guaranteed error bounds on approximate model abstractions through reachability analysis
by: Cardelli, L, et al.
Published: (2018)

Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees
by: Liebenwein, Lucas, et al.
Published: (2018)

Syntactic markovian bisimulation for chemical reaction networks
by: Cardelli, L, et al.
Published: (2017)

Comparing chemical reaction networks: a categorical and algorithmic perspective
by: Cardelli, L, et al.
Published: (2016)

Comparing chemical reaction networks: A categorical and algorithmic perspective
by: Cardelli, L, et al.
Published: (2017)

Maximal aggregation of polynomial dynamical systems
by: Cardelli, L, et al.
Published: (2017)

ERODE: A tool for the evaluation and reduction of ordinary differential equations
by: Cardelli, L, et al.
Published: (2017)

Efficient syntax-driven lumping of differential equations
by: Cardelli, L, et al.
Published: (2016)

Symbolic computation of differential equivalences
by: Cardelli, L, et al.
Published: (2019)

Approximation of probabilistic reachability for chemical reaction networks using the linear noise approximation
by: Kwiatkowska, M, et al.
Published: (2016)

Lumpability for uncertain continuous-time Markov chains
by: Cardelli, L, et al.
Published: (2021)

Exact maximal reduction of stochastic reaction networks by species lumping
by: Cardelli, L, et al.
Published: (2021)

Algorithmic minimization of uncertain continuous-time Markov chains
by: Cardelli, L, et al.
Published: (2023)

Reachability computation for switching diffusions: finite abstractions with certifiable and tuneable precision
by: Laurenti, L, et al.
Published: (2017)

Reachability computation for switching diffusions: Finite abstractions with certifiable and tuneable precision
by: Laurenti, L, et al.
Published: (2017)

Reachability analysis of deep neural networks with provable guarantees
by: Ruan, W, et al.
Published: (2018)

From electric circuits to chemical networks
by: Cardelli, L, et al.
Published: (2019)

Minimal Reachability is Hard to Approximate
by: Jadbabaie, A, et al.
Published: (2023)

Guaranteed error bounds for structured complexity reduction of biochemical networks.
by: Prescott, T, et al.
Published: (2012)

Applying abstract acceleration to (co−)reachability analysis of reactive programs
by: Schrammel, P, et al.
Published: (2012)

An adaptive algorithm for online time series segmentation with error bound guarantee
by: Xu, Z, et al.
Published: (2012)

On reachability for hybrid automata over bounded time
by: Brihaye, T, et al.
Published: (2011)

Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
by: Calcagno, C, et al.
Published: (2006)

Estimations of error bounds for neural-network function approximators.
by: Townsend, N, et al.
Published: (1999)

Computing CQ lower-bounds over OWL 2 through approximation to RSA: extended abstract
by: Igne, F, et al.
Published: (2021)

Continuous-Time Stochastic Games with Time-Bounded Reachability.
by: Brázdil, T, et al.
Published: (2009)

PID control of biochemical reaction networks
by: Whitby, M, et al.
Published: (2020)

PID control of biochemical reaction networks
by: Whitby, M, et al.
Published: (2021)

Sharp error bounds for Ritz vectors and approximate singular vectors
by: Nakatsukasa, Y
Published: (2020)

Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games
by: Jovanović, A, et al.
Published: (2013)

Robustness guarantees for Bayesian inference with Gaussian processes
by: Cardelli, L, et al.
Published: (2019)

Reachability Analysis for Annotated Code
by: Janota, M, et al.
Published: (2007)

Adversarial robustness guarantees for Gaussian processes
by: Patane, A, et al.
Published: (2022)

Error Bound for Hill-Function Approximations in a Class of Stochastic Transcriptional Network Models
by: Hirsch, Dylan, et al.
Published: (2023)

Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion Theory
by: Goyal, Vivek K., et al.
Published: (2011)

An improved error bound for reduced basis approximation of linear parabolic problems
by: Urban, Karsten, et al.
Published: (2015)

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability
by: Chen, Lijie, et al.
Published: (2022)

Adversarial robustness guarantees for classification with Gaussian Processes
by: Blaas, A, et al.
Published: (2020)

Statistical guarantees for the robustness of Bayesian neural networks
by: Cardelli, L, et al.
Published: (2019)

Functional Reachability
by: Ong, C, et al.
Published: (2009)