A True-Concurrent Interpretation of Behavioural Scenarios. In Proc. of ETAPS 2007 - Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA'07)

Moschoyiannis, Sotiris, Krause, Paul and Shields, MW (2009) A True-Concurrent Interpretation of Behavioural Scenarios. In Proc. of ETAPS 2007 - Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA'07) Electronic Notes in Theoretical Computer Science, 203 (7). pp. 3-22.

Preview	Text (licence) SRI_deposit_agreement.pdf Download (33kB)
Preview	Text fesca07-final.pdf - Accepted version Manuscript Available under License : See the attached licence file. Download (368kB)

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.

Item Type:	Article
Divisions :	Faculty of Engineering and Physical Sciences > Computing Science
Authors :	Name Email ORCID Moschoyiannis, Sotiris S.Moschoyiannis@surrey.ac.uk Krause, Paul P.Krause@surrey.ac.uk Shields, MW
Date :	2009
DOI :	10.1016/j.entcs.2009.03.023
Copyright Disclaimer :	NOTICE: this is the author’s version of a work that was accepted for publication in <b>Electronic Notes in Theoretical Computer Science</b>. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in <b>Electronic Notes in Theoretical Computer Science, 203(7), 2009, DOI 10.1016/j.entcs.2009.03.023</b>.
Depositing User :	Symplectic Elements
Date Deposited :	03 Apr 2014 10:28
Last Modified :	19 Oct 2018 16:45
URI:	http://epubs.surrey.ac.uk/id/eprint/738614

Actions (login required)

View Item

Downloads