Bus Architectures for Safety-Critical Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Parametric Verification of a Group Membership Algorithm
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
The TTA's Approach to Resilience after Transient Upsets
Real-Time Systems
Parametric Verification of a Group Membership Algorithm
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This is achieved by a mechanism called Clique Avoidance. The Clique Avoidance algorithm always selects one partition (clique) to win and causes all nodes of other partitions to shut down. In this paper, we are going to investigate the properties of this algorithm by analyzing its performance, elaborating the properties, and showing how the Clique Avoidance algorithm interacts with the Implicit Acknowledgement algorithm of TTP/C.