## The concurrency workbench: A semantics based tool for the verification of concurrent systems (1991)

### Cached

### Download Links

Venue: | In Proceedings of the Workshop on Automatic Verification Methods for Finite State Machines |

Citations: | 102 - 3 self |

### BibTeX

@INPROCEEDINGS{Cleaveland91theconcurrency,

author = {Rance Cleaveland and Joachim Parrow and Bernhard Steffen},

title = {The concurrency workbench: A semantics based tool for the verification of concurrent systems},

booktitle = {In Proceedings of the Workshop on Automatic Verification Methods for Finite State Machines},

year = {1991},

pages = {24--37}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its breadth: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One experience from our work is that a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms. The Workbench has been applied to the verification of communications protocols and mutual exclusion algorithms and has proven a valuable aid in teaching and research. 1 Introduction This paper describes the Concurrency Workbench [11, 12, 13], a tool that supports the automatic verification of finite-state processes. Such tools are practically motivated: the development of complex distributed computer systems requires sophisticated verification techniques to guarantee correctness, and the increase in detail rapidly becomes unmanageable without computer assistance. Finite-state systems, such as communications protocols and hardware, are particularly suitable for automated analysis because their finitary nature ensures the existence of decision procedures for a wide range of system properties.