Runtime Verification with Imperfect Information Through Indistinguishability Relations - Télécom Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Runtime Verification with Imperfect Information Through Indistinguishability Relations

Résumé

Software systems are hard to trust, especially when autonomous. To overcome this, formal verification techniques can be deployed to verify such systems behave as expected. Runtime Verification is one of the most prominent and lightweight approaches to verify the system behaviour at execution time. However, standard Runtime Verification is built on the assumption of perfect information over the system, that is, the monitor checking the system can perceive everything. Unfortunately, this is not always the case, especially when the system under analysis contains rational/autonomous components and is deployed in real-world environments with possibly faulty sensors. In this work, we present an extension of the standard Runtime Verification of Linear Temporal Logic properties to consider scenarios with imperfect information. We present the engineering steps necessary to update the verification pipeline, and we report the corresponding implementation when applied to a case study involving robotic systems.
Fichier non déposé

Dates et versions

hal-04336329 , version 1 (11-12-2023)

Identifiants

Citer

Angelo Ferrando, Vadim Malvone. Runtime Verification with Imperfect Information Through Indistinguishability Relations. SEFM 2022: 20th International Conference on Software Engineering and Formal Methods, Institute of Computer Science of Humboldt University Berlin (DE); School of Electronic and Information Engineering of Beijing Jiaotong University (CN), Sep 2022, Berlin, Germany. pp.335-351, ⟨10.1007/978-3-031-17108-6_21⟩. ⟨hal-04336329⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More