Relaxing goodness is still good for SPDIs

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Relaxing goodness is still good for SPDIs
Συγγραφείς: Pace, Gordon J., Schneider, Gerardo
Στοιχεία εκδότη: University of Oslo. Department of Informatics
Έτος έκδοσης: 2008
Συλλογή: University of Malta: OAR@UM / L-Università ta' Malta
Θεματικοί όροι: Computational complexity, Parallel programs (Computer programs) -- Verification, Machine design -- Congresses
Περιγραφή: 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. ; peer-reviewed
Τύπος εγγράφου: report
Γλώσσα: English
Relation: Pace, G. J., & Schneider, G. (2008). Relaxing goodness is still good for SPDIs. (No. 372). Oslo.; https://www.um.edu.mt/library/oar//handle/123456789/24159
Διαθεσιμότητα: https://www.um.edu.mt/library/oar//handle/123456789/24159
Rights: info:eu-repo/semantics/openAccess ; The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder
Αριθμός Καταχώρησης: edsbas.623829A4
Βάση Δεδομένων: BASE