Communication Dans Un Congrès Année : 2026

Signal Sampling and Optimisation under Symbolic Timed Automata Constraints

Résumé

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.

Fichier principal
Vignette du fichier
Sampling_Symbolic_Timed_Automata-2.pdf (564.73 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05326434 , version 1 (22-10-2025)

Licence

Identifiants

Citer

Benoît Barbot, Nicolas Basset, Thao Dang, Alexandre Donzé, Marco Esposito, et al.. Signal Sampling and Optimisation under Symbolic Timed Automata Constraints. Second International Joint Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems (QEST+FORMATS 2025), Aug 2025, Aahrus, Denmark. pp.95-114, ⟨10.1007/978-3-032-05792-1_6⟩. ⟨hal-05326434⟩
660 Consultations
160 Téléchargements

Altmetric

Partager

  • More