期刊文献+

基于ASP的CSP并发系统验证研究 被引量:4

ASP-based Verification of Concurrent Systems Described by CSP
下载PDF
导出
摘要 传统并发通信顺序进程(CSP)性质的验证通常使用3个不同的模型层面,从而增加了系统的复杂性和验证工具开发的难度;同时,主流的并发系统模型验证工具不支持在系统的一次运行中验证多个性质,这也降低了性质验证的效率。首先将CSP程序转换为ASP程序,然后将CSP进程并发规则和以LTL/CTL公式表示的待验证性质转换为ASP规则,从而建立了基于ASP验证CSP并发系统性质的统一框架。实验结果表明,基于ASP的CSP并发系统验证技术易于实现,在保持较高验证效率的同时,能够支持在验证软件的一次执行中验证多条LTL/CTL公式。 Traditionally,the verification of properties of Communicating Sequential Processes(CSP) is carried out on three different levels of models,which increases the complexity and difficulty of developing verification tools.At the same time,mainstream tools for verifying concurrent systems cannot verify multiple properties at one run of the tools,which decreases the verification efficiency of the tools.To deal with the problems,this paper proposed an ASP-based unified framework for verifying concurrent systems described by CSP.The method first transforms CSPs into the Answer Set Program,and then transforms the execution rules for concurrent CSP processes and the properties in the form of LTL/CTL formulae into the rules of ASP.At last,the properties can be verified by a computation of the answer sets of the resulting ASP program.It is shown that the ASP based method for verifying CSP concurrent system is easy to implement,is able to verify multiple LTL/CTL formulae at one execution of the verification software,and at the same time achieves acceptable time efficiency.
出处 《计算机科学》 CSCD 北大核心 2012年第12期125-132,共8页 Computer Science
基金 国家自然科学基金(61063002) 广西自然基金(2011GXNSFA018166 2011GXNSFA018164) 武汉大学软件工程国家重点实验室开放基金(SKLSE2010-08-06) 广西可信软件重点实验室基金项目(kx201113) 广西研究生教育创新计划项目(2010105950812M28)资助
关键词 通信顺序进程 回答集编程 LTL CTL Communicating sequential processes Answer set program LTL/CTL
  • 相关文献

参考文献12

  • 1Hoare C A R. Communicating Sequential Processes [M]. http://www, usingcsp, com/cspbooks, 2004.
  • 2Garavel H, Lang F. NTIF: A General Symbolic Model for Communicating Sequential Processes with Data [C]//Proc. FORTE' 02. 2002:276-291.
  • 3Clarke E M, Talupur M, Veith H. Proving Ptolemy Right, The Environment Abstraction Framework for Model Checking Con- current Systems [C]//Proc. TACAS. 2008:33-47.
  • 4Chaki S, Clarke E M, Ouaknine J, et al. Concurrent software verification with states, events, and deadlocks [J]. Formal As- pects of Computing,2005,17(4) :461-483.
  • 5Dubrovin J. Efficient Symbolic Model Checking of ConcurrentSystems [D]. Aalto University School of Science Department of Information and Computer Science, Doctoral Dissertation, 2011.
  • 6张兆庆,蒋昌俊,乔如良,叶志宝,周杰.PVM并行程序验证系统的原理与实现[J].计算机学报,1999,22(4):409-414. 被引量:6
  • 7Gelfond M, Lifschitz V. The stable model semantics for logic programming[C]//Proc. ICLP' 1988. 1988:1070-1080.
  • 8Baral C. Knowledge Representation, Reasoning, and Declarative Problem Solving [M]. Cambridge Press, 2003 : 5-64.
  • 9Zhao Ling-zhong, Qian Jun-yan, Chang Liang, et al. Using ASP for Knowledge Management with User Authorization [J]. Data Knowledge Engineering, 2010,69(8) : 737-762.
  • 10Gavanelli M, Rossi F. Constraint logic programming [C]// LNCS. 2010,6125 : 64-86.

二级参考文献4

  • 1Liang C J,J Syst Sci Syst Eng,1999年,8卷,1期,1页
  • 2蒋昌俊,高技术通讯,1998年,8卷,2期,28页
  • 3Shatz S M,J Syst Software,1988年,8卷,3期,343页
  • 4陆维明,中国科学.A,1987年,16卷,2期,194页

共引文献5

同被引文献43

  • 1蒋屹新,林闯,曲扬,尹浩.基于Petri网的模型检测研究[J].软件学报,2004,15(9):1265-1276. 被引量:20
  • 2Hoare C A R. Communicating Sequential Processes [OL]. ht tp://www, usingcsp, eom/cspbooks, 2012.
  • 3Art K R. Ten years of Hoare' s logic, A survey-Part I[J]. ACM TOPLAS, 1981,3 (4) : 431-483.
  • 4Roscoe A W,Gardiner P H B,Goldsmith M H,et al. Hierarchi- cal compression for model-checking CSP or how to cheek10 dining philosophers for deadloek[C] // Proceedings of the 1st TACAS, BRICS Notes Series N&95-2. Department of Computer Science, University of Aarhus, 1995.
  • 5Roscoe A W. Model Checking CSP[M]//A classical mind: es- says in honour of C. A. R. Hoare. Prentice Hall, 1994.
  • 6Armstrpng P, I.owe G, Ouaknine J, et al. Model checking timed CSP[C]//To appear in proceedings of HOWARD, Easychair, 2012.
  • 7Armstrpng P, Goldsmith M H, Lowe G, et al. Recent develop- ments in FDR2[C]//Proceedings of CAV. 2012:699 704.
  • 8Baier C, Katoen J-P. Principles of model checking[M]. Cam- bridge, Massachusetts: The MIT Press, 2007.
  • 9Hoare C A R. A model for communicating sequential processes [M]//McKeag, MacNaughten, eds. On the construction of pro- grams. Cambridge University Press, 1980.
  • 10Roscoe A W. The Theory and Practice of Concurrency [M]. Prentice Hall, 1998.

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部