Chakraborty, Joy and Souza, Deepak D and Narayan Kumar, K (2010) Analysing Message Sequence Graph Specifications. In: Proceedings of 4th International Symposium on Leveraging Applications of Formal Methods ISoLA) 2010, LNCS 6415, 2010.Full text not available from this repository.
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||20 Dec 2011 06:08|
|Last Modified:||20 Dec 2011 06:08|
Actions (login required)