Proving "no cliques" in a protocol

Authors:
Agathe Merceron
Affiliations:
University of Sydney, Australia
Venue:
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Year:
2001

Citing 3
Cited 0

TTP-A Protocol for Fault-Tolerant Real-Time Systems

Computer
Low-Overhead Time-Triggered Group Membership

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Formal Verification for Time-Triggered Clock Synchronization

DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

The actual trend in the transport industry is to have electronic systems without mechanical back-up, so-called "by-wire" systems. Micro-computers control steering, brakes, power train etc… Robust protocols are needed to make these micro-computers communicate. They should be fault-tolerant and yet not let the micro-computers split into disjoint communicating subsets. TTP is a time-triggered protocol that has been proposed for the automotive industry. In this paper we investigate the clique avoidance mechanism of TTP/C, the last version of TTP, and prove that it is effective, even maybe too strong.