期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于Web应用的SCXML到自动机的转换

Transformation from SCXML based on web application to automata
下载PDF
导出
摘要 为了对Web应用进行验证,保证Web应用的可靠性和质量,提出了将Web应用的SCXML描述提取出通用状态机的算法。在对Web服务应用的语言SCXML的各构成要素进行深入分析的基础上,该算法实现了将SCXML描述转化为相应的自动机,为对Web应用进行模型检查打下基础。对Web应用游戏系统的SCXML文件转换得到了对应的自动机实例,实验结果表明了该算法的正确性和有效性。 To verify and ensure the reliability and quality of web applications,an algorithm of extracting the automata from the state chart extensible markup language（SCXML） is presented,which describes the application of web services.Based on the deep analysis of the constituent elements of the SCXML language,it is realized the transformation from SCXML of the web applications to the automata with the algorithm,which lays a foundation for model checking of the web applications.The validity and efficiency of the presented algorithm is demonstrated by the example of the transformation of the web application for game system to the automata.
作者 张东方 沈云付
机构地区 上海大学计算机工程与科学学院
出处 《计算机工程与设计》 CSCD 北大核心 2010年第20期4385-4388,4433,共5页 Computer Engineering and Design
基金 国家863高技术研究发展计划基金项目(2007AA01Z144)
关键词 WEB应用 状态图扩展标记语言 有限状态自动机 模型检查 形式验证 web applications SCXML FSM model checking formal verification
分类号 TP301.2 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1刘如娟,戴桂兰,胡长军,白晓颖.Web服务的模型检测技术探讨[J].小型微型计算机系统,2007,28(11):1921-1927. 被引量：4
  • 2Grady Booth,James Rumbaugh,Ivar Jacobson.Unified modeling language user guide[M].2nd Ed.Massachusetts:Addison-Wes-ley,2005.
  • 3James Rumbaugh,Ivar Jacobson,Grady Booch.Unified modeling language reference manual[M].2nd Ed.Massachusetts:AddisonWesley,2004.
  • 4Anneliese Andrews,Jeff Offutt,Roger Alexander.Testing web applications by modeling with FSMs[J].Software Systems and Modeling,2005,4(3):326-345.
  • 5Graham Wiicock.SCXML and voice interfaces[C].Kaunas,Lithuania:Vtautas Magnus University,2007.
  • 6State Chart XML(SCXML).State machine notation for control abstraction[EB/OL].http://www.w3.org,/TR/scxml/.W3CWorkingDraft7,2009.
  • 7Alfred V Aho,Ravi Sethi,Jeffrey D Ullman,et al.Compilers:Principles,techniques,and tools[M].2nd Ed.Massachusetts:AddisonWesley,2006.
  • 8Li Jin-hua,Dai Geng-xin,Li Huan-huan.Mutation analysis for testing finite state machines[C].Nanchang:Second International Symposium on Electronic Commerce and Security,2009:620-624.
  • 9沈浩,孙永强.自动机与模型检查[J].计算机工程与应用,2004,40(1):63-64. 被引量：3
  • 10Lin Lin,Ping Lin.Orchestration in web services and real-time communications[J].IEEE Communication Magazine,2007,45(1):44-50.

二级参考文献13

  • 1廖军,谭浩,刘锦德.基于Pi-演算的Web服务组合的描述和验证[J].计算机学报,2005,28(4):635-643. 被引量：107
  • 2[1]J R Buchi. On a decision method in restricted in second order arithmetic[C].In:Proc 1960 Int Congr for Logic,Standford Univ Press,Standford, 1962-01～11
  • 3[2]Y Choueka. Theories of automata on ω-tapes:A simplified approach[J].Journel of computer and system sciences, 1974;8:117～141
  • 4[3]E A Emerson,C-L Lei. Modalities for model checking:Branching timelogic strikes back[C].In:proceeding of the Twelfth ACM Symposium on Principles of Programming languages New Orleans, 1985:84～96
  • 5[4]E A Emerson,C-L Lei.Temporal model checking under generalized fairness constraints[C].In:Proc 18th Hawaii International Conference on System Sciences, Hawaii, 1985: 277～288
  • 6[5]R McNaughton.Testing and generating infinite sequences by a finite automaton[J].Information and Control,1966;9:521～530
  • 7[6]D E Muller. Infinite sequence and finite machines[C].In:Proc 4th Ann IEEE Symp on Swithching Theory and Logical Design,Chicago,1963:3～16
  • 8[7]S Safra.On the complexity of omega-automata[C].In:Proceedings of the 29th IEEE Symposium on Foundations of Computer Science,White Plains, 1988: 319～327
  • 9[8]Moshi Vardi.An automata-theoretic approach to linear temporal logic[C].In:Banff＇94
  • 10[9]M Y Vardi,P Wolper. Reasoning about infinte computations[J].Information and computation, 1994; 115 ( 1 ): 1～37

共引文献5

计算机工程与设计
2010年 第20期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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