| APTL公式的可满足性检查工具 |
| |
| 引用本文： | 王海洋,段振华,田聪.APTL公式的可满足性检查工具[J].软件学报,2018,29(6):1635-1646. |
| |
| 作者姓名： | 王海洋 段振华 田聪 |
| |
| 作者单位： | 西安电子科技大学 计算理论与技术研究所, 陕西 西安 710071;ISN国家重点实验室(西安电子科技大学), 陕西 西安 710071,西安电子科技大学 计算理论与技术研究所, 陕西 西安 710071;ISN国家重点实验室(西安电子科技大学), 陕西 西安 710071,西安电子科技大学 计算理论与技术研究所, 陕西 西安 710071;ISN国家重点实验室(西安电子科技大学), 陕西 西安 710071 |
| |
| 基金项目： | 国家自然科学基金（61732013，61420106004） |
| |
| 摘 要： | 交替投影时序逻辑（Alternating Projection Temporal Logic，简称APTL）公式简单易懂，表达能力强；不仅可以描述经典时序逻辑LTL可以描述的性质，而且可以描述与区间相关的顺序和循环性质以及开放系统和多智能体系统中与博弈相关的性质.在验证系统是否满足所给的APTL公式所描述的性质之前需要检查公式的可满足性.本文根据检查APTL公式的可满足性的方法1]，开发实现了工具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的可满足性.
|
| 关 键 词： | 交替投影时序逻辑 范式 标记范式图 基于并发博弈结构的交替Büchi自动机 可满足性 |
| 收稿时间： | 2017/6/26 0:00:00 |
| 修稿时间： | 2017/9/1 0:00:00 |
Tool for Checking Satisfiability of APTL Formulas |
| |
| WANG Hai-Yang,DUAN Zhen-Hua and TIAN Cong.Tool for Checking Satisfiability of APTL Formulas[J].Journal of Software,2018,29(6):1635-1646. |
| |
| Authors: | WANG Hai-Yang DUAN Zhen-Hua and TIAN Cong |
| |
| Affiliation: | 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,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 and 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 |
| |
| Abstract: | Alternating Projection Temporal Logic (APTL) has a concise syntax and a strong expressive power. It is able to not only express properties specified in classical temporal logic LTL, but also express interval related sequential and periodical properties, as well as express 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 in1], a supporting tool APTL2BCG has been developed. The details of implementation are given as follows. Firstly, constructing LNFG of P according to the normal form of the formula P; then, transforming the LNFG to a Generalized alternating Büchi automaton over Concurrent Game structure (GBCG); finally, constructing the alternating Büchi automaton over Concurrent Game structure (BCG) from the obtained GBCG and simplifying the BCG, and checking the satisfiability of the formula P. |
| |
| Keywords: | alternating projection temporal logic normal form LNFG BCG satisfiability |
|
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
