Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis

DOI10.1007/978-3-319-99154-2_7arXiv1807.06888MaRDI QIDQ6104803

Andrea Vandin, Mirco Tribastone, Max Tschaikowski, Luca Cardelli

Publication date: 28 June 2023

Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.06888

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Numerical methods for ordinary differential equations (65Lxx)

Related Items (6)

Formal lumping of polynomial differential equations through approximate equivalences ⋮ An algorithm for the formal reduction of differential equations as over-approximations ⋮ Approximate constrained lumping of polynomial differential equations ⋮ A large-scale assessment of exact lumping of quantitative models in the biomodels repository ⋮ Symbolic computation of differential equivalences ⋮ Logical characterization of fluid equivalences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tackling continuous state-space explosion in a Markovian process algebra
• Model-order reduction of ion channel dynamics using approximate bisimulation
• Bisimulation through probabilistic testing
• Quadratic programming with one negative eigenvalue is NP-hard
• Adaptive aggregation of Markov chains: quantitative analysis of chemical reaction networks
• Formal molecular biology
• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
• Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
• A Language for Biochemical Systems: Design and Formal Specification
• Optimal partition and effective dynamics of complex networks
• Systematic Simulation Using Sensitivity Analysis
• The polynomial solvability of convex quadratic programming

This page was built for publication: Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis