finite run timed automata
英
美
- 时间自动机
双语例句
- This paper solves a reachability problem in priced probabilistic timed automata, which is minimal cost ensuring a probabilistic lower bound.
摘要着重解决代价和概率时间自动机模型的可达性问题，即满足一定概率要求的最小代价问题。
相关词汇
大家正在查
Copyright © 2023 256查询网 All Rights Reserved
