University of Hertfordshire

ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems

University of Hertfordshire Research Archive

Help | UH Research Archive

Show simple item record

contributor authorSandler, Andrei
contributor authorTveretina, Olga
contributor editorBouyer, Patricia
contributor editorOrlandini, Andrea
contributor editorSan Pietro, Pierluigi
date accessioned2017-11-14T18:02:49Z
date available2017-11-14T18:02:49Z
date issued2017-09-06
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-22 September .en
identifier citationconferenceen
identifier otherPURE: 12763505
identifier otherPURE UUID: ea10b2e7-e2da-4e33-b187-cf5acd06bb9b
identifier urihttp://hdl.handle.net/2299/19522
identifier urihttp://eptcs.web.cse.unsw.edu.au/content.cgi?GANDALF2017en
identifier urihttps://arxiv.org/pdf/1709.02108.pdfen
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/en
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
format extent14en
language isoeng
publisherElectronic Proceedings in Theoretical Computer Science
relation ispartofProceedings Eight International Symposium on Games, Automata, Logics and Formal Verificationen
rightsen
subjectHybrid systems, the reachability problemen
titleParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systemsen
typeConference paperen
contributor institutionSchool of Computer Scienceen
description versionpublishersversionen


This item appears in the following Collection(s)

Show simple item record

Your requested file is now available for download. You may start your download by selecting the following link: test