Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/22556Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Pace, Gordon J. | - |
| dc.contributor.author | Schneider, Gerardo | - |
| dc.date.accessioned | 2017-10-13T11:55:11Z | - |
| dc.date.available | 2017-10-13T11:55:11Z | - |
| dc.date.issued | 2006 | - |
| dc.identifier.citation | Pace, G., & Schneider, G. (2006, November). A compositional algorithm for parallel model checking of polygonal hybrid systems. Third International Colloquium on Theoretical Aspects of Computing - ICTAC 2006, Tunis. 168-182. | en_GB |
| dc.identifier.isbn | 3540488154 | - |
| dc.identifier.isbn | 9783540488156 | - |
| dc.identifier.issn | 03029743 | - |
| dc.identifier.uri | https://www.um.edu.mt/library/oar//handle/123456789/22556 | - |
| dc.description.abstract | The reachability problem as well as the computation of the phase portrait for the class of planar hybrid systems defined by constant differential inclusions (SPDI), has been shown to be decidable. The existing reachability algorithm is based on the exploitation of topological properties of the plane which are used to accelerate certain kind of cycles. The complexity of the algorithm makes the analysis of large systems generally unfeasible. In this paper we present a compositional parallel algorithm for reachability analysis of SPDIs. The parallelization is based on the qualitative information obtained from the phase portrait of an SPDI, in particular the controllability kernel. | en_GB |
| dc.description.sponsorship | The United Nations Univ., Int. Inst. for Softw. Technol., Macau,Tunisian Ministry of Higher Education,University of New South Wales, UK | en_GB |
| dc.language.iso | en | en_GB |
| dc.publisher | Springer-Verlag Berlin Heidelberg | en_GB |
| dc.rights | info:eu-repo/semantics/openAccess | en_GB |
| dc.subject | Computational complexity | en_GB |
| dc.subject | Parallel programs (Computer programs) -- Verification | en_GB |
| dc.subject | Machine design -- Congresses | en_GB |
| dc.title | A compositional algorithm for parallel model checking of 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 | Third International Colloquium on Theoretical Aspects of Computing - ICTAC 2006 | en_GB |
| dc.bibliographicCitation.conferenceplace | Tunis, Tunisia, 20/24/11/2006 | en_GB |
| dc.description.reviewed | peer-reviewed | en_GB |
| Appears in Collections: | Scholarly Works - FacICTCS | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| A_Compositional_Algorithm_for_Parallel_Model_Check.pdf | 491.75 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.