Decidability of the termination problem for completely specified protocols

SummaryIn this paper, we present a new class of protocols called completely specified protocols. Each protocol is represented as a system of Communicating Finite State Machines. The class of completely specified protocols is such that each message that can be received by a Finite State Machine, can also be received in every local state of the Finite State Machine. These protocols are important because they allow for modelling unbounded fifo channels and make it possible to decide the Termination Problem, that is whether the reachability tree is finite or not. An example of our techniques is given using a practical problem concerning link protocols.

[1]  Daniel Brand,et al.  Towards Analyzing and Synthesizing Protocols , 1980, IEEE Trans. Commun..

[2]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[3]  Hsu-Chun Yen,et al.  Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata , 1986, Theor. Comput. Sci..

[4]  Mohamed G. Gouda,et al.  Closed Covers: To Verify Progress for Communicating Finite State Machines , 1984, IEEE Transactions on Software Engineering.

[5]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[6]  Jan K. Pachl,et al.  Protocol Description and Analysis Based on a State Transition Model with Channel Expressions , 1987, PSTV.

[7]  Donald D. Cowan,et al.  Reachability analysis of protocols with FIFO channels , 1983, SIGCOMM 1983.

[8]  Colin H. West,et al.  An Improved Protocol Validation Technique , 1982, Comput. Networks.

[9]  Raymond E. Miller.  The construction of self-synchronizing finite state protocols , 2005, Distributed Computing.

[10]  Ming T. Liu,et al.  Protocol verification using reachability analysis: the state space explosion problem and relief strategies , 1987, Computer Communication Review.

[11]  A. Udaya Shankar,et al.  Protocol Verification via Projections , 1984, IEEE Transactions on Software Engineering.

[12]  C. V. Ramamoorthy,et al.  Synthesis of two-party error-recoverable protocols , 1986, SIGCOMM '86.

[13]  Mohamed G. Gouda,et al.  A discipline for constructing multiphase communication protocols , 1985, TOCS.

[14]  S. Aggarwal,et al.  Foreword: Special Issue on Tools for Computer Communication Systems , 1988 .

[15]  Ming T. Liu,et al.  Protocol verification using reachability analysis: the state space explosion problem and relief strategies , 1987, SIGCOMM '87.

[16]  Mohamed G. Gouda,et al.  On deadlock detection in systems of communicating finite state machines , 1987 .

[17]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[18]  Mohamed G. Gouda,et al.  Synthesis of Communicating Finite-State Machines with Guaranteed Progress , 1984, IEEE Trans. Commun..

[19]  D. Koenig.  Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[20]  Alain Finkel,et al.  A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems , 1987, ICALP.

[21]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[22]  Alain Finkel,et al.  Structuration des systèmes de transitions-applications au contrôle du parallélisme par Files Fifo , 1986 .

[23]  Alain Finkel,et al.  A Survey on the Decidability Questions for Classes of FIFO Nets , 1988, European Workshop on Applications and Theory of Petri Nets.

[24]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.