Folk Theorems on the Determinization and Minimization of Timed Automata


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 algorithmically solvable. Minimizing the “resources” of a TA (number of clocks or size of constants) are also unsolvable problems. In this paper we provide simple undecidability… (More)
DOI: 10.1007/978-3-540-40903-8_15


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics