Analysing message sequence graph specifications

Authors:
Joy Chakraborty;Deepak D'Souza;K. Narayan Kumar
Affiliations:
Motorola India Private Limited, Bangalore, India;Computer Science and Automation, Indian Institute of Science, Bangalore, India;Chennai Mathematical Institute, Siruseri, India
Venue:
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Year:
2010

Citing 10
Cited 1

Semi-commutations

Information and Computation
A note on the commutative closure of star-free languages

Information Processing Letters
Detecting implied scenarios in message sequence chart specifications

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Model Checking of Message Sequence Charts

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Inference of Message Sequence Charts

IEEE Transactions on Software Engineering
Incremental elaboration of scenario-based specifications and behavior models using implied scenarios

ACM Transactions on Software Engineering and Methodology (TOSEM)
A theory of regular MSC languages

Information and Computation
Detecting implied scenarios analyzing non-local branching choices

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
LTSA-MSC: tool support for behaviour model elaboration using implied scenarios

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Visualizing the network of software agents for verification of multiagent systems

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.