145
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
132
Voted
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
105
Voted
FORMATS
2007
Springer
15 years 11 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...