A decomposition method for the analysis and design of finite state protocols

Authors:
Tat Y. Choi;Raymond E. Miller
Affiliations:
Georgia Institute of Technology, Atlanta, Georgia;Georgia Institute of Technology, Atlanta, Georgia
Venue:
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Year:
1983

Citing 1
Cited 9

Network Protocols

ACM Computing Surveys (CSUR)

Protocol verification using reachability analysis: the state space explosion problem and relief strategies

SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Constructing Protocols with Alternative Functions

IEEE Transactions on Computers - Special issue on protocol engineering
A methodology for designing communication protocols

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A discipline for constructing multiphase communication protocols

ACM Transactions on Computer Systems (TOCS)
An Improved Method for Constructing Multiphase Communications Protocols

IEEE Transactions on Computers
PROSPEC: An Interactive Programming Environment for Designing and Verifying Communication Protocols

IEEE Transactions on Software Engineering
Constraint-based structuring of network protocols

Distributed Computing
Verifying liveness properties of multifunction composite protocols

Computer Communications
Research: Protocol validation by simultaneous reachability analysis

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finite state automata have been applied with success to the modeling of Computer Network Protocols. The interaction of finite state machines can be very complex especially if the protocol involves a large number of states. To counteract the complexity of analysis and design, we propose an approach of decomposition. Through this approach, the protocol graph can be partitioned into subgraphs each having a unique entry node and zero or more exit nodes. The exit nodes of one subgraph can be connected only to the entry nodes of other subgraphs. From the standpoint of protocol analysis, the correctness of the entire protocol graph can be inferred from the correctness of individual protocol subgraphs. From the standpoint of protocol design, the individual protocol subgraphs can be designed to correspond to different phases of the protocol. If the individual protocol subgraphs are designed correctly and the connections between subgraphs conform to the structure discussed above, then we show that the entire protocol graph will operate correctly.