Parameterized Model Checking of Ring Based Message Passing Systems 1st Edition by E Allen Emerson, Vineet Kahlon – Ebook PDF Instant Download/Delivery. 9783540301240
Full download Parameterized Model Checking of Ring Based Message Passing Systems 1st Edition after payment
Product details:
ISBN 10:
ISBN 13: 9783540301240
Author: E Allen Emerson, Vineet Kahlon
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, U n, comprised of finite, but arbitrarily many, copies of a template process U. Unfortunately, it is undecidable in general [3]. In this paper, we consider the PMCP for systems comprised of processes arranged in a ring that communicate by passing messages via tokens whose values can be updated at most a bounded number of times. Correctness properties are expressed using the stuttering-insensitive linear time logic LTL∖X. For bidirectional rings we show how to reduce reasoning about rings with an arbitrary number of processes to rings with up to a certain finite cutoff number of processes. This immediately yields decidability of the PMCP at hand. We go on to show that for unidirectional rings small cutoffs can be achieved, making the decision procedure provably efficient. As example applications, we consider protocols for the leader election problem.
Parameterized Model Checking of Ring Based Message Passing Systems 1st Table of contents:
People also search for Parameterized Model Checking of Ring Based Message Passing Systems 1st:
parameterized model checking of ring
parameterized model checking
parameterized model
parameterized multibranch pipeline
parameterized model number 3