Abstract
Distributed systems normally use concurrent systems which communicate via unbounded FIFO channels. Despite well-known difficulties in analyzing such systems, they are of significant interest as they can describe a wide range of communication protocols. In this paper, we have studied the problem of computing the set of reachable states of a FIFO system composed of piecewise components. This problem is closely related to computing the set of all possible channel contents. For each control location which can be realized by the sequence diagrams produced by the SPIN. We present a model checking approach to find set of reachable states of FIFO channels via different paths in which some of the paths end in an erroneous state.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2012 World Congress on Information and Communication Technologies, WICT 2012 |
Pages | 841-845 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 01-12-2012 |
Event | 2012 World Congress on Information and Communication Technologies, WICT 2012 - Trivandrum, India Duration: 30-10-2012 → 02-11-2012 |
Conference
Conference | 2012 World Congress on Information and Communication Technologies, WICT 2012 |
---|---|
Country/Territory | India |
City | Trivandrum |
Period | 30-10-12 → 02-11-12 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Information Systems