Parametric Verification of a Group Membership Algorithm

Details Parametric Verification of a Group Membership Algorithm Parametric Verification of a Group Membership Algorithm

2005-05-12

arxiv.org/abs/cs/0505033v1

Computer Science

Logic in Computer Science

34 pages. To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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 an abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata. We have checked the non-clique property on this model in the case of one fault, using the ALV tool as well as the LASH tool.

Affiliated with

Also associated with

No associations

Rating

Parametric Verification of a Group Membership Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parametric Verification of a Group Membership Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parametric Verification of a Group Membership Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162834