Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Design》 2010-01
Add to Favorite Get Latest Update

Emptiness checking of timed automata and it's improvement

WEI Xu-kai1,2(1.State Key Lab of Computer Science,Institute of software,Chinese Academy of Sciences,Beijing 100190,China;2.Graduate University,Chinese Academy of Sciences,Beijing 100049,China)  
To improve efficiency of checking emptiness of timed automata,zone-based symbolic method and abstraction are studied,further more an improvement of emptiness checking of timed automata is presented.In zone-based symbolic representation and abstrac-tion,a symbolic state represents a set of explicit states,the state space of timed automata decreases significantly,moreover distinct ab-straction have different influences on the state space.Since there are equivalence and inclusion relationship between symbolic states,by testing of inclusion relationship,a model checker find accepted path faster and avoid unnecessary state explorations.Thus checking will take less time.Finally the effectiveness of presented method is demonstrated by case study.
【CateGory Index】: TP316.2
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved