期刊文献+

并发系统的安全性与活性的验证方法

Verification of safety and liveness property based on concurrent system
下载PDF
导出
摘要 网络环境下的分布式系统是典型的并发系统。安全性和活性是并发系统最为关注和需要保证的两个主要性质。然而在并发系统建模和形式化验证时,面临着描述繁琐、复杂和难以理解的问题,特别是当并发系统的规模(并发进程数目)较大时其性质验证时的效率问题更是严重阻碍了并发系统模型检测与验证技术的应用。将组合可达性分析和标号迁移系统的模块化思想与模型验证技术相结合,提出了一套有效的性质验证方法。论证、分析了三个并发系统安全性和活性验证定理,据此导出了并发系统的安全性与活性验证的有效算法。并通过一个简单实例,对算法有效性进行了初步验证。 Distributed system is one type of typical concurrent systems.In concurrent system,safety and liveness are the two main characteristics which should be most concerned and ensured in its application.However,we have to face the problems,in concurrent system modeling and formal verification,such as tedious description,complex and difficult understanding,and it is more serious because of the low efficiency in model checking when it is much large(with a great number of the processes ).Combining the features of good modularity in Compositional Reachability Analysis(CRA) and high efficiency in Labeled Transition System (LTS),an efficient model verification method is proposed.Three theorems for safety and liveness verification of concurrent systems are proved,and the relevant effective verification algorithms are derived.The feasibility of the algorithms is indicated through a simplified example.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第4期107-110,共4页 Computer Engineering and Applications
基金 陕西省自然科学基金(the Natural Science Foundation of Shaanxi Province of China under Grant No.2003F20 No.2007F06) 陕西省教育厅产业化重点项目(the Key Project of Industrialization of Shaanxi Province Educational Commission of China under Grant No.05JC27)
关键词 并发系统 安全性 活性 组合可达性 标号迁移系统 concurrent system safety liveness compositional reachability analysis labeled transition system
  • 相关文献

参考文献12

  • 1Schneider F B,Andrews G R.Concepts for concurrent programming[C ].LNCS224.[S.l.] : Springer-Verlag, 1985 : 669-716.
  • 2丁志军,蒋昌俊.并发程序验证的时序Petri网方法[J].计算机学报,2002,25(5):467-475. 被引量:13
  • 3Clarke E M.Automatic verification of finite state concurrent system using temporal logical specification[J].ACM Transaction on Programming Language and Systems,1986,8(2):244-263.
  • 4Cheung S C,Kramer J.Checking safety properties using compositional reachability analysis[J].ACM Transactions on Software Engineering and Methodology(TOSEM).New York,NY:ACM Press,1999, 8( 1 ) :49-78.
  • 5Magee J,Kramer J.Concurrency:state models & Java programs[M]. New York:John Wiley & Sons,1999.
  • 6Milner R.Communication and Concurrency[M].New York:Prentice Hall, 1989.
  • 7Helmbold D,Luckham D.Debugging Ada tasking programs[J].IEEE Software, 1985,2(2) :47-57.
  • 8Magee J,Dulay N,Eisenbach S,et al.Specifying distributed software arehitectures[C].LNCS:Proceedings of the 5th European Software Engineering Conference.London, UK: Springer-Verlag, 1995,989 : 137- 153.
  • 9Fernandez J C,Mounier L,Jard C,et aLOn-tbe-fly verification of finite transition systems[M].Formal Methods in System Design 1(2/3) Hingham, MA : Kluwer Academic Publishers, 1992 : 251-273.
  • 10易锦,张文辉.从基于迁移的扩展Büchi自动机到Büchi自动机[J].软件学报,2006,17(4):720-728. 被引量:7

二级参考文献17

  • 1Vardi MY,Wolper P.An automata-theoretic approach to automatic program verification.In:Proc.of the LICS'86.Cambridge:IEEE CS Press,1986.332-344.
  • 2Gerth R,Peled D,Vardi MY,Wolper P.Simple on-the-fly automatic verification of linear temporal logic.In:Proc.of the 15th IFIP/WG6.1 Symp.on Protocol Specification Testing and Verification.Warsaw,1995.3-18.
  • 3Daniele M,Giunchiglia F,Vardi MY.Improved automata generation for linear temporal logic.In:Halbwachs N,Peled D,eds.Proc.of the 11th Int'l Computer Aided Verification Conf.LNCS 1633,Heidelberg:Springer-Verlag,1999.249-260.
  • 4Somenzi F,Bloem R.Efficient Büchi automata for LTL formulae.In:Leeuwen JV,ed.Proc.of the 12th Int'l Conf.on Computer Aided Verification.LNCS 855,Heidelberg:Springer-Verlag,2000.247-263.
  • 5Sebastiani R,Tonetta S.More deterministic vs.smaller Büchi automata for efficient LTL model checking.In:Geist D,Tronci E,eds.Proc.of the 12th Advanced Research Working Conf.on Correct Hardware Design and Verification Methods.LNCS 2860,Heidelberg:Springer-Verlag,2003.126-140.
  • 6Giannakopoulou D,Lerda F.From states to transitions:Improving translation of LTL formulae to Büchi automata.In:Budach L,ed.Proc.of the 22nd IFIP WG 6.1 Int'l Conf.on Formal Techniques for Networked and Distributed Systems.LNCS 529,Heidelberg:Springer-Verlag,2002.308-326.
  • 7Gastin P,Oddoux D.Fast LTL to Büchi automata translation.In:Berry G,Comon H,Finkel A,eds.Proc.of the 13th Int'l Conf.on Computer Aided Verification.LNCS 2102,Heidelberg:Springer-Verlag,2001.53-65.
  • 8Couvreur J.On-the-Fly verification of temporal logic.In:Wing JM,Woodcock J,Davies J,eds.Proc.of the World Congress on Formal Methods in the Development of Computing Systems.LNCS 1708,Heidelberg:Springer-Verlag,1999.253-271.
  • 9Etessami K,Holzmann G.Optimizing Büchi automata.In:Palamidessi C,ed.Proc.of the 11th Int'l Conf.on Concurrency Theory.LNCS 1877,Heidelberg:Springer-Verlag,2000.153-167.
  • 10Fritz C.Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata.In:Ibarra OH,Dang Z,eds.Proc.of the 8th Int'l Conf.on Implementation and Application of Automata.LNCS 2759,Heidelberg:Springer-Verlag,2003.35-48.

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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