Timed Automata Can Always Be Made Implementable

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]

Abstract

Abstract is missing.