The University of Southampton
University of Southampton Institutional Repository

Quantifying the Discord: Order Discrepancies in Message Sequence Charts

Quantifying the Discord: Order Discrepancies in Message Sequence Charts
Quantifying the Discord: Order Discrepancies in Message Sequence Charts
Message Sequence Charts (MSCs) and High-level Message Sequence Charts (HMSC) are formalisms used to describe scenarios of message passing protocols. We propose using Allen's logic to study the temporal order of the messages. We introduce the concept of {\em discord} to quantify the order discrepancies between messages in different nodes of an HMSC and study its algorithmic properties. We show that while discord of a pair of messages is hard to compute in general, the problem becomes polynomial-time computable if the number of nodes of the HMSC or the number of processes is constant. Moreover, for a given HMSC, it is always computationally easy to identify a pair of messages that exhibits the worst-case discord, and compute the discord of this pair.
Elkind, Edith
7a013473-5cd0-4e41-b907-66b30a04a400
Genest, Blaise
bae5490e-fc7d-4a27-8da9-88fe2ecbc936
Peled, Doron
868d6942-837e-4733-bef7-5d08ef9edb8b
Spoletini, Paola
62287d63-13cc-48b6-b300-0a8c2b6fc4ad
Elkind, Edith
7a013473-5cd0-4e41-b907-66b30a04a400
Genest, Blaise
bae5490e-fc7d-4a27-8da9-88fe2ecbc936
Peled, Doron
868d6942-837e-4733-bef7-5d08ef9edb8b
Spoletini, Paola
62287d63-13cc-48b6-b300-0a8c2b6fc4ad

Elkind, Edith, Genest, Blaise, Peled, Doron and Spoletini, Paola (2007) Quantifying the Discord: Order Discrepancies in Message Sequence Charts. At 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07) 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), Japan.

Record type: Conference or Workshop Item (Paper)

Abstract

Message Sequence Charts (MSCs) and High-level Message Sequence Charts (HMSC) are formalisms used to describe scenarios of message passing protocols. We propose using Allen's logic to study the temporal order of the messages. We introduce the concept of {\em discord} to quantify the order discrepancies between messages in different nodes of an HMSC and study its algorithmic properties. We show that while discord of a pair of messages is hard to compute in general, the problem becomes polynomial-time computable if the number of nodes of the HMSC or the number of processes is constant. Moreover, for a given HMSC, it is always computationally easy to identify a pair of messages that exhibits the worst-case discord, and compute the discord of this pair.

PDF EGPS07.pdf - Other
Download (221kB)

More information

Published date: 2007
Additional Information: Event Dates: October 22 -2 5, 2007
Venue - Dates: 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), Japan, 2007-10-22
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 264316
URI: https://eprints.soton.ac.uk/id/eprint/264316
PURE UUID: 990fda18-8adb-4871-a36b-11de74554261

Catalogue record

Date deposited: 17 Jul 2007
Last modified: 18 Jul 2017 07:37

Export record

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 https://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.

×