Specifying Executable Probability Design of Real-Time Task in Resource-Sharing Network with ASM
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference [14]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    Based on a formal method called Abstract State Machine (ASM), this paper describes an admission control mechanism of real-time task in resource-sharing network. In the meantime, the paper also proposes an ASM-based design model for executable probability of real-time task, and shows the methods and steps to analyze this design model based on Spec Explorer. The paper argues that the work will not only do good to further verification for the design method, but also to more refinements for admission control of real-time task. And the ASM model also provides an example for the realization of other control mechanisms designed.

    Reference
    1 金士尧,等.共享资源网络的实时任务接纳控制方法.中国,专利号:ZL200810144000.3,2010-12-01.
    2 Gurevich Y. Sequential abstract state machines capture sequential algorithms. ACM Trans. on Computational Logic, 2000,1(I):77-111.
    3 Borger E. The origins and development of the ASM method for high level system design and analysis. Journal of Universal Computer Science, 2002,8(1):2-74.
    4 Abstract State Machines. http://www.eecs. umich.edu/gasm
    5 刘晖,李明禄.基于抽象状态机的网格系统设计和分析.电子学报,2003,31(12A):2096-2100.
    6 Spec Explorer. http://research.microsoft.com/en-us/projects/ specexplorer/
    7 Guillem B, Alan B, Albert L. Weakly hard real-time systems. IEEE Trans. on Computers, 2001,50(4): 308-321.
    8 Hamdaoui M, Ramanathan P. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Trans. on Computer, 1995,44(12):1443-1451.
    9 张光胜.MPLS接纳控制关键技术研究.长沙:国防科技大学,2008.
    10 Lee T K, Zukerman M. Practical approaches for connection admission control in multiservice networks. Proc. IEEE ICoN'99. 1999: 172-177.
    11 Jamin S, Shenker SJ, Danzig PB. Comparison of measur- ement-based admission control algorithms for controlled- load service. IEEE INFOCOM, 1997: 973-980.
    12 TSE D. Orossglauser M. Measurement-based call admission on control: Analysis and simulation. IEEE INFOCOM, 1997: 981-989.
    13 马小骏,顾冠群.基于测量的接纳控制研究.计算机学报, 2001,24(1):40-45.
    14 李超,张冬松,金士尧.面向流媒体应用的实时可执行概率获取方法研究.计算机应用研究,2010,27(9):3462-3465.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

张冬松,金士尧,陈芳园,李超.基于ASM描述共享网络的实时任务可执行概率设计.计算机系统应用,2011,20(9):48-53,16

Copy
Share
Article Metrics
  • Abstract:1681
  • PDF: 3316
  • HTML: 0
  • Cited by: 0
History
  • Received:January 05,2011
  • Revised:March 06,2011
Article QR Code
You are the first990837Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063