A master thesis from Aalborg University
Controller Synthesis by Solving Multi Weighted Games
Author(s)
Term
3. term
Education
Publication year
2016
Submitted on
2016-12-20
Pages
62 pages
Abstract
Controller synthesis is investigated through a game theoretic view. In the context of games, synthesis is the extraction of a winning strategy. We investigate multi-weighted games, and various strategy types. We hierarchically order these strategy types by expressiveness. We also present a weighted computation tree logic, for which we provide an undecidability result, and a decidable sub-logic, limited to reachability with upper bounds. Further more we provide complexity results for the synthesis problem with the reachability sub-logic. We present two methods for synthesis of strategies in 1-weighted games: We extend the attractor set method with weights giving a global algorithm with polynomial time complexity. And we also show how a strategy can be extracted using prefixed-point assignment of a symbolic dependency graph.
Keywords
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.