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 条
  • [41] REACHABILITY AND LIVENESS IN PARAMETRIC TIMED AUTOMATA
    Andre, Etienne
    Lime, Didier
    Roux, Olivier H.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 18 (01)
  • [42] Symbolic and Compositional Reachability for Timed Automata
    Larsen, Kim Guldstrand
    REACHABILITY PROBLEMS, 2010, 6227 : 24 - 28
  • [43] The power of reachability testing for timed automata
    Aceto, L
    Bouyer, P
    Burgueño, A
    Larsen, KG
    THEORETICAL COMPUTER SCIENCE, 2003, 300 (1-3) : 411 - 475
  • [44] Robust parametric reachability for timed automata
    Doyen, Laurent
    INFORMATION PROCESSING LETTERS, 2007, 102 (05) : 208 - 213
  • [45] Statistical Model Checking for Priced Timed Automata
    Bulychev, Peter
    David, Alexandre
    Larsen, Kim Guldstrand
    Legay, Axel
    Mikucionis, Marius
    Poulsen, Danny Bogsted
    Wang, Zheng
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (85): : 1 - 16
  • [46] Revisiting reachability in Polynomial Interrupt Timed Automata
    Bérard, Béatrice
    Haddad, Serge
    Information Processing Letters, 2022, 174
  • [47] Monte Carlo Tree Search for Priced Timed Automata
    Jensen, Peter Gjol
    Kiviriga, Andrej
    Larsen, Kim Guldstrand
    Nyman, Ulrik
    Mijacika, Adriana
    Mortensen, Jeppe Hoiriis
    QUANTITATIVE EVALUATION OF SYSTEMS (QEST 2022), 2022, 13479 : 381 - 398
  • [48] Relating Reachability Problems in Timed and Counter Automata
    Haase, Christoph
    Ouaknine, Joel
    Worrell, James
    FUNDAMENTA INFORMATICAE, 2016, 143 (3-4) : 317 - 338
  • [49] Statistical Model Checking for Networks of Priced Timed Automata
    David, Alexandre
    Larsen, Kim G.
    Legay, Axel
    Mikucionis, Marius
    Poulsen, Danny Bogsted
    van Vliet, Jonas
    Wang, Zheng
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2011, 6919 : 80 - +
  • [50] Concavely-Priced Timed Automata (Extended Abstract)
    Jurdzinski, Marcin
    Trivedi, Ashutosh
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2008, 5215 : 48 - 62
12345