Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Cleaveland et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: