Detection of livelocks in communication protocols by means of a polygon time structure

As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows one to verify communication protocols, in which the explicit concurrency of both competing and supporting events is considered. The authors apply the polygon time structure to the verification of dynamic properties (like livelocks) of a simple protocol. As a result, they show that an application of the previously used interval time structure may lead to the evaluation of a protocol as incorrect, while it is livelock free.

[1]  Gerard J. Holzmann,et al.  Protocol design: redefining the state of the art , 1992, IEEE Software.

[2]  Rajeev Alur,et al.  Model-Checking of Real-Time Systems: A Telecommunications Application Experience Report , 1997, Proceedings of the (19th) International Conference on Software Engineering.

[3]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[4]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[5]  C. H. West,et al.  General technique for communications protocol validation , 1978 .

[6]  Jerzy Brzeziński.  A Polygon Time Structure for Protocol Verification , 1999 .

[7]  Richard Lai,et al.  Communication Protocol Specification and Verification , 1998 .

[8]  Ron Koymans,et al.  (Real) Time: A Philosophical Perspective , 1991, REX Workshop.

[9]  Mohamed G. Gouda,et al.  Livelock Detection in Networks of Communicating Finite State Machines , 1984 .

[10]  Michal Sajkowski.  Protocol Verification Techniques: Status Quo and Perspectives , 1984, PSTV.

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

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

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[14]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[15]  Fuchun Joseph Lin,et al.  An integrated approach to verification and performance analysis of communication protocols , 1988 .

[16]  Elzbieta Hajnicz.  Time Structures , 1996, Lecture Notes in Computer Science.

[17]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[18]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[21]  Kurt Mehlhorn,et al.  A platform for combinatorial and geometric computing , 1995 .