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

被引：0
|
作者：
Poznan Univ of Technology, Poznan, Poland [1 ]
机构：
来源：
Proceedings of the IEEE Symposium on Reliable Distributed Systems | 2000年
关键词：
Algorithms - Computational complexity - Computational geometry - Computer hardware description languages - Data communication systems - Database systems - Finite automata - Linguistics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit concurrency of both competing and supporting events is considered. In this paper we have applied the polygon time 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.
引用
收藏
页码：84 / 93
相关论文
共 50 条
  • [31] Performance Analysis of Distributed Intrusion Detection Protocols for Mobile Group Communication Systems
    Cho, Jin-Hee
    Chen, Ing-Ray
    2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-5, 2009, : 3107 - +
  • [32] Quantum direct communication protocols using discrete-time quantum walk
    Srikara, S.
    Chandrashekar, C. M.
    QUANTUM INFORMATION PROCESSING, 2020, 19 (09)
  • [33] Measurement Tools for Substation Equipment: Testing the Interoperability of Protocols for Time Transfer and Communication
    Anand, D. M.
    Brady, Kevin G., Jr.
    Nguyen, Cuong
    Song, Eugene
    Lee, Kang
    Li-Baboud, Ya-Shian
    Goldstein, Allen
    FitzPatrick, Gerald
    INTERNATIONAL IEEE SYMPOSIUM ON PRECISION CLOCK SYNCHRONIZATION FOR MEASUREMENT, CONTROL, AND COMMUNICATION (ISPCS 2018), 2018, : 43 - 48
  • [34] Discourje: Run-Time Verification of Communication Protocols in Clojure - Live at Last
    Jongmans, Sung-Shik
    FORMAL METHODS, PT II, FM 2024, 2025, 14934 : 158 - 166
  • [35] Polynomial time validation method for channel boundedness of communication protocols (2 processes)
    Suganuma, Tomohisa, 1600, (20):
  • [36] Space-Time Communication Protocols for N-way Relay Networks
    Cui, Tao
    Ho, Tracey
    Kliewer, Joerg
    GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [37] Quantum direct communication protocols using discrete-time quantum walk
    S. Srikara
    C. M. Chandrashekar
    Quantum Information Processing, 2020, 19
  • [38] A heuristic strategy for dynamically controlling the time slot access in reservation communication protocols
    Macii, A
    Macii, E
    PROCEEDINGS OF THE 39TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I-III, 1996, : 1147 - 1149
  • [39] MESSAGE SCHEDULING ALGORITHMS FOR NETWORKED CONTROL SYSTEMS WITH TIME SLOTTED COMMUNICATION PROTOCOLS
    Senol, Sinan
    Leblebicioglu, Kemal
    Schmidt, Ece Gueran
    2008 IEEE 16TH SIGNAL PROCESSING, COMMUNICATION AND APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2008, : 741 - +
  • [40] New protocols for hard real-time communication in the switched LAN environment
    Norden, S
    Manimaran, G
    Murthy, CSR
    23RD ANNUAL CONFERENCE ON LOCAL COMPUTER NETWORKS - PROCEEDINGS, 1998, : 364 - 373
12345