a complete axiomatisation for timed automata

ISCAS OpenIR

	a complete axiomatisation for timed automata
	Lin HM; Yi W
	2000
会议名称	20th Conference on Foundations of Software Technology and Theoretical Computer Science
页码	277-289
会议日期	DEC 13-15,
会议地点	NEW DELHI, INDIA
收录类别	sci ; istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-41413-4
部门归属	Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China. Uppsala Univ, Dept Comp Syst, Uppsala, Sweden.
摘要	In this paper we present a complete proof system for timed automata. It extends our previous axiomatisation of timed bisimulation for the class of loop-free timed automata with unique fixpoint induction. To our knowledge, this is the first alg
主办者	IBM India Res Lab, TCS (TRDDC), Tata Infotech, Silicon Automat Syst, Cadence Design Syst, IIT Delhi
语种	英语
WOS记录号	WOS:000170924100022
引用统计
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/13674
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Lin HM,Yi W. a complete axiomatisation for timed automata[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS,2000:277-289.