A Timed Obstruction Logic for Dynamic Game Models

Securing computational systems within vital infrastructures, such as healthcare, aviation, and energy grids, against malicious attacks is an increasingly difficult challenge. Specially, provably secure systems are often required given the strict guarantees provided by formal methods. However, adversarial threats faced by these critical systems are highly sophisticated, needing verification methods that account for temporal constraints and dynamic interactions. While Timed Game Theory has recently emerged as a robust theoretical foundation for modeling attacker-defender dynamics, it often lacks the expressive power to capture complex real-time properties without prohibitive computational costs. In this paper, we introduce Timed Obstruction Logic (TOL), an extension of Obstruction Logic (OL) for verifying timed games with real-time objectives in dynamic models. TOL formally defines interactions where players’ actions influence the underlying system model, capturing essential timed properties required for cyber defense. Furthermore, we propose and implement a PSPACE-complete verification algorithm for TOL, achieving significantly higher expressiveness without exceeding the complexity bounds of classical timed temporal logics. Finally, we benchmarked our implementation against multiple case studies, confirming its potential viability for verifying real-time constraints in cybersecurity scenarios.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Software Engineering and Methodology
Published
2026-11-14
DOI
https://doi.org/10.1145/3862478
Citations
1
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
2.37
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Timed Obstruction Logic for Dynamic Game Models

Vadim Malvone, James Ortiz, David Cortés, Jean Leneutre
1 citations
ACM Transactions on Software Engineering and Methodology
Formal Methods in Verification
2.37
article

A Timed Obstruction Logic for Dynamic Game Models

Vadim Malvone, James Ortiz, David Cortés, Jean Leneutre
article en
1 citations

Abstract

Securing computational systems within vital infrastructures, such as healthcare, aviation, and energy grids, against malicious attacks is an increasingly difficult challenge. Specially, provably secure systems are often required given the strict guarantees provided by formal methods. However, adversarial threats faced by these critical systems are highly sophisticated, needing verification methods that account for temporal constraints and dynamic interactions. While Timed Game Theory has recently emerged as a robust theoretical foundation for modeling attacker-defender dynamics, it often lacks the expressive power to capture complex real-time properties without prohibitive computational costs. In this paper, we introduce Timed Obstruction Logic (TOL), an extension of Obstruction Logic (OL) for verifying timed games with real-time objectives in dynamic models. TOL formally defines interactions where players’ actions influence the underlying system model, capturing essential timed properties required for cyber defense. Furthermore, we propose and implement a PSPACE-complete verification algorithm for TOL, achieving significantly higher expressiveness without exceeding the complexity bounds of classical timed temporal logics. Finally, we benchmarked our implementation against multiple case studies, confirming its potential viability for verifying real-time constraints in cybersecurity scenarios.

ACM Transactions on Software Engineering and Methodology
Télécom Paris (FR), Université Paris-Est Créteil (FR), Institut Polytechnique de Paris (FR), Laboratoire Traitement et Communication de l’Information (FR)
Peace, justice, and strong institutions
Openalex Percentile: Top 20%
Formal Methods in Verification
2.37
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon