A True-Concurrent Interpretation of Behavioural Scenarios

Authors:
Sotiris Moschoyiannis;Paul Krause;Michael W. Shields
Affiliations:
Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK;Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK;Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 1

Models for concurrency

Handbook of logic in computer science (vol. 4)
LSCs: Breathing Life into Message Sequence Charts

Formal Methods in System Design
The Koala Component Model for Consumer Electronics Software

Computer
Synthesis of Behavioral Models from Scenarios

IEEE Transactions on Software Engineering
An Automata Based Interpretation of Live Sequence Charts

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A set-theoretic framework for component composition

Fundamenta Informaticae
Modelling concurrent interactions

Theoretical Computer Science - Algebraic methodology and software technology
Concurrent Logic and Automata Combined: A Semantics for Components

Electronic Notes in Theoretical Computer Science (ENTCS)

When things go wrong: interrupting conversations

FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe a translation of scenarios given in UML 2.0 sequence diagrams into a tuples-based behavioural model that considers multiple access points for a participating instance and exhibits true-concurrency. This is important in a component setting since different access points are connected to different instances, which have no knowledge of each other. Interactions specified in a scenario are modelled using tuples of sequences, one sequence for each access point. The proposed unfolding of the sequence diagram involves mapping each location (graphical position) onto the so-called component vectors. The various modes of interaction (sequential, alternative, concurrent) manifest themselves in the order structure of the resulting set of component vectors, which captures the dependencies between participating instances. In previous work, we have described how (sets of) vectors generate concurrent automata. The extension to our model with sequence diagrams in this paper provides a way to verify the diagram against the state-based model.