Quantifying the discord: order discrepancies in message sequence charts

E. Elkind, B. Genest, D. Peled, P. Spoletini

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 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.
Original languageAmerican English
Title of host publicationInternational Symposium on Automated Technology for Verification and Analysis
EditorsKedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino, Yoshio Okamura
PublisherSpringer Berlin Heidelberg
StatePublished - 2007

Bibliographical note

Place of conference:Tokyo, Japan


Dive into the research topics of 'Quantifying the discord: order discrepancies in message sequence charts'. Together they form a unique fingerprint.

Cite this