Publikation:

JuliaReach : a Toolbox for Set-Based Reachability

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2019

Autor:innen

Bogomolov, Sergiy
Forets, Marcelo
Frehse, Goran
Potomkin, Kostiantyn

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1145/3302504.3311804
ArXiv-ID
http://arxiv.org/abs/1901.10736v2

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

OZAY, Necmiye, ed., Pavithra PRABHAKAR, ed.. HSCC '19: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control. New York, NY: ACM, 2019, pp. 39-44. ISBN 978-1-4503-6282-5. Available under: doi: 10.1145/3302504.3311804

Zusammenfassung

We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

HSCC '19 : 22nd ACM International Conference on Hybrid Systems: Computation and Control, 16. Apr. 2019 - 18. Apr. 2019, Montreal, Quebec, Canada
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BOGOMOLOV, Sergiy, Marcelo FORETS, Goran FREHSE, Kostiantyn POTOMKIN, Christian SCHILLING, 2019. JuliaReach : a Toolbox for Set-Based Reachability. HSCC '19 : 22nd ACM International Conference on Hybrid Systems: Computation and Control. Montreal, Quebec, Canada, 16. Apr. 2019 - 18. Apr. 2019. In: OZAY, Necmiye, ed., Pavithra PRABHAKAR, ed.. HSCC '19: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control. New York, NY: ACM, 2019, pp. 39-44. ISBN 978-1-4503-6282-5. Available under: doi: 10.1145/3302504.3311804
BibTex
@inproceedings{Bogomolov2019-01-30T10:02:35ZJulia-53625,
  year={2019},
  doi={10.1145/3302504.3311804},
  title={JuliaReach : a Toolbox for Set-Based Reachability},
  isbn={978-1-4503-6282-5},
  publisher={ACM},
  address={New York, NY},
  booktitle={HSCC '19: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control},
  pages={39--44},
  editor={Ozay, Necmiye and Prabhakar, Pavithra},
  author={Bogomolov, Sergiy and Forets, Marcelo and Frehse, Goran and Potomkin, Kostiantyn and Schilling, Christian}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/53625">
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53625"/>
    <dc:contributor>Forets, Marcelo</dc:contributor>
    <dc:contributor>Frehse, Goran</dc:contributor>
    <dc:creator>Potomkin, Kostiantyn</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Potomkin, Kostiantyn</dc:contributor>
    <dc:creator>Bogomolov, Sergiy</dc:creator>
    <dc:contributor>Schilling, Christian</dc:contributor>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Frehse, Goran</dc:creator>
    <dc:contributor>Bogomolov, Sergiy</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Forets, Marcelo</dc:creator>
    <dcterms:abstract xml:lang="eng">We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems.</dcterms:abstract>
    <dcterms:title>JuliaReach : a Toolbox for Set-Based Reachability</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-07T12:26:45Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-07T12:26:45Z</dcterms:available>
    <dc:creator>Schilling, Christian</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2019-01-30T10:02:35Z</dcterms:issued>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen