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 条
  • [21] Cost Analysis for Embedded Systems: Experiments with Priced Timed Automata
    Ovatman, Tolga
    Brekling, Aske W.
    Hansen, Michael R.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2010, 238 (06) : 81 - 95
  • [22] Resource-optimal scheduling using priced timed automata
    Rasmussen, JI
    Larsen, KG
    Subramani, K
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2004, 2988 : 220 - 235
  • [23] Discount-Optimal Infinite Runs in Priced Timed Automata
    Fahrenberg, Uli
    Larsen, Kim G.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 239 (0C) : 179 - 191
  • [24] Difference Bound Constraint Abstraction for Timed Automata Reachability Checking
    Wang, Weifeng
    Jiao, Li
    FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2015, 2015, 9039 : 146 - 160
  • [25] Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata
    Kwiatkowska, Marta
    Norman, Gethin
    Parker, David
    MODELS, ALGORITHMS, LOGICS AND TOOLS: ESSAYS DEDICATED TO KIM GULDSTRAND LARSEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2017, 10460 : 289 - 309
  • [26] An MTBDD-based implementation of forward reachability for probabilistic timed automata
    Wang, F
    Kwiatkowska, M
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2005, 3707 : 385 - 399
  • [27] Optimal-reachability and control for acyclic weighted timed automata
    La Torre, Salvatore
    Mukhopadhyay, Supratik
    Murano, Aniello
    IFIP Advances in Information and Communication Technology, 2002, 96 : 485 - 497
  • [28] Optimal-reachability and control for acyclic weighted timed automata
    La Torre, S
    Mukhopadhyay, S
    Murano, A
    FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 485 - 497
  • [29] Revisiting Reachability in Timed Automata
    Quaas, Karin
    Shirmohammadi, Mahsa
    Worrell, James
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [30] Costs and rewards in priced timed automata
    Fraenzle, Martin
    Shirmohammadi, Mahsa
    Swaminathan, Mani
    Worrell, James
    INFORMATION AND COMPUTATION, 2022, 282
12345