跳到主要导航 跳到搜索 跳到主要内容

Quantitative verification of the bounded retransmission protocol

  • Xu Guo*
  • , Ming Xu
  • , Zongyuan Yang
  • *此作品的通讯作者
  • East China Normal University
  • Shanghai Dianji University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In order to verify the reliability of the bounded retransmission protocol, probabilistic model checking technology is used in this paper. The integer semantics approach is introduced, which allows working directly at the level of the original probabilistic timed automaton (PTA). In such a method, clocks are viewed as counters storing nonnegative integer values, which increase as time passes. The PTA modeling the system can then be seen as a discrete-time Markov chain. Based on this fact, the protocol is modeled directly with DTMC. Properties are described in probabilistic computation tree logic. By making an analysis of the quantitative properties of the protocol, a threshold is obtained. Experimental result shows that no matter how many chunks to be transmitted, if the maximum retransmitted time is greater than or equal to 3, the protocol can be considered reliable. Method in this paper can not only verify the correctness of a system but also make analysis of nonfunctional indices of a system such as reliability or performance.

源语言英语
主期刊名Computer Engineering and Networking - Proceedings of the 2013 International Conference on Computer Engineering and Network, CENet 2013
出版商Springer Verlag
1245-1252
页数8
ISBN(印刷版)9783319017655
DOI
出版状态已出版 - 2014
活动3rd International Conference on Computer Engineering and Network, CENet 2013 - Shanghai, 中国
期限: 20 7月 201321 7月 2013

出版系列

姓名Lecture Notes in Electrical Engineering
277 LNEE
ISSN(印刷版)1876-1100
ISSN(电子版)1876-1119

会议

会议3rd International Conference on Computer Engineering and Network, CENet 2013
国家/地区中国
Shanghai
时期20/07/1321/07/13

指纹

探究 'Quantitative verification of the bounded retransmission protocol' 的科研主题。它们共同构成独一无二的指纹。

引用此