报告题目：Reachability in Fuzzy Game Graphs
报告人: 潘海玉
讲座日期：2021-9-17
讲座时间：15:00
报告地点：腾讯会议ID：121181901
主办单位：数学与统计学院
讲座人简介： 潘海玉，桂林电子科技大学副教授，硕士生导师。2009年毕业于浙江理工大学，获得工学硕士学位；2012毕业于华东师范大学，获得博士学位；2013-2017年在伟德国际1946源于英国博士后流动站工作。 现任中国计算机学会理论计算机专委会执行委员、中国计算机学会形式化方法专委会执行委员、中国人工智能学会离散智能计算专委会委员、中国逻辑学会非经典逻辑与计算专委会委员和中国系统工程学会模糊数学与模糊系统专委会委员。研究方向为形式化方法、模糊逻辑。负责主持国家自然科学基金面上项目、国家自然科学基金地区项目、中国博士后基金、广西自然科学基金面上项目、广西可信软件重点实验室开放基金。以第一作者身份在IEEE Transactions on Fuzzy Systems，Fuzzy Sets and Systems，International Journal of Approximate Reasoning，Theoretical Computer Science，Fundamenta Informaticae等国内外重要学术刊物和国际会议发表论文20余篇，其中中国计算机学会推荐国际学术刊物上发表文章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.
