An approach to cyclic protocol validation

Authors:
Hong Liu;Raymond E. Miller
Affiliations:
Department of Computer Science, University of Maryland at College Park, College Park, MD 20742, USA;Department of Computer Science, University of Maryland at College Park, College Park, MD 20742, USA
Venue:
Computer Communications
Year:
1996

Citing 9
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
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
Experience with formal methods in protocol development

ACM SIGCOMM Computer Communication Review
Generalized fair reachability analysis for cyclic protocols

IEEE/ACM Transactions on Networking (TON)
On Communicating Finite-State Machines

Journal of the ACM (JACM)
On improving reduced reachability analysis

FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions

ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
Reachability Problems for Cyclic Protocols

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Livelock Detection in Networks of Communicating Finite State Machines

Livelock Detection in Networks of Communicating Finite State Machines

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, the notion of fair reachability is generalized to cyclic protocols with more than two processes, where all the processes in a protocol are connected via a unidirectional ring and each process might contain internal transitions and can be non-deterministic. We identify 'indefiniteness' as a new type of logical error due to reachable internal transition cycles. By properly incorporating internal transitions into the formulation, we show that, with a few modifications, all the previous results established for cyclic protocols without non-deterministic and internal transitions still hold in the augmented model. Furthermore, by combining fair progress and maximal progress during state exploration, we prove that the following three problems are all decidable for Q, the class of cyclic protocols with finite fair reachable state spaces: (1) global state reachability; (2) abstract state reachability; and (3) execution cycle reachability. In the course of the investigation, we also show that detection of k-indefiniteness and k-livelock are decidable for Q.