checking timed buchi automata emptiness using lu-abstractions
文献类型：学位论文
| 作者 | Li Guangyuan |
| 答辩日期 | 2009 |
| ISSN号 | 0302-9743 |
| 关键词 | Approximation theory Extrapolation Robots Time sharing systems Translation (languages) |
| 出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| 出版者 | FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS |
| 英文摘要 | This paper shows that the zone-based LU-extrapolation of Behrmann et al, that preserves reachability of timed automata, also preserves emptiness of timed Buchi automata. This improves the previous results by Tripakis et al who showed that the k-extrapolation preserves timed Buchi automata emptiness. The LU-extrapolation is coarser than k-extrapolation, allowing better state space reductions. A tool with LU-extrapolation for emptiness checking of timed Buchi automata has been implemented, and some experiments are reported. |
| 公开日期 | 2011-03-20 |
| 资助信息 | EU IST Project QUASIMODO |
| 出处 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 源URL | [http://124.16.136.157/handle/311060/8330]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _学位论文 |
| 推荐引用方式 GB/T 7714 | Li Guangyuan. checking timed buchi automata emptiness using lu-abstractions[D]. 2009. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。