Timed Automata Verification and Synthesis via Finite Automata Learning - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Timed Automata Verification and Synthesis via Finite Automata Learning

Abstract

We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a large finite-state machine and a relatively smaller timed automaton, and using compositional reasoning on this composition. We use automata learning algorithms to learn finite automata approximations of the timed automaton component, in order to reduce the problem at hand to finite-state model checking or to finite-state controller synthesis. We present an experimental evaluation of our approach.
Fichier principal
Vignette du fichier
main.pdf (405.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03947462 , version 1 (19-01-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-03947462 , version 1

Cite

Ocan Sankur. Timed Automata Verification and Synthesis via Finite Automata Learning. TACAS 2023 - 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2023, Paris, France. pp.329-349. ⟨hal-03947462⟩
137 View
243 Download

Share

Gmail Facebook X LinkedIn More