Signal Sampling and Optimisation Under Symbolic Timed Automata Constraints

  • Benoît Barbot (Autor:in und Vortragende:r)
  • , Nicolas Basset
  • , Thao Dang
  • , Alexandre Donzé
  • , Marco Esposito
  • , Dejan Nickovic

Publikation: Beitrag in Buch oder TagungsbandVortrag mit Beitrag in TagungsbandBegutachtung

Abstract

We consider the problem of generating input signals for validation of cyber-physical systems. The class of signals that we are interested in is subject to complex constraints in both time and value domains, which are captured by Symbolic Timed Automata (STA). We propose a method for uniform sampling of traces recognised by STA. The proposed procedure is general and works for arbitrary alphabets equipped with a probability space and a computable measure. We devise a concrete method for linear alphabets. We then show how this method can be used to enhance falsification based on both sampling and optimisation. The results are validated on the case study of an artificial pancreas.
OriginalspracheEnglisch
TitelQuantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems - Second International Joint Conference, QEST+FORMATS 2025, Aarhus, Denmark, August 26-28, 2025, Proceedings
UntertitelSecond International Joint Conference, QEST+FORMATS 2025, Aarhus, Denmark, August 26–28, 2025, Proceedings
Redakteure/-innenPavithra Prabhakar, Andrea Vandin
Herausgeber (Verlag)Springer
Seiten95-114
Seitenumfang20
Band16143
ISBN (elektronisch)978-3-032-05792-1
ISBN (Print)978-3-032-05791-4
DOIs
PublikationsstatusVeröffentlicht - 2025

Publikationsreihe

NameLecture Notes in Computer Science
Herausgeber (Verlag)Springer

Research Field

  • Dependable Systems Engineering

Fingerprint

Untersuchen Sie die Forschungsthemen von „Signal Sampling and Optimisation Under Symbolic Timed Automata Constraints“. Zusammen bilden sie einen einzigartigen Fingerprint.

Diese Publikation zitieren