{"id":{"repo_id":"trento","oai_identifier":"oai:iris.unitn.it:11572/368151"},"canonical_url":"https://search.dev.ndltd.org/etd/trento/oai:iris.unitn.it:11572/368151","repository":{"repo_id":"trento","name":"Università degli Studi di Trento","base_url":"https://iris.unitn.it/oai/request"},"display":{"title":"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. 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.","abstract_html":"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.","abstract_has_math":false,"creators":["Comin, Carlo"],"institution":"Università degli studi di Trento","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Rizzi, Romeo"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-24T05:04:28Z","subjects":["Settore INF/01 - Informatica","Settore MAT/09 - Ricerca Operativa"],"languages":["eng"],"rights":["info:eu-repo/semantics/openAccess","license:Tutti i diritti riservati (All rights reserved)","license uri:iris.PRI01"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["http://dx.doi.org/10.15168/11572_368151","10.15168/11572_368151"],"render_values":[{"text":"http://dx.doi.org/10.15168/11572_368151","href":"http://dx.doi.org/10.15168/11572_368151","code":true},{"text":"10.15168/11572_368151","href":"https://doi.org/10.15168/11572_368151","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/11572/368151","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Comin, Carlo","Rizzi, Romeo"]},{"key":"dc:creator","label":"Author","values":["Comin, Carlo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017"]},{"key":"dc:publisher","label":"Institution","values":["Università degli studi di Trento","place:TRENTO"]},{"key":"dc:relation","label":"Dc Relation","values":["firstpage:1","lastpage:265","numberofpages:265"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/doctoralThesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Settore INF/01 - Informatica","Settore MAT/09 - Ricerca Operativa"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess","license:Tutti i diritti riservati (All rights reserved)","license uri:iris.PRI01"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/11572/368151","http://dx.doi.org/10.15168/11572_368151","10.15168/11572_368151"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:title","label":"Title","values":["Complexity in Infinite Games on Graphs and Temporal Constraint Networks"]}]}],"canonical_facts":{"dc:contributor":["Comin, Carlo","Rizzi, Romeo"],"dc:creator":["Comin, Carlo"],"dc:date":["2017"],"dc:description":["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."],"dc:identifier":["https://hdl.handle.net/11572/368151","http://dx.doi.org/10.15168/11572_368151","10.15168/11572_368151"],"dc:language":["eng"],"dc:publisher":["Università degli studi di Trento","place:TRENTO"],"dc:relation":["firstpage:1","lastpage:265","numberofpages:265"],"dc:rights":["info:eu-repo/semantics/openAccess","license:Tutti i diritti riservati (All rights reserved)","license uri:iris.PRI01"],"dc:subject":["Settore INF/01 - Informatica","Settore MAT/09 - Ricerca Operativa"],"dc:title":["Complexity in Infinite Games on Graphs and Temporal Constraint Networks"],"dc:type":["info:eu-repo/semantics/doctoralThesis"]},"updated_at":"2026-07-24T05:04:28Z"}