Decidability of a class of dual communicating finite state machines

Authors:
H. Mountassir
Affiliations:
Laboratoire d'Informatique, Besançon, France
Venue:
ACM SIGOPS Operating Systems Review
Year:
1996

Citing 3
Cited 0

Design and validation of computer protocols

Design and validation of computer protocols
Testing for unboundedness of fifo channels

STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
On Communicating Finite-State Machines

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of techniques have been proposed to validate systems of communicating machines which exchange exclusively messages through FIFO channels. The reachability analysis is a well-known and most popular technique implemented in several tools of validation. Two majors questions are discussed : the finiteness of the reachability graph and the state explosion problem. In this paper we clarify a restricted class of dual machines and its applicability of real protocols. Our investigation at the first time concern sufficient conditions to ensure the finiteness of the reachability graph. In the second part of the paper we confirm the results using the fair reachability analysis in which global states are generated by forcing the two machines in equal speeds.