Deciding reachability for planar multi-polynomial systems (1996)
| Venue: | In Hybrid Systems III, LNCS 1066 |
| Citations: | 13 - 0 self |
BibTeX
@INPROCEEDINGS{Cerans96decidingreachability,
author = {Karlis Cerans and Juris V Ksna},
title = {Deciding reachability for planar multi-polynomial systems},
booktitle = {In Hybrid Systems III, LNCS 1066},
year = {1996},
pages = {389--400},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
Citations
| 1659 | A Theory of Timed Automata - Alur, Dill - 1994 |
| 514 | The algorithmic analysis of hybrid systems - Alur, Courcoubetis, et al. - 1995 |
| 234 | What’s decidable about hybrid automata - Henzinger, Kopke, et al. - 1995 |
| 92 | Algorithmic analysis of nonlinear hybrid systems - Henzinger, Ho, et al. - 1998 |
| 80 | Effective Polynomial Computation - Zippel - 1993 |
| 59 | Decidability of bisimulation equivalences for parallel timer processes - Cerans - 1993 |
| 52 | Hybrid automata with finite bisimulations - Henzinger |
| 30 | On some relations between dynamical systems and transition systems, in - Asarin, Maler - 1994 |
| 25 | Reachability analysis of planar multi-linear systems, in - Maler, Pnueli - 1993 |
| 10 | and D.Dill. Automata for modelling real time systems - Alur - 1990 |
| 9 | Algorithmic Problems in Analysis of Real Time System Specifications. Dr. sc - Cerans - 1992 |
| 9 | Hybrid automata with �nite bisimulations - Henzinger - 1994 |
