The concurrency workbench
Abstract The Concurrency Workbench is an automated tool that caters for the analysis of
networks of finite-state processes expressed in Milner's Calculus of Communicating …
networks of finite-state processes expressed in Milner's Calculus of Communicating …
[PDF][PDF] A Semantics Based Verification Tool for Finite State Systems.
Abstract The Concurrency Workbench is an automated tool that caters for the analysis of
concurrent nite-state processes expressed in Milner's Calculus of Communicating Systems …
concurrent nite-state processes expressed in Milner's Calculus of Communicating Systems …
The concurrency workbench: A semantics-based tool for the verification of concurrent systems
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 …
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …
A structural induction theorem for processes
RP Kurshan, KL McMillan - Information and Computation, 1995 - Elsevier
This paper deals with the formal verification of finite state systems that hav an arbitrary
number of isomorphic components. We present a technique for inductively generalizing tests …
number of isomorphic components. We present a technique for inductively generalizing tests …
State space generation: Efficiency and practicality.
AA Valmari - 1990 - elibrary.ru
Degree: xx DegreeYear: 1988 Institute: Tampereen Yliopisto (Finland) Publisher: Tampere
University Of Technology, POB 527, Sf-33101 Tampere, Finland. The problems of making …
University Of Technology, POB 527, Sf-33101 Tampere, Finland. The problems of making …
Partial-order methods for temporal verification
P Wolper, P Godefroid - International Conference on Concurrency Theory, 1993 - Springer
A common approach for verifying a concurrent system is to compute the product of finite-
state descriptions of the processes involved. Unfortunately, the size of this product is …
state descriptions of the processes involved. Unfortunately, the size of this product is …
Regular Model Checking Made Simple and Effcient*
Wepresent a new technique for computing the transitive closure of a regular relation
characterized by a finite-state transducer. The construction starts from the original …
characterized by a finite-state transducer. The construction starts from the original …
[PDF][PDF] A structural induction theorem for processes
RP Kurshan, K McMillan - Proceedings of the eighth annual ACM …, 1989 - dl.acm.org
In verifying finite state systems such as communication protocols or hardware controllers, we
may be required to reason about systems comprised of a finite but effectively unbounded …
may be required to reason about systems comprised of a finite but effectively unbounded …
A survey of regular model checking
Regular model checking is being developed for algorithmic verification of several classes of
infinite-state systems whose configurations can be modeled as words over a finite alphabet …
infinite-state systems whose configurations can be modeled as words over a finite alphabet …
The NCSU concurrency workbench
R Cleaveland, S Sims - … Verification: 8th International Conference, CAV'96 …, 1996 - Springer
Abstract The NCSU Concurrency Workbench is a tool for verifying finite-state systems. A key
feature is its flexibility; its modular design eases the task of adding new analyses and …
feature is its flexibility; its modular design eases the task of adding new analyses and …