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

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.

[1]  Gordon J. Pace,et al.  A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems , 2006, ICTAC.

[2]  Jean-Pierre Aubin,et al.  Towards a viability theory of hybrid systems , 2001, 2001 European Control Conference (ECC).

[3]  Peter G. Harrison,et al.  Functional Programming , 1988 .

[4]  Amir Pnueli,et al.  Reachability Analysis of Planar Multi-limear Systems , 1993, CAV.

[5]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[6]  Richard S. Bird,et al.  Introduction to functional programming , 1988, Prentice Hall International series in computer science.

[7]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[8]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[9]  Mario di Bernardo,et al.  On a Novel Class of Bifurcations in Hybrid Dynamical Systems , 2001, HSCC.

[10]  Patrick Saint-Pierre.  Hybrid Kernels and Capture Basins for Impulse Constrained Systems , 2002, HSCC.

[11]  J. Aubin.  A survey of viability theory , 1990 .

[12]  P.V. Zhivoglyadov,et al.  On stability in hybrid systems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[13]  Sergio Yovine,et al.  Towards Computing Phase Portraits of Polygonal Differential Inclusions , 2002, HSCC.

[14]  José Carlos Goulart de Siqueira,et al.  Differential Equations , 1919, Nature.

[15]  Gordon J. Pace,et al.  Static Analysis for State-Space Reduction of Polygonal Hybrid Systems , 2006, FORMATS.

[16]  Pravin Varaiya,et al.  Viable Control of Hybrid Systems , 1994, Hybrid Systems.

[17]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[18]  Karl Henrik Johansson,et al.  Towards a Geometric Theory of Hybrid Systems , 2000, HSCC.

[19]  Jean-Pierre Aubin,et al.  Viability and invariance kernels of impulse differential inclusions , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[20]  Sergio Yovine,et al.  Algorithmic analysis of polygonal hybrid systems, part I: Reachability , 2007, Theor. Comput. Sci..

[21]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[22]  Sergio Yovine,et al.  On the Decidability of the Reachability Problem for Planar Differential Inclusions , 2001, HSCC.

[23]  Olaf Chitil,et al.  Functional Programming , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[24]  Gerardo Schneider,et al.  Computing Invariance Kernels of Polygonal Hybrid Systems , 2004, Nord. J. Comput..

[25]  Gerardo Lafferriere,et al.  Symbolic Reachability Computation for Families of Linear Vector Fields , 2001, J. Symb. Comput..

[26]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[27]  Perdita Stevens,et al.  Functional programming languages for verification tools: experiences with ML and Haskell , 2001 .

[28]  Gordon J. Pace,et al.  SPeeDI - A Verification Tool for Polygonal Hybrid Systems , 2002, CAV.

[29]  Thomas A. Henzinger,et al.  HYTECH: the next generation , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[30]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..