Verifying systems with integer constraints and Boolean predicates: a composite approach
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Low-Overhead Time-Triggered Group Membership
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Formal Verification of the TTP Group Membership Algorithm
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Channel Representations in Protocol Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Verifying Universal Properties of Parameterized Networks
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
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
Symbolic Model Checking with Rich ssertional Languages
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Abstract and Model Check While You Prove
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
An Investigation of Membership and Clique Avoidance in TTP/C
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Proceedings of the 16th IEEE international conference on Automated software engineering
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 |
We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. It has many mechanisms to ensure robustness to faults. In particular, it has an algorithm that allows a station to recognize itself as faulty and leave the communication. This algorithm must satisfy the crucial 'non-clique' property: it is impossible to have two or more disjoint groups of stations communicating exclusively with stations in their own group. In this paper, we propose an automatic verification method for an arbitrary number of stations N and a given number of faults k. We give a faithful abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata. We have checked the nonclique property on this model in the case of one fault, using the ALV tool as well as the LASH tool.