The complexity and difficulty in proving equation or inequation are reduced effectively through establishing suitable probability models.摘要通过构造适当的概率模型使得一些原本很难证明的等式或不等式的证明变得简单而容易。
Schedulability test inequation of the algorithm is presented in the paper.The validity and the flexibility of the algorithm are proved through the analysis of classical task sets.文中给出该算法的可调度判定不等式，并且通过对经典任务集的调度结果，验证了算法的有效性和灵活性。
