模型检验

1、模型检验技术用于检验由模型描述语言描述的系统模型是否满足由性质说明语言描述的系统性质
      (1)模型检验中的关键技术问题是如何设计数据结构和算法,用以表示和遍历大规模的系统模型的状态空间;
      (2)解决由多个系统模型的并行组合而形成的状态空间爆炸问题;
      (3)解决状态空间爆炸问题的途径:
            a1、状态空间的符号表示(Symbolic representation of state space)McMillan‘s ordered binary decision diagrams(OBDD),1992,10^120
            a2、偏序规约技术(Partial order reduction)
            a3、抽象技术(Abstraction)
            a4、对称技术(Symmetry)
2、具有时序性质的并发系统的模型检验理论和技术在工业界已经得到实际的应用;目前模型检验理论和技术的研究热点已经转向实时系统和软件系统。
3、对于实时系统来说,由于时间的引入,其状态空间是无穷的,要设法遍历无穷的状态空间,是一个新的挑战:
     (1)针对典型实时性质开发检验算法
     (2)探索解决状态空间过大的有效途径
4、混成系统(Hybrid System):一类复杂的计算机系统,运行过程中既有连续的状态变化,又有离散的状态变化;实例:水箱监控系统;
5、混成自动机(hybrid automata)是不可判定的,目前国际上相关领域的研究热点在于寻找混成自动机的可判定子集;
     (1)线性时段性质:通过系统在各个状态上的累积时间来约束系统的行为;如下形式的线性积分不等式:
                           i e c i si M     其中 i 表示系统状态, ci 是实型系数, M 是实数
   (2)满足性问题:检验混成自动机相对于线性时段性质的满足性问题:一个混成自动机满足一个线性时段性质当且仅当该混成自动机的所有行为满足该线性时段性质;
   (3)混成自动机的行为表示:时间状态序列:
                           (s 1 , t 1 )^ (s 2 , t 2 )^…^ (s m , t m )     其中 si 表示系统状态, ti 表示系统在 si 上的停留时间 ,t1,t2,…,tm 必须满足相应的时间约束。
   (4)带时段约束的规则表达式: a  £  i e c i si  £  b; 带时段约束的规则表达式不能描述所有混成自动机的行为; 带时段约束的规则表达式对应于一类混成自动机; 对应于带时段约束的规则表达式的一类混成自动机是可判定的;
   (5)基于线性规划的验证途径:
    用带时段约束的规则表达式描述混成自动机的行为,从而线性时段性质相对于混成自动机的满足性问题转化成为相对于规则表达式的满足性问题;
6、模型检验工具:SMV、SPIN、HyTech、Kronos、Uppaal
Model checking is a technique for verifying finite state concurrent systems such as sequential circuit designs and communication protocols. It has a number of advantages over traditional approaches that are based on simulation, testing, and deductive reasoning. In particular, model checking is automatic and usually quite fast. Also, if the design contains an error, model checking will produce a counterexample that can be used to pinpoint the source of the error. The method, which was awarded the 1998 ACM Paris Kanellakis Award for Theory and Practice, has been used successfully in practice to verify real industrial designs, and companies are beginning to market commercial model checkers. The main challenge in model checking is dealing with the state space explosion problem. This problem occurs in systems with many components that can interact with each other or systems with data structures that can assume many different values. In such cases the number of global states can be enormous. Researchers have made considerable progress on this problem over the last ten years. This is the first comprehensive presentation of the theory and practice of model checking. The book, which includes basic as well as state-of-the-art techniques, algorithms, and tools, can be used both as an introduction to the subject and as a reference for researchers. About the Authors Edmund M. Clarke, a pioneer of the automated method called Model Checking, is FORE Systems Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University, and a winner of the 2007 Turing Award given by the Association for Computing Machinery. Doron Peled is Professor of Computer Science at the University of Warwick, Coventry, UK. Endorsements "Model Checking is bound to be the pre-eminent source for research, teaching, and industrial practice on this important subject. The authors include the foremost experts. This is the first truly comprehensive treatment of a line of research that has gone from conception to industrial practice in only two decades." —R. P. Kurshan, Distinguished Member Technical Staff, Bell Laboratories
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值