CORC  > 武汉理工大学
A Refined Algorithm for Reachability Analysis of Updatable Timed Automata
Fang, Bingbing; Li, Guoqiang*; Fang, Ling; Xiang, Jianwen
刊名2015 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY - COMPANION (QRS-C 2015)
2015
页码230-236
关键词updatable timed automata reachability algorithm EDBM diagonal constraint
DOI10.1109/QRS-C.2015.47
会议名称IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)
URL标识查看原文
会议地点Vancouver, CANADA
会议日期AUG 03-05, 2015
WOS记录号WOS:000380444500034
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/3390059
专题武汉理工大学
作者单位1.[Fang, Bingbing
2.Li, Guoqiang] Shanghai Jiao Tong Univ, Sch Software, Shanghai, Peoples R China.
推荐引用方式
GB/T 7714
Fang, Bingbing,Li, Guoqiang*,Fang, Ling,et al. A Refined Algorithm for Reachability Analysis of Updatable Timed Automata[J]. 2015 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY - COMPANION (QRS-C 2015),2015:230-236.
APA Fang, Bingbing,Li, Guoqiang*,Fang, Ling,&Xiang, Jianwen.(2015).A Refined Algorithm for Reachability Analysis of Updatable Timed Automata.2015 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY - COMPANION (QRS-C 2015),230-236.
MLA Fang, Bingbing,et al."A Refined Algorithm for Reachability Analysis of Updatable Timed Automata".2015 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY - COMPANION (QRS-C 2015) (2015):230-236.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace