Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/24159| Title: | Relaxing goodness is still good for SPDIs |
| Authors: | Pace, Gordon J. Schneider, Gerardo |
| Keywords: | Computational complexity Parallel programs (Computer programs) -- Verification Machine design -- Congresses |
| Issue Date: | 2008 |
| Publisher: | University of Oslo. Department of Informatics |
| Citation: | Pace, G. J., & Schneider, G. (2008). Relaxing goodness is still good for SPDIs. (No. 372). Oslo. |
| 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 goodness 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 generalised SPDIs (GSPDI), SPDIs not satisfying the goodness property, and give an algorithmic solution to decide reachability of such systems. |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/24159 |
| Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Relaxing_goodness_is_still_good_for_SPDIs.pdf | 371.28 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.