首页 | 本学科首页   官方微博 | 高级检索  
     

反应系统的连续时序逻辑表示和验证
引用本文:李广元,唐稚松.反应系统的连续时序逻辑表示和验证[J].计算机学报,2003,26(11):1424-1434.
作者姓名:李广元  唐稚松
作者单位:中国科学院软件研究所计算机科学重点实验室,北京,100080
基金项目:国家“八六三”高技术研究发展计划项目 ( 2 0 0 1AA113 2 0 0 ),国家自然科学基金 ( 60 0 73 0 2 ,60 2 73 0 2 5 ),国家“九七三”重点基础研究发展规划项目 ( 2 0 0 2cb3 12 2 0 0 )资助
摘    要:引进一个称为LTLC的连续时间时序逻辑,用来对反应系统进行规范与验证.LTLC的一个重要特点是它能在统一的逻辑框架下表示反应系统及其性质,这样就可将系统与性质问的满足关系转化为逻辑公式间的蕴涵关系.同时,采用非负实数集作为时间域还使我们可以利用标准的存在量词来表示变量隐藏,并可用逻辑蕴涵来表示反应系统间的求精关系.该文首先给出了LTLC的一个简单介绍,然后讨论了如何使用LTLC对反应系统进行表示与推理,最后证明了一个关于LTLC的可判定性结果.此结果可用于有穷状态反应系统的自动验证.

关 键 词:时序逻辑  反应系统  公平转换系统  数学模型  计算机程序
修稿时间:2002年9月23日

Representing and Verifying Reactive Systems with Continuous-Time Temporal Logic
LI Guang-Yuan,TANG Zhi-Song.Representing and Verifying Reactive Systems with Continuous-Time Temporal Logic[J].Chinese Journal of Computers,2003,26(11):1424-1434.
Authors:LI Guang-Yuan  TANG Zhi-Song
Abstract:A continuous-time temporal logic, called LTLC, is introduced in this paper for the specification and verification of reactive systems. A distinguished feature of LTLC is that it can represent both reactive systems and their properties in one unified logic framework, so the satisfaction relation between systems and their properties can be expressed by logical implication. In addition, the use of non-negative real numbers as time domain enables us to express hiding of variables as standard existential quantification and express the relation of refinement between reactive systems as implications between logic formulas. This paper begins with a brief introduction to LTLC and then describes how it is used to represent and reason about reactive systems. Finally, a decidability result about LTLC is given. The result can be used for the automatic verification of finite-state reactive systems.
Keywords:reactive systems  fair transition systems  temporal logic  verification of properties  decidability
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号