2026-09-20T03:48:29Zhttps://iris.unitn.it/oai/requestoai:iris.unitn.it:11572/3681512026-04-03T00:50:04Zcom_11572_237821com_11572_101871col_11572_237822ou_ou00004
Complexity in Infinite Games on Graphs and Temporal Constraint Networks
Comin, Carlo
Comin, Carlo
Rizzi, Romeo
Settore INF/01 - Informatica
Settore MAT/09 - Ricerca Operativa
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.
2017
info:eu-repo/semantics/doctoralThesis
https://hdl.handle.net/11572/368151
http://dx.doi.org/10.15168/11572_368151
10.15168/11572_368151
eng
firstpage:1
lastpage:265
numberofpages:265
info:eu-repo/semantics/openAccess
Università degli studi di Trento
place:TRENTO
license:Tutti i diritti riservati (All rights reserved)
license:Tutti i diritti riservati (All rights reserved)
license uri:iris.PRI01