Quantifying the discord: order discrepancies in message sequence charts

Authors:
Edith Elkind;Blaise Genest;Doron Peled;Paola Spoletini
Affiliations:
School of Electronics and Computer Science, University of Southampton, UK;CNRS, IRISA, Rennes Cedex, France;Department of Computer Science, University of Warwick, Coventry, United Kingdom and Department of Computer Science, Bar Ilan University, Ramat Gan, Israel;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy
Venue:
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Year:
2007

Citing 12
Cited 0

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals

Communications of the ACM
Algorithm 97: Shortest path

Communications of the ACM
LSCs: Breathing Life into Message Sequence Charts

Formal Methods in System Design
Specification and Verification of Message Sequence Charts

FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine

Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
Bounded MSC communication

Information and Computation
Realizability and verification of MSC graphs

Theoretical Computer Science - Automata, languages and programming
Detecting races in ensembles of message sequence charts

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

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 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.