Abstracting Continuous Nonpolynomial Dynamical Systems

Author William Denman

Thumbnail PDF


  • Filesize: 0.68 MB
  • 7 pages

Document Identifiers

Author Details

William Denman

Cite AsGet BibTex

William Denman. Abstracting Continuous Nonpolynomial Dynamical Systems. In 2012 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 28, pp. 42-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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.
  • Formal Verification
  • Automated Theorem Proving
  • Abstraction
  • Nonpolynomial System
  • MetiTarski


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads