%0 Conference Proceedings
%F BLMST-concur11
%A Bouyer, Patricia
%A Larsen, Kim G.
%A Markey, Nicolas
%A Sankur, Ocan
%A Thrane, Claus
%T Timed automata can always be made implementable
%B {P}roceedings of the 22nd {I}nternational {C}onference on {C}oncurrency {T}heory ({CONCUR}'11)
%E Katoen, Joost-Pieter
%E König, Barbara
%V 	 6901
%P 76-91
%S Lecture Notes in Computer Science
%I Springer
%C Aachen, Germany
%U http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLMST-concur11.pdf
%U http://dx.doi.org/10.1007/978-3-642-23217-6_6
%8 September
%D 2011