The University of Southampton
University of Southampton Institutional Repository

Resolving race conditions in asynchronous partial order scenarios

Resolving race conditions in asynchronous partial order scenarios
Resolving race conditions in asynchronous partial order scenarios
Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper, also proves the results can be generalized to a subclass of iterative scenarios.
767-784
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049

Mitchell, Bill (2005) Resolving race conditions in asynchronous partial order scenarios. IEEE Transactions on Software Engineering, 31 (9), 767-784. (doi:10.1109/TSE.2005.104).

Record type: Article

Abstract

Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper, also proves the results can be generalized to a subclass of iterative scenarios.

Text
IEEE_TSE_2005.pdf - Other
Download (258kB)

More information

Published date: September 2005
Organisations: Electronics & Computer Science, IT Innovation

Identifiers

Local EPrints ID: 266042
URI: http://eprints.soton.ac.uk/id/eprint/266042
PURE UUID: 4ea5b37e-9207-4d6d-b158-fd8e96e9dc15

Catalogue record

Date deposited: 03 Jul 2008 21:49
Last modified: 14 Mar 2024 08:19

Export record

Altmetrics

Contributors

Author: Bill Mitchell

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×