@Article{	  Muscholl98fossacs,
  author	= "Muscholl, Anca and Peled, Doron and Su, Zhendong",
  title		= "Deciding properties for message sequence charts",
  year		= "1998",
  volume	= "1378",
  pages		= "226--242",
  publisher	= "Springer",
  address	= "Berlin",
  series	= "Lecture Notes in Computer Science",
  booktitle	= "First International Conference, FOSSACS'98. Lisbon,
		  Portugal, March 28 - April 4, 1998, Proceedings",
  doi		= "10.1007/BFb0053553",
  abstract	= "Message sequence charts (MSC) are commonly used in
		  designing communication systems. They allow describing the
		  communication skeleton of a system and can be used for
		  finding design errors. First, a specification formalism
		  that is based on MSC graphs, combining finite message
		  sequence charts, is presented. We present then an automatic
		  validation algorithm for systems described using the
		  message sequence charts notation. The validation problem is
		  tightly related to a natural language-theoretic problem
		  over {\em semi-traces} (a generalization of Mazurkiewicz
		  traces, which represent partially ordered executions). We
		  show that a similar and natural decision problem is
		  undecidable."
}