中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 计算机科学国家重点实验室  > 学位论文
题名:
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:计算机科学国家重点实验室 _学位论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Li Guangyuan. checking timed buchi automata emptiness using lu-abstractions[D]. 2009-01-01.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Li Guangyuan]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Li Guangyuan]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace