Deciding reachability for planar multi-polynomial systems
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 389-400
- https://doi.org/10.1007/bfb0020962
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Automata for modeling real-time systemsPublished by Springer Nature ,2005
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- What's decidable about hybrid automata?Published by Association for Computing Machinery (ACM) ,1995
- Hybrid automata with finite bisimulationsLecture Notes in Computer Science, 1995
- Algorithmic analysis of nonlinear hybrid systemsLecture Notes in Computer Science, 1995
- A theory of timed automataTheoretical Computer Science, 1994
- On some relations between dynamical systems and transition systemsLecture Notes in Computer Science, 1994
- Reachability analysis of planar multi-linear systemsLecture Notes in Computer Science, 1993
- Decidability of bisimulation equivalences for parallel timer processesLecture Notes in Computer Science, 1993
- Effective Polynomial ComputationPublished by Springer Nature ,1993