Symbolic reachability computation of a class of nonlinear systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Reachability is recognized as a key problem in designing physical control systems (most are nonlinear systems) in formal method community. Issues related to stability and controllability of physical systems are well studied in control theory. However there are not many results on reachability of those systems and fewer on nonlinear systems in computer science yet. In this paper, we present the first known family of nonlinear systems with the decidable symbolic computation problem of their reachable state spaces at the best of our knowledge. This is approached by reducing reachability computation to semi-algebraic system solving. Furthermore we illustrate the application of our method by performing the Maple package DISCOVERER.

Original languageEnglish
Title of host publicationProceedings of the 2009 8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009
PublisherIEEE Computer Society
Pages706-710
Number of pages5
ISBN (Print)9780769536415
DOIs
StatePublished - 2009
Event8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009 - Shanghai, China
Duration: 1 Jun 20093 Jun 2009

Publication series

NameProceedings of the 2009 8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009

Conference

Conference8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009
Country/TerritoryChina
CityShanghai
Period1/06/093/06/09

Fingerprint

Dive into the research topics of 'Symbolic reachability computation of a class of nonlinear systems'. Together they form a unique fingerprint.

Cite this