DMCA
Analysing Message Sequence Graph Specifications ∗ (2009)
| Citations: | 3 - 1 self |
BibTeX
@MISC{Chakraborty09analysingmessage,
author = {Joy Chakraborty and K. Narayan Kumar},
title = {Analysing Message Sequence Graph Specifications ∗},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has been no precise description of such a transition system. Several analysis and verification problems concerning MSG specifications can be solved using this transition system. The transition system can be used to construct correct tools for problems like model-checking and detecting implied scenarios in MSG specifications. The transition system we give can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.
