Cost optimal reachability with probability bound in priced probabilistic timed automata

被引：0

作者：

Zhang, Junhua ^{[1
]}

Huang, Zhiqiu ^{[1
]}

Zhong, Jing ^{[1
]}

Cao, Zining ^{[1
]}

机构：

[1] Nanjing Univ Aeronaut & Astronaut, Coll Informat Sci & Technol, Nanjing 210016, Jiangsu, Peoples R China

来源：

ADVANCING SCIENCE THROUGH COMPUTATION | 2008年

关键词：

timed automata; probability; minimal cost; reachability;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper solves a reachablity problem in priced probabilistic timed automata(P(2)TA), which is the minimal cost satisfying the,constraint of probability lower bound. Through searching the proper paths having the probability of no less than a bound in the P(2)TA, and constructing the corresponding priced timed automatas based on these paths, the minimal costs are got. The total minimal cost is naturally got.

引用

页码：162 / 164

页数：3