Institutional Repository
| a complete axiomatisation for timed automata | |
| Lin HM; Yi W | |
| 2000 | |
| Conference Name | 20th Conference on Foundations of Software Technology and Theoretical Computer Science |
| Pages | 277-289 |
| Conference Date | DEC 13-15, |
| Conference Place | NEW DELHI, INDIA |
| Indexed Type | sci ; istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS |
| 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. |
| 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 |
| Sponsorship | IBM India Res Lab, TCS (TRDDC), Tata Infotech, Silicon Automat Syst, Cadence Design Syst, IIT Delhi |
| Language | 英语 |
| WOS ID | WOS:000170924100022 |
| Citation statistics | |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/13674 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a complete axiomatis（217KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment