@comment{{This file has been generated by bib2bib 1.97}}
@comment{{Command line: bib2bib -c '$type = "PHDTHESIS" or $type = "MASTERSTHESIS"' -ob my-publications-Thesis.bib my-publications.bib}}
  abstract = {A {\em polygonal differential inclusion system} (SPDI) is a non-deterministic planar hybrid system which can be represented by piecewise constant differential inclusions. In this thesis we are concerned with several theoretical and practical questions related to SPDIs such as reachability analysis and phase portrait construction.
First we show that the reachability question for SPDIs is indeed decidable. Our procedure is not based on the computation of the reach-set but rather on the computation of the  limit of  individual trajectories. A key idea is the use of edge-to-edge  one-dimensional affine Poincar\'e maps, the fix-points of which are easily computed. By taking advantage of this information, cycles can be {\em accelerated} in most cases.
The above reachability algorithm has been implemented in a tool called SPeeDI.
We next build the phase portrait of such systems. In particular, we identify the \emph{viability} kernels of simple cycles. Such kernels are the set of starting points of trajectories that can keep rotating in the cycles forever. We also introduce the notion of \emph{controllability} kernel of simple cycles as the set of points such that any two points of the set are reachable from each other {\em via} trajectories that remain on the set. We give non-iterative algorithms to compute both kernels. We obtain the SPDI phase portrait computing all the viability and controllability kernels.
We finally study the decidability of the reachability problem for other 2-dimensional hybrid systems. We introduce {\em hierarchical piecewise constant derivative systems} (HPCDs) and {\em 2-dimensional manifolds with piecewise constant derivative systems}. We show that the reachability problem for the above two classes of systems is as hard as the reachability problem for {\em piecewise affine maps} that is known to be an open problem. We also show that the reachability question for slight extensions of HPCDs are undecidable.},
  address = {Grenoble, France},
  author = {Gerardo Schneider},
  month = {July},
  pdf = {PhDthesis.pdf},
  school = {VERIMAG -- UJF},
  title = {Algorithmic Analysis of Polygonal Hybrid Systems},
  year = {2002}
  address = {Porto Alegre, Brazil},
  author = {Gerardo Schneider},
  month = {March},
  note = {(In Portuguese)},
  pages = {144},
  ps = {},
  school = {CPGCC -- UFRGS},
  title = {Sequential and Parallel Computation Strategies on Coherence Spaces},
  year = {1996}

This file was generated by bibtex2html 1.97.