# Probabilisitc timed automaton

I am kind of new to timed automaton domain. I am trying to understand in which way they are different to Markov Decision Process. First I know there objectives is to solve the non-determinism of a MDP. However, is there anything else? Are they still memoryless? I am not able to find any information about this topic.

• @Ecterion Do you mean "States" or "Locations"? The only way to have a final number of states in a PTA is by not having any clocks. But then, you could also just use a non-timed automaton instead. You could do optimization in the sense that you try to find out what the minimal time duration $t$ is for which it is ensured that some specific state is reached at least once with probability >= 0.5 until $t$ time units have passed. – DCTLib Jun 26 '18 at 20:39