Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice
ACM Computing Surveys · 31.07.2023 · 55 (6) · 1-36
DOI: 10.1145/3534967 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Computing Surveys, online erschienen am 07.12.2022. Verfasst von Johan Arcile und 1 weiteren Autor:innen. Die Arbeit wurde bisher 26-mal zitiert (Crossref) und nennt 194 Literaturangaben. Gefördert von: ANR-NRF French-Singaporean research program ProMiS.
Abstract (Originalsprache)
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 over the past 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.
Förderung
- ANR-NRF French-Singaporean research program ProMiS
Zitieren
APA
Arcile, J., & André, É. (2023). Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice. ACM Computing Surveys, 55(6), 1-36. https://doi.org/10.1145/3534967
Vancouver
Arcile J, André É. Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice. ACM Computing Surveys. 2023;55(6):1-36. doi:10.1145/3534967
BibTeX
@article{Arcile2023,
author = {Arcile, Johan and André, Étienne},
title = {Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice},
journal = {ACM Computing Surveys},
year = {2023},
volume = {55},
number = {6},
pages = {1--36},
doi = {10.1145/3534967}
}
EUVIMED