代价和概率时间自动机上概率有界的成本优化可达性-应用科学学报.PDF

27 1 Vol. 27 No. 1 20091 JOURNAL OF APPLIED SCIENCES — Electronics and Information Engineering Jan. 2009 : 0255-8297(2009)01-0084-06 210016 : . . . . : : TP311 : A Cost Optimized Reachability with Probability Bound in Priced Probabilistic Timed Automata ZHANG Jun-hua, HUANG Zhi-qiu, CAO Zi-ning, ZHONG Jing College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China Abstract: This paper solves a reachability problem in priced probabilistic timed automata, which is minimal cost ensuring a probabilistic lower bound. Proper paths that ensure a probability bound in the model are searched. The corresponding priced timed automatons based on these paths are then constructed, and minimal costs obtained. This way, the total minimal cost is naturally obtained. Next, a priced probabilistic timed automaton is extended to a multi-priced probabilistic timed automaton with multiple price variables. A similar reachability problem in the extended model can also be solved, which is minimal cost on primary cost while ensuring probabilistic lower bound and with respect to secondary cost upper bounds. Keywords: timed automata, probability, minimal cost, multiple prices, reachability . (P TA) - . . [6] [4, 7] .