Compositional reachability analysis using process algebra

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

Abstract

State explosion is the primary obstacle to practical application of reachability analysis techniques for concurrent systems. State explosion can be substantially controlled by using process algebra to achieve compositional (divide-and-conquer) analysis. A prototype tool incorporating process algebra is described. The promise and problems of the approach are illustrated by applying the tool to an example that incorporates the alternating bit protocol as a module.

References Powered by Scopus

Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications

2364Citations
N/AReaders
Get full text

A Theory of Communicating Sequential Processes

789Citations
N/AReaders
Get full text

Process algebra for synchronous communication

623Citations
N/AReaders
Get full text

Cited by Powered by Scopus

CADP 2011: A toolbox for the construction and analysis of distributed processes

237Citations
N/AReaders
Get full text

Structural Testing of Concurrent Programs

147Citations
N/AReaders
Get full text

Evaluating deadlock detection methods for concurrent software

145Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Yeh, W. J., & Young, M. (1991). Compositional reachability analysis using process algebra. In Proceedings of the Symposium on Testing, Analysis, and Verification, TAV 1991 (pp. 49–59). Association for Computing Machinery, Inc. https://doi.org/10.1145/120807.120812

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 5

83%

Lecturer / Post doc 1

17%

Readers' Discipline

Tooltip

Computer Science 6

100%

Save time finding and organizing research with Mendeley

Sign up for free