Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane. Timed Automata Can Always Be Made Implementable. In Joost-Pieter Katoen, Barbara König, editors, CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings. Volume 6901 of Lecture Notes in Computer Science, pages 76-91, Springer, 2011. [doi]
@inproceedings{BouyerLMST11, title = {Timed Automata Can Always Be Made Implementable}, author = {Patricia Bouyer and Kim G. Larsen and Nicolas Markey and Ocan Sankur and Claus R. Thrane}, year = {2011}, doi = {10.1007/978-3-642-23217-6_6}, url = {http://dx.doi.org/10.1007/978-3-642-23217-6_6}, researchr = {https://researchr.org/publication/BouyerLMST11}, cites = {0}, citedby = {0}, pages = {76-91}, booktitle = {CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings}, editor = {Joost-Pieter Katoen and Barbara König}, volume = {6901}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-23216-9}, }