Sciweavers

HYBRID
1995
Springer

Deciding Reachability for Planar Multi-polynomial Systems

14 years 4 months ago
Deciding Reachability for Planar Multi-polynomial Systems
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 nite number of (polyhedral) regions. To each of these regions is assigned some vector eld 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.
Karlis Cerans, Juris Viksna
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where HYBRID
Authors Karlis Cerans, Juris Viksna
Comments (0)