.png){kind=icon}
返回
Protocol Verification by Simultaneous Reachability Graph
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2017.2695191.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Non-executable transitions, deadlock states, and livelock cycles are typical errors in communication protocols. Reachability analysis is a direct method to detect these errors, while the state-space explosion is the most severe limitation to such a method. In this letter, a relief strategy is proposed by using the simultaneous reachability graph-a simple graph generated by the simultaneous execution of transitions that are executable on a global state. It is found out that both the correctness and types of errors of a protocol can be detected from the structure of such a graph. An algorithm for plotting the simultaneous reachability graph is developed and its complexity is considered. A numerical example about the handshake protocol is used to illustrate how the method works in practical applications.
Keyword:
Communication protocol
correctness verification
simultaneous reachability graph
state space analysis
algorithm
Petri net
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。