ACM Transactions on Programming Languages and Systems · 1993 · 555 citations · 27 references
ComputingComputer ScienceComputer SystemsAlgorithmsDistributed SystemsFormal MethodsConcurrency AnalysisConcurrency VerificationConcurrent System VerificationEquivalence CheckingModel CheckingProtocol VerificationCommunications ProtocolsFinite-state ProcessesFinite-state VerificationModel Checking For ConcurrencyMutual ExclusionMutual Exclusion VerificationProcess Modeling SemanticsProcess Semantics
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.
27
Introduction to automata theory, languages, and computation
Computer Languages · 1980 · 6.9K citations
Wojciech Penczek · Science of Computer Programming · 1990 · 4K citations
Communicating sequential processes
Roger Boyle · Data Processing · 1985 · 2K citations