Comin, Carlo (2017) Complexity in Infinite Games on Graphs and Temporal Constraint Networks. PhD thesis, University of Trento, Université Paris-Est Marne-la-Vallée.
|PDF - Doctoral Thesis|
|PDF - Disclaimer |
Restricted to Repository staff only until 9999.
This dissertation deals with a number of algorithmic problems motivated by automated temporal planning and formal verification of reactive and finite state systems. Particularly, we shall focus on game theoretical methods in order to obtain improved complexity bounds and faster algorithms for the following models: Hyper Temporal Networks, Conditional Simple/Hyper Temporal Networks, Conditional Simple Temporal Networks with Instantaneous Reaction Time, Update Games, Explicit McNaughton-Muller Games, Mean Payoff Games.
|Item Type:||Doctoral Thesis (PhD)|
|Subjects:||Area 01 - Scienze matematiche e informatiche > INF/01 INFORMATICA|
Area 01 - Scienze matematiche e informatiche > MAT/09 RICERCA OPERATIVA
|Repository Staff approval on:||24 Mar 2017 09:30|
Repository Staff Only: item control page