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
相关论文
共 50 条
  • [1] Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
    Berendsen, Jasper
    Chen, Taolue
    Jansen, David N.
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 128 - +
  • [2] As cheap as possible: Efficient cost-optimal reachability for Priced Timed Automata
    Larsen, K
    Behrmann, G
    Brinksma, E
    Fehnker, A
    Hune, T
    Pettersson, P
    Romijn, J
    [J]. COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2001, 2102 : 493 - 505
  • [3] Optimal reachability for multi-priced timed automata
    Larsen, Kim Guldstrand
    Rasmussen, Jacob Blum
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 390 (2-3) : 197 - 213
  • [4] Pareto Optimal Reachability Analysis for Simple Priced Timed Automata
    Zhang, Zhengkui
    Nielsen, Brian
    Larsen, Kim Guldstrand
    Nies, Gilles
    Stenger, Marvin
    Hermanns, Holger
    [J]. FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2017, 2017, 10610 : 481 - 495
  • [5] Optimal conditional reachability for multi-priced timed automata
    Larsen, KG
    Rasmussen, JI
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 234 - 249
  • [6] Probably on time and within budget - On reachability in priced probabilistic timed automata
    Berendsen, Jasper
    Jansen, David N.
    Katoen, Joost-Pieter
    [J]. QEST 2006: THIRD INTERNATIONAL CONFERENCE ON THE QUANTITATIVE EVALUATION OF SYSTEMS, 2006, : 311 - +
  • [7] Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
    Abdulla, Parosh Aziz
    Atig, Mohamed Faouzi
    Stenman, Jari
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 62 - 75
  • [8] Concavely-Priced Probabilistic Timed Automata
    Jurdzinski, Marcin
    Kwiatkowska, Marta
    Norman, Gethin
    Trivedi, Ashutosh
    [J]. CONCUR 2009 - CONCURRENCY THEORY, PROCEEDINGS, 2009, 5710 : 415 - +
  • [9] Optimal strategies in priced timed game automata
    Bouyer, P
    Cassez, F
    Fleury, E
    Larsen, KG
    [J]. FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 148 - 160
  • [10] Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata
    Fraezle, Martin
    Swaminathan, Mani
    [J]. FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2009, 5813 : 149 - 163
12345