Implicit semi-algebraic abstraction for polynomial dynamical systems

DOI10.1007/978-3-030-81685-8_25zbMATH Open1493.68217OpenAlexW3186194270MaRDI QIDQ832202FDOQ832202

Ahmed Irfan, Alberto Griggio, Alessandro Cimatti, Stefano Tonetta, Sergio Mover

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81685-8_25

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• The MathSAT5 SMT Solver
• Differential dynamic logic for hybrid systems
• Integrability and nonintegrability of dynamical systems
• Infinite-state invariant checking with IC3 and predicate abstraction
• Predicate abstraction for software verification
• Computing differential invariants of hybrid systems as fixed points
• Abstractions for hybrid systems
• Computer Aided Verification
• Barrier certificates for nonlinear model validation
• Exponential-Condition-Based Barrier Certificate Generation for Safety Verification of Hybrid Systems
• KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems
• A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets
• A Method for Invariant Generation for Polynomial Continuous Systems
• Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions

Cited In (2)

• Abstract simulation of reaction networks via Boolean networks
• Algorithms for exact and approximate linear abstractions of polynomial continuous systems

Uses Software

• SymPy
• KeYmaera
• z3
• MathSAT5
• PySMT
• CTIGAR
• KeYmaera X

This page was built for publication: Implicit semi-algebraic abstraction for polynomial dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832202)