Quantifying the Discord: Order Discrepancies in Message Sequence Charts
Elkind, Edith, Genest, Blaise, Peled, Doron and Spoletini, Paola (2007) Quantifying the Discord: Order Discrepancies in Message Sequence Charts. In, 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), Tokyo, Japan, 22 - 02 Oct 2007.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (216Kb) |
Description/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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Event Dates: October 22 -2 5, 2007 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 264316 |
| Date Deposited: | 17 Jul 2007 |
| Last Modified: | 02 Mar 2012 12:21 |
| Contributors: | Elkind, Edith (Author) Genest, Blaise (Author) Peled, Doron (Author) Spoletini, Paola (Author) |
| Date: | 2007 |
| Additional Information: | Event Dates: October 22 -2 5, 2007 |
| Status: | Published |
| Further Information: | Google Scholar |
| ISI Citation Count: | 0 |
| URI: | http://eprints.soton.ac.uk/id/eprint/264316 |
Actions (login required)
 |
View Item |
