Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/92435
Title: 以雙重弱硬式限制驗證系統性質
Verifying System Properties with Dual Weakly-Hard Constraints
Authors: 蔡承濬
Chen-Jun Tsai
Advisor: 林忠緯
Chung-Wei Lin
Keyword: 嵌入式系統,網宇實體系統,實時系統,正規式驗證,弱硬式限制,
Embedded and Cyber-Physical Systems,Real-Time Systems,Formal Verification,Weakly-Hard Models,
Publication Year : 2024
Degree: 碩士
Abstract: 嵌入式和網宇實體系統的不斷發展引領了實時系統管理的新模式,其中,嚴格的傳統實時限制通常無法容忍錯誤,因此常常與動態且不可預測的環境發生衝突。弱硬式錯誤模型(weakly-hard fault model)作為一種實用的解決方案,允許系統在控制下容忍特定次數的錯誤,進而實現了可靠性和適應性的平衡。準確地說,一個弱硬式錯誤模型使用單一重弱硬式限制 C = (m,k)(weakly-hard constraint)來描述,代表在 k 個連續的事件中,可以確保最多只有 m 個錯誤的事件。本論文提出了一種以雙重弱硬式限制驗證系統性質的創新方法,我們使用一個弱硬式限制對(C1,C2)來約束系統的輸入,並且提出不同的方法以高效地在所有可能的限制對下驗證系統性質。透過離散二階控制和網絡路由的兩個案例研究,這些方法的普遍性和有效性得到證實。實驗結果進一步表明,這種採用弱硬式限制對的模型能夠涵蓋更廣泛的系統行為範圍,突顯了其增強嵌入式和網宇實體系統靈活性和適應性的潛力,這對於此類需要在有限資源和存在錯誤的情況下提供保證的系統尤為重要。
The evolving landscape of embedded and cyber-physical systems has ushered in a new paradigm in real-time systems management, where the rigidity of traditional hard real-time constraints often conflicts with the need for flexibility in dynamic and unpredictable environments. The weakly-hard constraint model, defined by a weakly-hard constraint C = (m, k), where 0 ≤ m ≤ k, meaning that there are at most m bad events (faults) among any k consecutive events. It emerges as a pragmatic solution allowing a controlled number of faults, balancing reliability and adaptability. This thesis introduces an innovative methodology for verifying system properties under dual weakly-hard constraints. We have developed general approaches to verify properties for all possible values of weakly-hard constraint pairs (C_1,C_2), where C_i is a weakly-hard constraint with k_i being smaller than or equal to a given K. The process of verifying these candidates is executed precisely and efficiently, informed by our observation and analysis. We also introduce the speedup in m and k approaches, demonstrating their efficiency in managing larger state spaces for the special case of reachability analysis. If the system environment satisfies the weakly-hard requirements, the satisfaction of desired properties is assured. This assurance is particularly crucial for systems that must provide guarantees with limited resources and in the presence of faults. Through two case studies – discrete second-order control and network routing – we validate the effectiveness of our approaches. Our results indicate a substantial improvement in verification efficiency with the dual weakly-hard constraint model. The ability of this model to encompass a broader range of system behaviors underscores its potential to enhance the flexibility and adaptability of embedded and cyber-physical systems.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/92435
DOI: 10.6342/NTU202400164
Fulltext Rights: 未授權
Appears in Collections:資訊工程學系

Files in This Item:
File SizeFormat 
ntu-112-1.pdf
  Restricted Access
846.68 kBAdobe PDF
Show full item record


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

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved