摘要
在Reiter算法的基础上,本文提出一种基于ATMS的求解所有极小冲突集的新方法。其中,对每个元件模型最多调用一次就可求出所有的极小冲突集,防止了ATMS的多次调用,因而能够提高效率。本文提出了极小依赖集的概念,并据此对ATMS求得的极小冲突集进行了分类;分析了算法的复杂度,并将新方法与相关工作进行了比较。该算法程序容易编制,而且效率高。
A new method for deriving all minimal conflict sets based on ATMS is proposed in this paper. All minimal conflict sets can be derived with every component model calculated at most once, thus ATMS is avoided to be called more frequently, and the efficiency is improved as well. A concept of minimal dependence set is put forward, as a result of which, all minimal conflict sets based on ATMS can be sorted by two classes. Then, the complexity is analyzed. Finally, the related methods for deriving all conflict sets are compared with the method. The program is easy-to-implement and efficient.
出处
《计算机工程与科学》
CSCD
2007年第11期127-130,共4页
Computer Engineering & Science
基金
国家自然科学基金重大项目(60496320
60496321)
国家863计划资助项目(2003AA118020)
新世纪优秀人才支持计划项目基金
吉林省科技发展计划项目(20060532)
