This paper solves a reachability problem in priced probabilistic timed automata, which is minimal cost ensuring a probabilistic lower bound.

 
  • 摘要著(zhù)重解決代價(jià)和概率時(shí)間自動(dòng)機模型的可達性問(wèn)題,即滿(mǎn)足一定概率要求的最小代價(jià)問(wèn)題。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan