Institutional Repository
| symbolic model checking of finite precision timed automata | |
| Yan RJ; Li GY; Tang ZS | |
| 2005 | |
| Conference Name | 2nd International Colloquium on Theoretical Aspects of Computing |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 272-287 |
| Conference Date | OCT 17-21, |
| Conference Place | Hanoi, VIETNAM |
| Indexed Type | sci ; istp ; ei ; springer |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005 |
| ISSN | 0302-9743 |
| ISBN | 3-540-29107-5 |
| Department | Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China. Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China. |
| English Abstract | This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FPTAs only record the integer values of clock variables together with the or |
| Keyword | Finite Precision Timed Automata Model Checking Symbolic Methods |
| Sponsorship | United Nations Univ, Int Inst Software Technol, Vietnam Natl Univ, Vietnam Acad Sci & Technol |
| Language | 英语 |
| WOS ID | WOS:000233420900018 |
| Citation statistics | |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/12662 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Yan RJ,Li GY,Tang ZS. symbolic model checking of finite precision timed automata[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005,2005:272-287. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| symbolic model check（491KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment