期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Fair Preorder for Partial Fair Kripke Structures
1
作者 徐蔚文 陆鑫达 《Journal of Shanghai Jiaotong university(Science)》 EI 2003年第1期15-18,共4页
This paper discussed how to handle the fairness conditions in partial Kripke structures. The partial Kripke structures were used for partial state spaces model checking, which is a new technique to solve problems of s... This paper discussed how to handle the fairness conditions in partial Kripke structures. The partial Kripke structures were used for partial state spaces model checking, which is a new technique to solve problems of state explosion. This paper extended the partial Kripke structure with fairness conditions by defining a partial fair Kripke structure, and a 3 valued fair CTL(Computation Tree Logic) semantics correspondingly. It defines a fair preorder between partial Kripke structures that preserves fairness and is akin to fair bisimulation. In addition, a pertinent theorem is also given, which indicates the relationship between the partial state spaces and the more complete one by illustrating the characterizations of states in the partial fair structure in terms of CTL formulae. 展开更多
关键词 FAIRNESS kripke structure computation tree logic(CTL)
下载PDF
Direct Model Checking Matrix Algorithm
2
作者 陶志红 Hans Kleine Buening 王立福 《Journal of Computer Science & Technology》 SCIE EI CSCD 2006年第6期944-949,共6页
During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking ... During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking technique has the edge over all others in all application areas. So, it is very difficult to determine which technique is the most suitable for a given model. It is thus sensible to apply different techniques to the same model. However, this is a very tedious and time-consuming task, for each algorithm uses its own description language. Applying Model Checking in software design and verification has been proved very difficult. Software architectures (SA) are engineering artifacts that provide high-level and abstract descriptions of complex software systems. In this paper a Direct Model Checking (DMC) method based on Kripke Structure and Matrix Algorithm is provided. Combined and integrated with domain specific software architecture description languages (ADLs), DMC can be used for computing consistency and other critical properties. 展开更多
关键词 direct model checking (DMC) kripke semantics structure CTL logic matrix algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部