Strong safe realizability of message sequence chart specifications

Authors:
Abdolmajid Mousavi;Behrouz Far;Armin Eberlein;Behrouz Heidari
Affiliations:
Department of Electrical and Computer Engineering, University of Calgary, Calgary, AB, Canada;Department of Electrical and Computer Engineering, University of Calgary, Calgary, AB, Canada;Computer Engineering Department, American University of Sharjah, Sharjah, UEA;Department of Electrical and Computer Engineering, Islamic Azad University of Arak, Arak, Iran
Venue:
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Year:
2007

Citing 8
Cited 3

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Negative scenarios for implied scenario elicitation

Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Safe Realizability of High-Level Message Sequence Charts

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Inference of Message Sequence Charts

IEEE Transactions on Software Engineering
Realizability and verification of MSC graphs

Theoretical Computer Science - Automata, languages and programming
Detecting implied scenarios analyzing non-local branching choices

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Non-local choice and beyond: intricacies of MSC choice nodes

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering

An approach for generating state machine designs from scenarios

SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
Analyzing realizability of choreographies using initiating and responding flows

Proceedings of the 8th International Workshop on Model-Driven Engineering, Verification and Validation
On the realizability of collaborative services

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the notion of safe realizability and implied scenarios for Message Sequence Chart (MSC) specifications with the following contributions: (1) We investigate the cause of implied scenarios and show that even though implied scenarios are an artifact of the distributed and global system behaviour, nevertheless, they are the result of the nondeterminism in the local behaviour of processes, (2) Instead of deadlock states and safe realizability for MSC specifications, we introduce the notions of stuck states and strong safe realizability. Moreover, we use emergent scenarios to name both implied scenarios and those anomalies of MSC specifications that are captured by the notion of strong safe realizability, (3) We give an algorithm that reduces strong safe realizability (or safe realizability) of MSC specifications to strong safe realizability (or safe realizability) of a set of MSCs.