• 沒有找到結果。

AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS

N/A
N/A
Protected

Academic year: 2022

Share "AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS 作者: A SAHAY;JJP TSAI;AP SISTLA

貢獻者: Department of Bioinformatics

關鍵詞: Model-checking;timed mu-calculus;timed automata;requirements specification;labeled transition systems

日期: 1999

上傳時間: 2009-11-17T11:17:43Z 出版者: Asia University

摘要: We present an incremental algorithm for model checking the real-time systems against the requirements specified in the real-time extension of modal mu-calculus.

Using this algorithm, we avoid the repeated construction and analysis of the whole state-space during the course of evolution of the system from time to time. We use a finite representation of the system, like most other algorithms on real-time systems. We construct and update a graph (called TSG) that is derived from the region graph and the formula. This allows us to halt the construction of this graph when enough nodes have been explored to determine the truth of the formula. TSG is minimal in the sense of partitioning the infinite state space into regions and it expresses a relation on the set of regions of the partition. We use the structure of the formula to derive this partition. When a change is applied to the timed

automaton of the system, we find a new partition from the current partition and the TSG with minimum cost.

參考文獻

相關文件

• The randomized bipartite perfect matching algorithm is called a Monte Carlo algorithm in the sense that.. – If the algorithm finds that a matching exists, it is always correct

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Suppose, instead, we run the algorithm for the same running time mkT (n) once and rejects the input if it does not stop within the time bound.. • By Markov’s inequality, this

z MGCP (Media Gateway Control Protocol)/MEGACO (Media Gateway Control Protocol).. z SIGTRAN

The performance guarantees of real-time garbage collectors and the free-page replenishment mechanism are based on a constant α, i.e., a lower-bound on the number of free pages that

* All rights reserved, Tei-Wei Kuo, National Taiwan University,