引用本文:陆旭,于斌,田聪,段振华.一种利用非确定规划的LTL合成方法.软件学报,2022,33(8):2769-2781
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 1908次   下载 4985 本文二维码信息
码上扫一扫!
分享到: 微信 更多
一种利用非确定规划的LTL合成方法
陆旭1,2, 于斌1,2, 田聪1,2, 段振华1,2
1.西安电子科技大学 计算机科学与技术学院, 陕西 西安 710071;2.综合业务网理论及关键技术国家重点实验室(西安电子科技大学), 陕西 西安 710071
摘要:
LTL合成(linear temporal logic synthesis)是程序合成(program synthesis)的一类重要子问题,旨在自动构建一个控制器(controller),且要求该控制器和环境(environment)的行为交互满足给定的LTL公式.一般来说,可以将LTL合成定义为二人博弈(two-player game)问题,博弈的双方是环境和控制器,该问题的解称为合成策略.近年来,有研究从理论角度讨论了LTL合成与非确定规划(non-deterministic planning)的相关性.基于此,提出了一种新的利用非确定规划求解LTL合成问题的方法,并证明了方法的正确性和完备性.具体而言,首先获得LTL公式对应的Büchi自动机,结合二人博弈定义,将LTL合成问题转换为完全可观测的非确定规划模型;然后交由高效规划器求解.通过实验结果说明:与其他LTL合成方法相比,提出的基于规划的合成方法在解质量方面具有较大的优势,能够获得规模较小的合成策略.
关键词:  二人博弈  Büchi自动机  LTL合成  非确定规划
DOI:10.13328/j.cnki.jos.006597
分类号:TP311
基金项目:国家自然科学基金(61806158,61732013,62172322,62002290);中国博士后科学基金(2019T120881,2018M643585);国家重点研发计划(2018AAA0103202);陕西省重点科技创新团队(2019TD-001);陕西省自然科学基础研究计划(2021JQ-208)
LTL Synthesis via Non-deterministic Planning
LU Xu1,2, YU Bin1,2, TIAN Cong1,2, DUAN Zhen-Hua1,2
1.School of Computer Science and Technology, Xidian University, Xi'an 710071, China;2.State Key Laboratory of Integrated Service Networks (Xidian University), Xi'an 710071, China
Abstract:
LTL synthesis is an important sub-class of program synthesis. The process of LTL synthesis is to automatically build a controller which interacts with the environment, where the objective is to make the interactive behaviors satisfy a given LTL formula. Generally speaking, LTL synthesis problem is often defined as a two-player game, one player is environment, and the other is controller. The solution of the problem is called synthesis policy. Recently, researchers have investigated that there exists close correspondence between LTL synthesis and non-deterministic planning from a theoretical point of view. This paper presents a novel LTL synthesis approach exploiting non-deterministic planning techniques. Moreover, the correctness and the completeness of the approach is proved formally. Concretely, at first LTL formulas are converted into Büchi automata, then the automata with the two-player game definition of LTL synthesis are translated into full-observable non-deterministic planning models which can be directly fed to existing effective planners. The experimental results show that planning based LTL synthesis has significant advantage over other approaches in improving the quality of solutions, i.e., the size of the obtained policies is much smaller.
Key words:  two-player game  Büchi automata  LTL synthesis  non-deterministic planning

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: