Specifying Executable Probability Design of Real-Time Task in Resource-Sharing Network with ASM
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • 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
    Related
    Cited by
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 05,2011
  • Revised:March 06,2011
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
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