Complexity in Infinite Games on Graphs and Temporal Constraint Networks

Abstract : This dissertation deals with a number of algorithmic problems motivated by automated temporal planning and formal verification of reactive and finite state systems. We focused on game theoretical methods to obtain novel insights, improved complexity bounds, and faster algorithms for the following models: Hyper Temporal Networks, Conditional Simple/Hyper Temporal Networks, Update Games, Muller McNaughton Games, and Mean Payoff Games
Document type :
Theses
Complete list of metadatas

Cited literature [119 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-01734870
Contributor : Abes Star <>
Submitted on : Thursday, March 15, 2018 - 10:40:07 AM
Last modification on : Friday, May 17, 2019 - 1:49:22 AM
Long-term archiving on : Monday, September 10, 2018 - 10:59:02 PM

File

TH2017PESC1061.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01734870, version 1

Citation

Carlo Comin. Complexity in Infinite Games on Graphs and Temporal Constraint Networks. Technology for Human Learning. Université Paris-Est; Università degli studi (Trente, Italie), 2017. English. ⟨NNT : 2017PESC1061⟩. ⟨tel-01734870⟩

Share

Metrics

Record views

134

Files downloads

79