Timed automata as a formalism for expressing security: A survey on theory and practice - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Computing Surveys Année : 2022

Timed automata as a formalism for expressing security: A survey on theory and practice

Résumé

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties. In this work, we review works studying security properties for timed automata in the last two decades. We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions. We derive main conclusions concerning open perspectives, as well as tool support.

Dates et versions

hal-03690234 , version 1 (08-06-2022)

Identifiants

Citer

Johan Arcile,, Étienne André. Timed automata as a formalism for expressing security: A survey on theory and practice. ACM Computing Surveys, 2022, ⟨10.1145/3534967⟩. ⟨hal-03690234⟩
22 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More