Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools

Authors:
Eugene Asarin;Gordon Pace;Gerardo Schneider;Sergio Yovine
Affiliations:
LIAFA, Case 7014, 2 pl. Jussieu, 75251 Paris Cedex 5, France;Department of Computer Science and AI, University of Malta, Msida, Malta;Department of Informatics, University of Oslo, P.O. Box 1080 Blindern, NO-0316 Oslo, Norway;CNRS-VERIMAG, Centre Equation, 2 Ave. Vignate, 38610 Gières, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 17
Cited 0

A survey of viability theory

SIAM Journal on Control and Optimization
An introduction to functional programming

An introduction to functional programming
A theory of timed automata

Theoretical Computer Science
What's decidable about hybrid automata?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Stability of hybrid systems

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
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 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
HYTECH: the next generation

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Computing invariance kernels of polygonal hybrid systems

Nordic Journal of Computing
Algorithmic analysis of polygonal hybrid systems, part I: Reachability

Theoretical Computer Science
Static analysis for state-space reduction of polygonal hybrid systems

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A compositional algorithm for parallel model checking of polygonal hybrid systems

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

Polygonal differential inclusion 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 is decidable. In this paper we show how to compute the viability, controllability and invariance kernels, as well as semi-separatrix curves for SPDIs. We also present the tool SPeeDI^+, which implements a reachability algorithm and computes phase portraits of SPDIs.