symbolic model checking of finite precision timed automata
文献类型：会议论文
| 作者 | Yan RJ ; Li GY ; Tang ZS |
| 出版日期 | 2005 |
| 会议名称 | 2nd International Colloquium on Theoretical Aspects of Computing |
| 会议日期 | OCT 17-21, |
| 会议地点 | Hanoi, VIETNAM |
| 关键词 | finite precision timed automata model checking symbolic methods |
| 页码 | 272-287 |
| 英文摘要 | 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 |
| 收录类别 | SCI ; ISTP ; EI ; SPRINGER |
| 会议主办者 | United Nations Univ, Int Inst Software Technol, Vietnam Natl Univ, Vietnam Acad Sci & Technol |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005 |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 3-540-29107-5 |
| WOS记录号 | WOS:000233420900018 |
| 源URL | [http://124.16.136.157/handle/311060/12662]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | 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,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。