| dc.contributor.author | Sandler, Andrei | |
| dc.contributor.author | Tveretina, Olga | |
| dc.contributor.editor | Bouyer, Patricia | |
| dc.contributor.editor | Orlandini, Andrea | |
| dc.contributor.editor | San Pietro, Pierluigi | |
| dc.date.accessioned | 2017-11-14T18:02:49Z | |
| dc.date.available | 2017-11-14T18:02:49Z | |
| dc.date.issued | 2017-09-06 | |
| dc.identifier.citation | Sandler , 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 . < https://arxiv.org/pdf/1709.02108.pdf > | |
| dc.identifier.citation | conference | |
| dc.identifier.uri | http://hdl.handle.net/2299/19522 | |
| dc.description | Andrei 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.abstract | We 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.extent | 14 | |
| dc.format.extent | 798873 | |
| dc.language.iso | eng | |
| dc.publisher | Electronic Proceedings in Theoretical Computer Science | |
| dc.relation.ispartof | Proceedings Eight International Symposium on Games, Automata, Logics and Formal Verification | |
| dc.subject | Hybrid systems, the reachability problem | |
| dc.title | ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems | en |
| dc.contributor.institution | School of Computer Science | |
| dc.contributor.institution | Biocomputation Research Group | |
| dc.identifier.url | http://eptcs.web.cse.unsw.edu.au/content.cgi?GANDALF2017 | |
| dc.identifier.url | https://arxiv.org/pdf/1709.02108.pdf | |
| rioxxterms.type | Other | |
| herts.preservation.rarelyaccessed | true | |
