@InProceedings{	  die93mfcs,
  author	= "Volker Diekert",
  address	= "Heidelberg",
  booktitle	= "Proc. 18th Symposium on Mathematical Foundations of
		  Computer Science (MFCS'93), Gdansk (Poland), 1993",
  editor	= "A. Borzyszkowski and others",
  note		= "Invited Lecture",
  volume	= "711",
  pages		= "68--82",
  publisher	= "Springer-Verlag",
  series	= "Lecture Notes in Computer Science",
  title		= "Complex and complex-like traces",
  year		= "1993",
  abstract	= "The definition and some known results on complex traces
		  are reviewed. We also discuss some open questions
		  concerning the Poset-property of complex traces. The main
		  new contribution of the paper is the presentation of the
		  notion of complex-like trace. Every complex trace is
		  complex-like, but there are other objects such as a finite
		  trace with some additional non-empty alphabetic
		  information. In the sequential case this information is
		  nothing else than explicit termination.Together with
		  concurrency the concept leads to a rich mathematical
		  structure. Our results show that complex-like traces form a
		  prime algebraic and coherently complete Scott-domain. Our
		  main theorem shows that the concatenation on this domain is
		  continuous.",
  doi		= "10.1007/3-540-57182-5_4"
}