The University of Southampton
University of Southampton Institutional Repository

Characterizing Communication Channel Deadlocks in Sequence Diagrams

Characterizing Communication Channel Deadlocks in Sequence Diagrams
Characterizing Communication Channel Deadlocks in Sequence Diagrams
UML sequence diagrams (SDs) are a mainstay of requirements specifications for communication protocols. Mauw and Reniers' algebraic (MRA) semantics formally specifies a behaviour for these SDs that guarantees deadlock free processes. Practitioners commonly use communication semantics that differ from MRA, which may result in deadlocks. For example FIFO, token ring, etc. We define a process algebra that is an extension of the MRA semantics for regular sequence diagrams. Our algebra can describe several commonly used communication semantics. Regular SDs are constructed from concurrent message flows via iteration, branching, and sequential composition. Their behaviour is defined in terms of a set of partial orders on the events in the SD. Such partial orders are known as causal orders. We define partial order theoretic properties of a causal order that are particular kinds of race condition. We prove any of the common communication semantics we list either guarantees deadlock free SDs or can result in a deadlock if and only if a causal order of an SD contains one of these types of race condition. This describes a complete classification of deadlocks as specific types of race condition.
305-320
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049

Mitchell, Bill (2008) Characterizing Communication Channel Deadlocks in Sequence Diagrams. IEEE Transactions on Software Engineering, 34 (3), 305-320.

Record type: Article

Abstract

UML sequence diagrams (SDs) are a mainstay of requirements specifications for communication protocols. Mauw and Reniers' algebraic (MRA) semantics formally specifies a behaviour for these SDs that guarantees deadlock free processes. Practitioners commonly use communication semantics that differ from MRA, which may result in deadlocks. For example FIFO, token ring, etc. We define a process algebra that is an extension of the MRA semantics for regular sequence diagrams. Our algebra can describe several commonly used communication semantics. Regular SDs are constructed from concurrent message flows via iteration, branching, and sequential composition. Their behaviour is defined in terms of a set of partial orders on the events in the SD. Such partial orders are known as causal orders. We define partial order theoretic properties of a causal order that are particular kinds of race condition. We prove any of the common communication semantics we list either guarantees deadlock free SDs or can result in a deadlock if and only if a causal order of an SD contains one of these types of race condition. This describes a complete classification of deadlocks as specific types of race condition.

Text
deadlock_TSE_2008.pdf - Version of Record
Download (218kB)

More information

Published date: June 2008
Organisations: Electronics & Computer Science, IT Innovation

Identifiers

Local EPrints ID: 266040
URI: http://eprints.soton.ac.uk/id/eprint/266040
PURE UUID: 1143bd84-9398-4d98-90f4-74dbcfa9d641

Catalogue record

Date deposited: 03 Jul 2008 17:33
Last modified: 14 Mar 2024 08:19

Export record

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.

×