finite run timed automata

• 时间自动机

finite run timed automata的用法和样例：

例句

1. This paper solves a reachability problem in priced probabilistic timed automata, which is minimal cost ensuring a probabilistic lower bound.
   摘要着重解决代价和概率时间自动机模型的可达性问题，即满足一定概率要求的最小代价问题。