Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure

  • Authors:
  • Jerzy Brzezinski;Michal Sajkowski

  • Affiliations:
  • -;-

  • Venue:
  • SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows verifying communication protocols, in which the explicit concurrency of both competing and supporting events is considered. In this paper, we have applied the polygon tome structure to the verification of dynamic properties (like livelocks) of a simple protocol. As a result, we have shown 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.