A modular methodology to verify communication protocols

Authors:
Wuxu Peng;Kia Makki
Affiliations:
Department of Computer Science, Southwest Texas State University, San Marcos, Texas, TX 78666, USA;Department of Computer Science, University of Nevada Las Vegas, Las Vegas, NV 89154-4019, USA
Venue:
Computer Communications
Year:
1997

Citing 12
Cited 0

Proving liveness for networks of communicating finite state machines

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
On the progress of communication between two finite state machines

Information and Control
An improved protocol reachability analysis technique

Software—Practice & Experience
Data flow analysis of communicating finite state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of a class of communicating finite state machines

Acta Informatica
Reverse reachability analysis: a new technique for deadlock detection on communicating finite state machines

Software—Practice & Experience
A state-transition-based incremental protocol specification

CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions

Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Reachability Problems for Cyclic Protocols

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

State explosion has been a major problem for verifying communication protocols and distributed algorithms. In this paper we analyze the sources that cause the state explosion problem and propose a modular approach to verifying communication protocols based on networks of communicating finite state machines (CFSMs). Our proposed method is innovative and its time and space complexity is independent of the number of processes in a system. The new methodology can significantly reduce the time and space needed to verify a number of interesting logical properties, as evidenced by our implementations.