Please use this identifier to cite or link to this item:
|Title:||Visual modeling and verification of distributed reactive systems|
|Citation:||COMPUTER SAFETY, RELIABILITY, AND SECURITY, PROCEEDINGS,2788,22-34|
|Abstract:||In this paper, we describe the design and implementation of a tool that has been developed for the specification and verification of distributed reactive systems. A distributed reactive system is composed of a collection of autonomous reactive nodes which communicate over buffered and/or unbuffered channels. Statecharts are industry accepted formal notation to model reactive systems but lack features to model communication. We have extended Statecharts , with primitives for handling communication through buffered and unbuffered channels. The extended notation is called Communicating Statecharts(CS). We have implemented a translator to translate CS into Promela, the input modeling language for the Spin model checker . This allows us to verify temporal properties of the system using Spin model checker. As an illustrative example, we have modeled the well known Leader Election Protocol used in distributed systems using CS notation. The model was translated into Promela using the CSPROM tool and we have used the translated model in Promela to show the correctness of the algorithm by verifying its known properties. The verification was carried out using the Spin model checker. The contribution of the paper is in extending the powerful visual formalism of Statecharts with features required to model distributed systems and interfacing it with a well established model checking tool Spin for formal verification of the model.|
|Appears in Collections:||Proceedings papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.