Please use this identifier to cite or link to this item:
Title: Relaxing goodness is still good
Authors: Pace, Gordon J.
Schneider, Gerardo
Keywords: Computational complexity
Parallel programs (Computer programs) -- Verification
Machine design -- Congresses
Issue Date: 2008
Publisher: Springer-Verlag Berlin, Heidelberg
Citation: Pace, G. J., & Schneider, G. (2008). Relaxing goodness is still good. 5th International Colloquium on Theoretical Aspects of Computing, Istanbul. 1-19.
Abstract: Polygonal hybrid systems (SPDIs) are planar hybrid systems, whose dynamics are defined in terms of constant differential inclusions, one for each of a number of polygonal regions partitioning the plane. The reachability problem for SPDIs is known to be decidable, but depends on the <em>goodness</em>assumption -- which states that the dynamics do not allow a trajectory to both enter and leave a region through the same edge. In this paper we extend the decidability result to <em>generalised SPDIs</em>(GSPDI), SPDIs not satisfying the goodness assumption, and give an algorithmic solution to decide reachability of such systems.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
Relaxing_Goodness_Is_Still_Good.pdf233.15 kBAdobe PDFView/Open

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