• ISSN 0258-2724
  • CN 51-1277/U
  • EI Compendex
  • Scopus
  • Indexed by Core Journals of China, Chinese S&T Journal Citation Reports
  • Chinese S&T Journal Citation Reports
  • Chinese Science Citation Database
Volume 17 Issue 5
Oct.  2004
Turn off MathJax
Article Contents
ZHIXiao-li, TONG Wei-qin, RONGLu. Automatic Abstraction Algorithm for Timed Automata[J]. Journal of Southwest Jiaotong University, 2004, 17(5): 670-674.
Citation: ZHIXiao-li, TONG Wei-qin, RONGLu. Automatic Abstraction Algorithm for Timed Automata[J]. Journal of Southwest Jiaotong University, 2004, 17(5): 670-674.

Automatic Abstraction Algorithm for Timed Automata

  • Publish Date: 25 Oct 2004
  • To deal with the state-explosion problem in the specification analysis and verification of timed automata, an automatic abstraction algorithm for timed automata was proposed. By directly abstracting the specifications of a timed automaton instead of its semantic model ofmuch bigger size, this algorithmyields a polynomial time complexity no more than the four power of its topology complexity. An experiment shows that the algorithm can be applied to any timed automaton satisfying a property called linear resetting and used to simplify system specifications to improve their understandability.

     

  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Article views(1264) PDF downloads(176) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return