Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/24529
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Asarin, Eugene | - |
dc.contributor.author | Pace, Gordon J. | - |
dc.contributor.author | Schneider, Gerardo | - |
dc.contributor.author | Yovine, Sergio | - |
dc.date.accessioned | 2017-12-12T09:29:13Z | - |
dc.date.available | 2017-12-12T09:29:13Z | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | Asarin, E., Pace, G., Schneider, G., & Yovine, S. (2002). SPeeDI - a verification tool for polygonal hybrid systems. 14th International Conference on Computer Aided Verification, Copenhagen. 1-5. | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar//handle/123456789/24529 | - |
dc.description.abstract | Hybrid systems combining discrete and continuous dynamics arise as mathematical models of various artificial and natural systems, and as an approximation to complex continuous systems. A very important problem in the analysis of the behavior of hybrid systems is reachability. It is well-known that for most non-trivial subclasses of hybrid systems this and all interesting verification problems are undecidable. Most of the proved decidability results rely on stringent hypothesis that lead to the existence of a finite and computable partition of the state space into classes of states which are equivalent with respect to reachability. This is the case for classes of rectangular automata [1] and hybrid automata with linear vector fields [2]. Most implemented computational procedures resort to (forward or backward) propagation of constraints, typically (unions of convex) polyhedra or ellipsoids [3, 4, 5]. In general, these techniques provide semi-decision procedures, that is, if the given final set of states is reachable, they will terminate, otherwise they may fail to. Maybe the major drawback of set-propagation, reachset approximation procedures is that they pay little attention to the geometric properties of the specific (class of) systems under analysis. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | Springer, Berlin, Heidelberg | en_GB |
dc.rights | info:eu-repo/semantics/openAccess | en_GB |
dc.subject | Hybrid systems | en_GB |
dc.subject | Differential inclusions | en_GB |
dc.subject | Computer algorithms | en_GB |
dc.title | SPeeDI - a verification tool for polygonal hybrid systems | en_GB |
dc.type | conferenceObject | en_GB |
dc.rights.holder | 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 | en_GB |
dc.bibliographicCitation.conferencename | 14th International Conference on Computer Aided Verification | en_GB |
dc.bibliographicCitation.conferenceplace | Copenhagen, Denmark, 27-31/07/2002 | en_GB |
dc.description.reviewed | peer-reviewed | en_GB |
dc.identifier.doi | 10.1007/3-540-45657-0_28 | - |
Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SPeeDI_-_A_Verification_Tool_for_Polygonal_Hybrid_.pdf | 95.44 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.