Show simple item record

dc.contributor.authorSandler, Andrei
dc.contributor.authorTveretina, Olga
dc.contributor.editorBouyer, Patricia
dc.contributor.editorOrlandini, Andrea
dc.contributor.editorSan Pietro, Pierluigi
dc.date.accessioned2017-11-14T18:02:49Z
dc.date.available2017-11-14T18:02:49Z
dc.date.issued2017-09-06
dc.identifier.citationSandler , A & Tveretina , O 2017 , ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems . in P Bouyer , A Orlandini & P San Pietro (eds) , Proceedings Eight International Symposium on Games, Automata, Logics and Formal Verification : GandALF 2017 . vol. 256 , Electronic Proceedings in Theoretical Computer Science , pp. 283-296 , 8th International Symposium on Games, Automata, Logics, and Formal Verification , Rome , Italy , 20/09/17 .
dc.identifier.citationconference
dc.identifier.otherPURE: 12763505
dc.identifier.otherPURE UUID: ea10b2e7-e2da-4e33-b187-cf5acd06bb9b
dc.identifier.urihttp://hdl.handle.net/2299/19522
dc.descriptionAndrei Sandler, and Olga Tveretina, ‘ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems’, in Patricia Bouyer, Andrea Orlandini and Pierluigi San Pietro, eds. Proceedings Eight International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2017), Rome, Italy, 20-22 September 2017, Electronic Proceedings in Theoretical Computer Science, Vol. 256: 283-296, September 2017. © 2017 The Author(s). This work is licensed under the Creative Commons Attribution License CC BY 4.0 https://creativecommons.org/licenses/by/4.0/
dc.description.abstractWe present the ParaPlan tool which provides the reachability analysis of planar hybrid systems defined by differential inclusions (SPDI). It uses the parallelized and optimized version of the algorithm underlying the SPeeDI tool. The performance comparison demonstrates the speed-up of up to 83 times with respect to the sequential implementation on various benchmarks. Some of the benchmarks we used are randomly generated with the novel approach based on the partitioning of the plane with Voronoi diagrams.en
dc.format.extent14
dc.language.isoeng
dc.publisherElectronic Proceedings in Theoretical Computer Science
dc.relation.ispartofProceedings Eight International Symposium on Games, Automata, Logics and Formal Verification
dc.rights/dk/atira/pure/core/openaccesspermission/open
dc.subjectHybrid systems, the reachability problem
dc.titleParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systemsen
dc.contributor.institutionSchool of Computer Science
dc.identifier.urlhttp://eptcs.web.cse.unsw.edu.au/content.cgi?GANDALF2017
dc.identifier.urlhttps://arxiv.org/pdf/1709.02108.pdf
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeFinal Published version
dcterms.dateAccepted2017-07-20
rioxxterms.versionVoR
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by/4.0/
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record