Please use this identifier to cite or link to this item:
Title: Improving polygonal hybrid systems reachability analysis through the use of the phase portrait
Authors: Pace, Gordon J.
Schneider, Gerardo
Keywords: Machine theory
Kernel functions
Invariant subspaces
Issue Date: 2006
Publisher: University of Malta. Faculty of ICT
Citation: Pace, G. J., & Schneider, G. (2006). Improving polygonal hybrid systems reachability analysis through the use of the phase portrait. 4th Computer Science Annual Workshop (CSAW’06), Bighi. 1-11.
Abstract: Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant dierential inclusions. The computation of certain objects of the phase portrait of an SPDI, namely the viability, controllability, invariance kernels and semi-separatrix curves have been shown to be eciently decidable. On the other hand, although the reachability problem for SPDIs is known to be decidable, its complexity makes it unfeasible on large systems. We summarise our recent results on the use of the SPDI phase portraits for improving reachability analysis by (i) state-space reduction and (ii) decomposition techniques of the state space, enabling compositional parallelisation of the analysis. Both techniques contribute to increasing the feasability of reachability analysis on large SPDI systems.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
Proceedings of CSAW'06 - A14.pdf227.68 kBAdobe PDFView/Open

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.