improvements for the symbolic verification of timed automata

	improvements for the symbolic verification of timed automata
	Yan Rongjie; Li Guangyuan; Zhang Wenliang; Peng Yunquan
	2007
会议名称	27th International Conference on Formal Techniques for Networked and Distributed Systems
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	196-210
会议日期	JUN 27-29,
会议地点	Tallinn, ESTONIA
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2007
ISSN	0302-9743
ISBN	978-3-540-73195-5
部门归属	Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
摘要	Based on the equivalence relation for location based reachability between continuous and integer semantics of closed timed automata, Beyer et al. have implemented the verifier Rabbit, with the uniform representation of reachable configurations
关键词	Verification Timed Systems Symbolic Method Bdd
主办者	IFIP WG6 1, Tallinn Univ Technol, Dept Comp Sci, Tallinn Univ Technol, Inst Cybernet
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10842
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Yan Rongjie,Li Guangyuan,Zhang Wenliang,et al. improvements for the symbolic verification of timed automata[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2007,2007:196-210.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
improvements for the（253KB）			开放获取	--	请求全文