Verification of a parameterized bus arbitration protocol

12Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Model Checking is well established as a verification technique for finite-state systems. Many protocols, while composed of finite-state processes, are parameterized by the number of such processes, hence Model Checking cannot be applied directly to determine correctness of the inherently infinite-state parameterized system. We present a case study on the verification of such a parameterized protocol, the SAE-J1850 data transfer procotol. This is a standard in the automobile industry, where it is used to transmit data between various sensors and micro-controllers in an automobile. The protocol communicates data over a single-wire bus, and provides on-the-fly arbitration between competing transmissions. Our verification effort is interesting from many aspects: it proves correctness for arbitrary instances, is largely automated, and uses abstraction in an essential way. The abstractions used are exact, in the sense that a property is true of the parameterized protocol if and only if it is true of the finite-state abstraction.

Cite

CITATION STYLE

APA

Emerson, E. A., & Namjoshi, K. S. (1998). Verification of a parameterized bus arbitration protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1427 LNCS, pp. 452–463). Springer Verlag. https://doi.org/10.1007/bfb0028766

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free