| 题名: | checking timed buchi automata emptiness using lu-abstractions |
| 作者: | Li Guangyuan
|
| 答辩日期: | 2009
|
| 关键词: | Approximation theory
; Extrapolation
; Robots
; Time sharing systems
; Translation (languages)
|
| 部门归属: | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China.
|
| 组织者: | EU IST Project QUASIMODO
|
| 英文摘要: | 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. |
| 内容类型: | 学位论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/8330
|
| Appears in Collections: | 计算机科学国家重点实验室 _学位论文
|
|
There are no files associated with this item.
|
| Recommended Citation: | |
Li Guangyuan. checking timed buchi automata emptiness using lu-abstractions[D]. 2009-01-01.
|
|
|
