eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2012-11-09
42
48
10.4230/OASIcs.ICCSW.2012.42
article
Abstracting Continuous Nonpolynomial Dynamical Systems
Denman, William
The reachability problem, whether some unsafe state can be reached, is known to be undecidable for nonlinear dynamical systems. However, finite-state abstractions have successfully been used for safety verification. This paper presents a method for automatically abstracting nonpolynomial systems that do not have analytical or closed form solutions. The abstraction is constructed by splitting up the state-space using nonpolynomial Lyapunov functions. These functions place guarantees on the behaviour of the system without requiring the explicit calculation of trajectories. MetiTarski, an automated theorem prover for special functions (sin, cos, sqrt, exp) is used to identify possible transitions between the abstract states. The resulting finite-state system is perfectly suited for verification by a model checker.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol028-iccsw2012/OASIcs.ICCSW.2012.42/OASIcs.ICCSW.2012.42.pdf
Formal Verification
Automated Theorem Proving
Abstraction
Nonpolynomial System
MetiTarski