Skip to main navigation Skip to search Skip to main content

Deciding reachability for planar multi-polynomial systems

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

29 Citations (Scopus)

Abstract

In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a finite, number of (polyhedral) regions. To each of these regions is assigned some vector field which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.

Original languageEnglish
Title of host publicationHybrid Systems III - Verification and Control
EditorsRajeev Alur, Thomas A. Henzinger, Eduardo D. Sontag
PublisherSpringer Verlag
Pages389-400
Number of pages12
ISBN (Print)354061155X, 9783540611554
DOIs
Publication statusPublished - 1996
Event5th DIMACS/SYCON Workshop on Verification and Control of Hybrid Systems, 1995 - New Brunswick, United States
Duration: 22 Oct 199525 Oct 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1066
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th DIMACS/SYCON Workshop on Verification and Control of Hybrid Systems, 1995
Country/TerritoryUnited States
CityNew Brunswick
Period22/10/9525/10/95

Fingerprint

Dive into the research topics of 'Deciding reachability for planar multi-polynomial systems'. Together they form a unique fingerprint.

Cite this