REAL

Towards Reliable Benchmarks of Timed Automata

Farkas, Rebeka and Bergmann, Gábor (2018) Towards Reliable Benchmarks of Timed Automata. In: Proceedings of the 25th PhD Mini-Symposium. BME MIT, Budapest, pp. 20-23. ISBN 978-963-313-285-2

[img]
Preview
Text
document.pdf

Download (247kB) | Preview

Abstract

The verification of the time-dependent behavior of safety-critical systems is important, as design problems often arise from complex timing conditions. One of the most common formalisms for modeling timed systems is the timed automaton, which introduces clock variables to represent the elapse of time. Various tools and algorithms have been developed for the verification of timed automata. However, it is hard to decide which one to use for a given problem as no exhaustive benchmark of their effectiveness and efficiency can be found in the literature. Moreover, there does not exist a public set of models that can be used as an appropriate benchmark suite. In our work we have collected publicly available timed automaton models and industrial case studies and we used them to compare the efficiency of the algorithms implemented in the Theta model checker. In this paper, we present our preliminary benchmark suite, and demonstrate the results of the performed measurements.

Item Type: Book Section
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 07 May 2018 13:07
Last Modified: 07 May 2018 13:07
URI: http://real.mtak.hu/id/eprint/79561

Actions (login required)

Edit Item Edit Item