Analysing Message Sequence Graph Specifications
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.
KeywordsTransition System Transitive Closure Communication Graph Trace Model Detailed Construction
Unable to display preview. Download preview PDF.
- 3.Chakraborty, J., D’Souza, D., Narayan Kumar, K.: Analysing Message Sequence Graph Specifications, Technical Report IISc-CSA-TR-2009-1, CSA Department, IISc (2009), http://www.csa.iisc.ernet.in/TR/2009/1/
- 10.Uchitel, S.: LTSA-MSC tool (2001), http://www.doc.ic.ac.uk/~su2/Synthesis/
- 11.Uchitel, S.: Incremental Elaboration of Scenario Based Specifications and Behavior Models Using Implied Scenarios. PhD thesis, Imperial College (2003)Google Scholar
- 13.Uchitel, S., Kramer, J., Magee, J.: Detecting implied scenarios in message sequence chart specifications. In: ESEC / SIGSOFT FSE, pp. 74–82 (2001)Google Scholar