Back to results
Università degli studi di Trento
Complexity in Infinite Games on Graphs and Temporal Constraint Networks
Abstract
dc:descriptionThis 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.
Degree
thesis:*- Grantor dc:publisher
- Università degli studi di Trento
- Year dc:date
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Comin, Carlo
- Contributors dc:contributor
-
- Rizzi, Romeo
Subjects
dc:subject × 2Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- license:Tutti i diritti riservati (All rights reserved)
- license uri:iris.PRI01
- Language dc:language
- eng
Identifiers
dc:identifier.*- OAI identifier oai:identifier
- oai:iris.unitn.it:11572/368151