Reasoning about Real-Time and Probability on Obstruction Logic

Jean Leneutre; Vadim Malvone; James Ortiz

Reasoning about Real-Time and Probability on Obstruction Logic

Institut Polytechnique de Paris

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

1 Citation (Scopus)

Résumé

This paper discusses Timed Obstruction Temporal Logic (TOTL) and Probabilistic Obstruction Temporal Logic (POTL), extensions of Obstruction Logic for systems with critical timing and probabilistic behavior. TOTL focuses on real-time system properties, while POTL handles uncertainty and stochastic events alongside temporal constraints. These logics are especially useful in cybersecurity, where both time and probability are crucial. We demonstrate their applicability through case studies in cybersecurity games based on attack graphs.

langue originale	Anglais
Pages (de - à)	268-278
Nombre de pages	11
journal	CEUR Workshop Proceedings
Volume	3883
état	Publié - 1 janv. 2024
Evénement	1st International Workshop on Artificial Intelligence for Climate Change, 12th Italian Workshop on Planning and Scheduling, 31st RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, and SPIRIT Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy, AI4CC-IPS-RCRA-SPIRIT 2024 - Bolzano, Italie Durée: 26 nov. 2024 → 28 nov. 2024

Contient cette citation

@article{e50fddbe1ef8458096ac5324e3705d00,

title = "Reasoning about Real-Time and Probability on Obstruction Logic",

abstract = "This paper discusses Timed Obstruction Temporal Logic (TOTL) and Probabilistic Obstruction Temporal Logic (POTL), extensions of Obstruction Logic for systems with critical timing and probabilistic behavior. TOTL focuses on real-time system properties, while POTL handles uncertainty and stochastic events alongside temporal constraints. These logics are especially useful in cybersecurity, where both time and probability are crucial. We demonstrate their applicability through case studies in cybersecurity games based on attack graphs.",

keywords = "Attack Graphs, Dynamic games, Markov Chain, Strategic Reasoning, Timed Systems",

author = "Jean Leneutre and Vadim Malvone and James Ortiz",

note = "Publisher Copyright: {\textcopyright} 2024 Copyright for this paper by its authors.; 1st International Workshop on Artificial Intelligence for Climate Change, 12th Italian Workshop on Planning and Scheduling, 31st RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, and SPIRIT Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy, AI4CC-IPS-RCRA-SPIRIT 2024 ; Conference date: 26-11-2024 Through 28-11-2024",

year = "2024",

month = jan,

day = "1",

language = "English",

volume = "3883",

pages = "268--278",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR-WS",

}

TY - JOUR

T1 - Reasoning about Real-Time and Probability on Obstruction Logic

AU - Leneutre, Jean

AU - Malvone, Vadim

AU - Ortiz, James

PY - 2024/1/1

Y1 - 2024/1/1

N2 - This paper discusses Timed Obstruction Temporal Logic (TOTL) and Probabilistic Obstruction Temporal Logic (POTL), extensions of Obstruction Logic for systems with critical timing and probabilistic behavior. TOTL focuses on real-time system properties, while POTL handles uncertainty and stochastic events alongside temporal constraints. These logics are especially useful in cybersecurity, where both time and probability are crucial. We demonstrate their applicability through case studies in cybersecurity games based on attack graphs.

AB - This paper discusses Timed Obstruction Temporal Logic (TOTL) and Probabilistic Obstruction Temporal Logic (POTL), extensions of Obstruction Logic for systems with critical timing and probabilistic behavior. TOTL focuses on real-time system properties, while POTL handles uncertainty and stochastic events alongside temporal constraints. These logics are especially useful in cybersecurity, where both time and probability are crucial. We demonstrate their applicability through case studies in cybersecurity games based on attack graphs.

KW - Attack Graphs

KW - Dynamic games

KW - Markov Chain

KW - Strategic Reasoning

KW - Timed Systems

M3 - Conference article

AN - SCOPUS:85214811775

SN - 1613-0073

VL - 3883

SP - 268

EP - 278

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

T2 - 1st International Workshop on Artificial Intelligence for Climate Change, 12th Italian Workshop on Planning and Scheduling, 31st RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, and SPIRIT Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy, AI4CC-IPS-RCRA-SPIRIT 2024

Y2 - 26 November 2024 through 28 November 2024

ER -

Reasoning about Real-Time and Probability on Obstruction Logic

Résumé

Empreinte digitale

Contient cette citation