Causal message sequence charts

Authors:
Thomas Gazagnaire;Blaise Genest;Loic Hélouët;P. S. Thiagarajan;Shaofa Yang
Affiliations:
IRISA/ENS Cachan, Campus de Beaulieu, Rennes Cedex, France;IRISA/CNRS, Campus de Beaulieu, Rennes Cedex, France;IRISA/INRIA, Campus de Beaulieu, Rennes Cedex, France;School of Computing, NUS, Singapore;IRISA/INRIA, Campus de Beaulieu, Rennes Cedex, France
Venue:
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Year:
2007

Citing 10
Cited 1

The Book of Traces

The Book of Traces
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Compositional Message Sequence Charts

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Recognizable Sets of Message Sequence Charts

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Message Sequence Charts

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Deciding Properties for Message Sequence Charts

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Regular sets of infinite message sequence charts

Information and Computation
Infinite-state high-level MSCs: Model-checking and realizability

Journal of Computer and System Sciences
A theory of regular MSC languages

Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Information and Computation

Causal Message Sequence Charts

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scenario languages based on Message Sequence Charts (MSCs) and related notations have been widely studied in the last decade [14,13,2,9,6,12,8]. The high expressive power of scenarios renders many basic problems concerning these languages undecidable. The most expressive class for which several problems are known to be decidable is one which possesses a behavioral property called "existentially bounded". However, scenarios outside this class are frequently exhibited by asynchronous distributed systems such as sliding window protocols. We propose here an extension of MSCs called Causal Message Sequence Charts, which preserves decidability without requiring existential bounds. Interestingly, it can also model scenarios from sliding window protocols. We establish the expressive power and complexity of decision procedures for various subclasses of Causal Message Sequence Charts.