Theoretical Computer Science
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation
Qualitative Theory of Hybrid Dynamical Systems
Qualitative Theory of Hybrid Dynamical Systems
Viable Control of Hybrid Systems
Hybrid Systems II
Towards a Geometric Theory of Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
The Substratum of Impulse and Hybrid Control Systems
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
On the Decidability of the Reachability Problem for Planar Differential Inclusions
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Towards Computing Phase Portraits of Polygonal Differential Inclusions
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Hybrid Kernels and Capture Basins for Impulse Constrained Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
SPeeDI - A Verification Tool for Polygonal Hybrid Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Reachability Analysis of Planar Multi-limear Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Computing invariance kernels of polygonal hybrid systems
Nordic Journal of Computing
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Theoretical Computer Science
Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools
Theoretical Computer Science
Relaxing Goodness Is Still Good
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
GSPeeDI --- A Verification Tool for Generalized Polygonal Hybrid Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Computation and visualisation of phase portraits for model checking SPDIs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as the computation of certain objects of the phase portrait, namely the viability, controllability and invariance kernels, for such systems is decidable. In this paper we show how to compute another object of an SPDI phase portrait, namely semi-separatrix curves and show how the phase portrait can be used for reducing the state-space for optimizing the reachability analysis.