RealySt: A C++ Tool for Optimizing Reachability Probabilities in Stochastic Hybrid Systems

Delicaris, Joanna; Stübbe, Jonas; Schupp, Stefan; Remke, Anne

Research article in edited proceedings (conference) | Peer reviewed

Abstract

This paper presents the open-source C++ tool RealySt for effectively computing optimal time-bounded reachability probabilities for subclasses of hybrid automata extended with random clocks. The tool explicitly resolves the underlying nondeterminism and computes reachable state sets exactly. The error of the computed results solely stems from the multi-dimensional integration. The architecture of RealySt is extensible and allows to easily integrate other classes of hybrid automata extended by random clocks. RealySt relies on the HyPro library to perform flowpipe construction, and on GSL for multi-dimensional integration.

Details about the publication

PublisherKalyvianaki, Evangelia; Paolieri, Marco
Book titlePerformance Evaluation Methodologies and Tools
Page range170-182
Publishing companySpringer
Place of publicationCham
Title of seriesLecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Volume of series539
StatusPublished
Release year2024 (03/01/2024)
Language in which the publication is writtenEnglish
ConferenceVALUETOOLS 2023, Heraklion, Greece
ISBN978-3-031-48885-6
DOI10.1007/978-3-031-48885-6_11
Link to the full texthttps://doi.org/10.1007/978-3-031-48885-6_11
KeywordsTool; (Optimal) reachability probabilities; Stochastic hybrid automata

Authors from the University of Münster

Delicaris, Joanna Georgia
Professorship for practical computer science (Prof. Remke)
Remke, Anne
Professorship for practical computer science (Prof. Remke)
Stübbe, Jonas
Professorship for practical computer science (Prof. Remke)