報告題目：Reachability in Fuzzy Game Graphs

報告人: 潘海玉

講座日期：2021-9-17

講座時間：15:00

報告地點：騰訊會議ID：121181901

主辦單位：數(shù)學與統(tǒng)計學院

講座人簡介： 潘海玉，桂林電子科技大學副教授，碩士生導師。2009年畢業(yè)于浙江理工大學，獲得工學碩士學位；2012畢業(yè)于華東師范大學，獲得博士學位；2013-2017年在陜西師范大學博士后流動站工作。 現(xiàn)任中國計算機學會理論計算機專委會執(zhí)行委員、中國計算機學會形式化方法專委會執(zhí)行委員、中國人工智能學會離散智能計算專委會委員、中國邏輯學會非經典邏輯與計算專委會委員和中國系統(tǒng)工程學會模糊數(shù)學與模糊系統(tǒng)專委會委員。研究方向為形式化方法、模糊邏輯。負責主持國家自然科學基金面上項目、國家自然科學基金地區(qū)項目、中國博士后基金、廣西自然科學基金面上項目、廣西可信軟件重點實驗室開放基金。以第一作者身份在IEEE Transactions on Fuzzy Systems，Fuzzy Sets and Systems，International Journal of Approximate Reasoning，Theoretical Computer Science，Fundamenta Informaticae等國內外重要學術刊物和國際會議發(fā)表論文20余篇，其中中國計算機學會推薦國際學術刊物上發(fā)表文章9篇。

講座簡介：

Two-player turn-based games on graphs (or game graphs for short) and their probabilistic versions have received increasing attention in computer science, especially in the formal verification of reactive systems. However, in the fuzzy setting game graphs are yet to be addressed, although some practical applications, such as modeling fuzzy systems that interact with their environments, appeal to such models. To fill the gap, in this report we propose a fuzzy version of game graphs and focus on the fuzzy game graphs with reachability objectives, which we will refer to as fuzzy reachability games (FRGs). In an FRG, the goal of one player is to maximize her truth value of reaching a given target set, while the other player aims at the opposite. In this framework, we show that FRGs are determined in the sense that for every state, both of the two players have the same value, and there exist optimal memoryless strategies for both players. Moreover, we design algorithms, which achieve polynomial time-complexity in the size of the FRG, to compute the values of all states and the optimal memoryless strategies for the players. In addition, several examples are given to illustrate our motivation and the theoretical development.