Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of forma...

Full description

Bibliographic Details

Main Author:	Korver, Henri P. (Author)
Format:	Book
Language:	English
Published:	Amsterdam 1991
Series:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,8
Subjects:	Computer networks
Summary:	Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of formal verification methods of software descriptions. At the moment bisimulation is one of the most popular criteria for guaranteeing correctness of concurrent system descriptions. In this approach, concurrent systems are modeled as transition graphs, and verification amounts to establishing that the graph representing the implementation of the system is bisimilar to the graph representing the specification of the system The main advantage of this approach is that bisimulation can be decided efficiently and fully automatically on finite transition graphs. This paper contains a comparative evaluation of bisimulation techniques, as found in the following tools. ACP Bisimulation Tool, Branching Bisimulation Tool, Aldebaran, The Concurrency Workbench (CWB), Tool for Automatic Verification (TAV), Winston, Auto, Autograph and Ecrins. Further, the usability of these tools for PSF [MV89,MV90] is investigated. PSF is here proposed as a suitable representative of a wide range of formalisms that have come up for specifying concurrent systems.
Physical Description:	28 S.