@Article{	  Muscholl99fossacs,
  author	= "Muscholl, Anca",
  title		= "Matching Specifications for Message Sequence Charts",
  year		= "1999",
  volume	= "1578",
  pages		= "273--287",
  publisher	= "Springer",
  address	= "Berlin",
  series	= "Lecture Notes in Computer Science",
  booktitle	= "Second International Conference, FOSSACS'99. Amsterdam,
		  The Netherlands, March 22-28, 1999, Proceedings",
  doi		= "10.1007/3-540-49019-1_19",
  abstract	= "Message sequence charts (MSC) are widely used in the early
		  design of communication protocols. They allow describing
		  the communication skeleton of a system. We consider a basic
		  verification task for MSC graphs, the matching problem via
		  MSC templates. We characterize the complexity of checking
		  properties which are expressible by and-or templates,
		  resp.~by LTL formulas. Both problems are shown to be
		  PSPACE-complete."
}