| Title: | a complete axiomatisation for timed automata |
| Author: | Lin HM
; Yi W
|
| Conference Name: | 20th Conference on Foundations of Software Technology and Theoretical Computer Science
|
| Conference Date: | DEC 13-15,
|
| Issued Date: | 2000
|
| Conference Place: | NEW DELHI, INDIA
|
| Publisher: | FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| Indexed Type: | sci
; istp
|
| ISSN: | 0302-9743
|
| ISBN: | 3-540-41413-4
|
| Department: | Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China. Uppsala Univ, Dept Comp Syst, Uppsala, Sweden.
|
| Sponsorship: | IBM India Res Lab, TCS (TRDDC), Tata Infotech, Silicon Automat Syst, Cadence Design Syst, IIT Delhi
|
| English Abstract: | 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 |
| Language: | 英语
|
| Citation statistics: |
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/13674
|
| Appears in Collections: | 软件所图书馆_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| a complete axiomatisation for timed automata.pdf（217KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Lin HM,Yi W. a complete axiomatisation for timed automata[C]. 见:20th Conference on Foundations of Software Technology and Theoretical Computer Science. NEW DELHI, INDIA. DEC 13-15,.
|
|
|
