APTL公式的可满足性检查工具  

Tool for Checking Satisfiability of APTL Formulas

作　　者：王海洋 段振华[1,2] 田聪[1,2] WANG Hai-Yang;DUAN Zhen-Hua;TIAN Cong(Institute of Computing Theory and Technology, Xidian University, Xi＇an 710071, China;State Key Laboratory of Integrated Service Networks （Xidian University）, Xi＇an 710071, China)

机构地区：[1]西安电子科技大学计算理论与技术研究所,陕西西安710071 [2]ISN国家重点实验室(西安电子科技大学),陕西西安710071

出　　处：《软件学报》2018年第6期1635-1646,共12页Journal of Software

基　　金：国家自然科学基金(61732013,61420106004)

摘　　要：交替投影时序逻辑(alternating projection temporal logic,简称APTL)公式简单易懂,表达能力强;不仅可以描述经典时序逻辑LTL可以描述的性质,而且可以描述与区间相关的顺序和循环性质以及开放系统和多智能体系统中与博弈相关的性质.在验证系统是否满足所给的APTL公式所描述的性质之前需要检查公式的可满足性.根据检查APTL公式的可满足性的方法,开发实现了工具APTL2BCG.具体细节如下:首先,利用公式P的范式构造P的标记范式图(labeled normal form graph,简称LNFG);然后,将LNFG转化为广义的基于并发博弈结构的交替Büchi自动机(generalized alternating Büchi automaton over concurrent game structure,简称GBCG);最后,将GBCG转化为基于并发博弈结构的交替Büchi自动机(alternating Büchi automaton over concurrent game structure,简称BCG)并且化为最简形式并检查公式P的可满足性.Alternating projection temporal logic（APTL） has a concise syntax with strong expressive power. It is able to express not only properties specified in classical temporal logic LTL, but also interval related sequential and periodical properties, as well as game related properties of open systems and multi-agent systems. To verify whether a system satisfies an APTL formula, the satisfiability of the APTL formula should be checked. In this paper, based on the method for checking satisfiability of an arbitrary APTL formula provided, a supporting tool APTL2BCG has been developed. The details of implementation are given as follows. Firstly, LNFG of P is constructed according to the normal form of the formula P. Then, the LNFG is transformed to a generalized alternating Büchi automaton over concurrent game structure（GBCG）. Finally, the alternating Büchi automaton is developed over concurrent game structure（BCG） from the obtained GBCG, and the BCG is simplified for checking the satisfiability of the formula P.

关 键 词：交替投影时序逻辑 范式 标记范式图 基于并发博弈结构的交替Büchi自动机 可满足性 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]