When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICCSW.2012.42
URN: urn:nbn:de:0030-drops-37638
Go to the corresponding OASIcs Volume Portal

Denman, William

Abstracting Continuous Nonpolynomial Dynamical Systems

8.pdf (0.7 MB)


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.

BibTeX - Entry

  author =	{William  Denman},
  title =	{{Abstracting Continuous Nonpolynomial Dynamical Systems}},
  booktitle =	{2012 Imperial College Computing Student Workshop},
  pages =	{42--48},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-48-4},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{28},
  editor =	{Andrew V. Jones},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-37638},
  doi =		{},
  annote =	{Keywords: Formal Verification, Automated Theorem Proving, Abstraction, Nonpolynomial System, MetiTarski}

Keywords: Formal Verification, Automated Theorem Proving, Abstraction, Nonpolynomial System, MetiTarski
Seminar: 2012 Imperial College Computing Student Workshop
Issue Date: 2012
Date of publication: 05.11.2012

DROPS-Home | Fulltext Search | Imprint Published by LZI