一类并发实时系统的自动验证

Automatic Verification of a Class of Concurrent Real-Time Systems

一个被广泛用于验证实时系统的方法是根据被验证的实时性质 ,使用适当的双向模拟等价关系使无限的状态空间转化为有限的状态等价类空间 .算法只需要在这个有限的等价类空间里搜索就可以得到正确答案 .但是 ,这个等价类空间的规模一般随着系统规模的增大而产生爆炸性的增长 ,以至于在很多情况下 ,穷尽搜索这个空间是不现实的 .该文引入了一个等价关系来验证一个由多个实时自动机通过共享变量组成的并发系统是否满足一个线性时段特性 .同时 ,还引入了格局之间的兼容关系来避免对状态等价类空间的穷尽搜索 .基于这两个关系 ,文章提出了一个算法来验证是否一个实时自动机网满足一个线性时段特性 .实例研究显示 ,此算法在某些情况下比其他一些工具有更好的时间和空间效率 .

A widely used method for checking real time systems is, according to the real time property to be checked, to use a proper bi simulation equivalence relation to convert the infinite\|timed state space to a finite equivalence class space. The algorithm needs only to explore the finite space to get a correct answer. In most cases, exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases. In this paper, an equivalence relation is introduced to check whether a concurrent system, which is composed of a finite set of real time automata, satisfies a linear duration property. To avoid exhaustive exploration, this paper also introduces a compatibility relation between timed states (configurations). Based on these two relations, an algorithm is proposed to check whether a real time automaton network satisfies a linear duration property. The cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature.