@TechReport{	  it:2000-025,
  author	= {Huimin Lin and Wang Yi},
  title		= {A Complete Axiomatisation for Timed Automata},
  institution	= {Department of Information Technology, Uppsala University},
  department	= {Division of Computer Systems},
  year		= {2000},
  number	= {2000-025},
  month		= sep,
  note		= {A short version of this paper will be included in the
		  proceedings of 20th FST-TCS, 2000},
  abstract	= {Timed automata has been recognised as a fundamental model
		  for real time systems, but it still lacks a satisfactory
		  algebraic theory. This paper fills the gape by presenting a
		  complete proof system for timed automata, in which the
		  equalities between pairs of timed automata that are timed
		  bisimilar can be derived. The proof of the completeness
		  result relies on the introduction of the notion of symbolic
		  timed bisimulation. }
}