| Title: | symbolic model checking of finite precision timed automata |
| Author: | Yan RJ
; Li GY
; Tang ZS
|
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Conference Name: | 2nd International Colloquium on Theoretical Aspects of Computing
|
| Conference Date: | OCT 17-21,
|
| Issued Date: | 2005
|
| Conference Place: | Hanoi, VIETNAM
|
| Keyword: | finite precision timed automata
; model checking
; symbolic methods
|
| Publisher: | THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| Indexed Type: | sci
; istp
; ei
; springer
|
| 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.
|
| Sponsorship: | United Nations Univ, Int Inst Software Technol, Vietnam Natl Univ, Vietnam Acad Sci & Technol
|
| 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 |
| Language: | 英语
|
| Citation statistics: |
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/12662
|
| Appears in Collections: | 软件所图书馆_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| symbolic model checking of finite precision timed automata.pdf（491KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Yan RJ,Li GY,Tang ZS. symbolic model checking of finite precision timed automata[C]. 见:2nd International Colloquium on Theoretical Aspects of Computing. Hanoi, VIETNAM. OCT 17-21,.
|
|
|
