We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...
Samuel R. Buss, Christos H. Papadimitriou, John N....
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...