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 条

[31] Priced timed automata: Algorithms and applications
Behrmann, G
Larsen, KG
Rasmussen, JI
FORMAL METHODS FOR COMPONENTS AND OBJECTS, 2005, 3657 : 162 - 182
[32] Counterexamples for timed probabilistic reachability
Aljazzar, H
Hermanns, H
Leue, S
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2005, 3829 : 177 - 195
[33] Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata
D'Argenio, Pedro R.
Hartmanns, Arnd
Legay, Axel
Sedwards, Sean
INTEGRATED FORMAL METHODS (IFM 2016), 2016, 9681 : 99 - 114
[34] Distributed reachability analysis in timed automata
Behrmann G.
International Journal on Software Tools for Technology Transfer, 2005, 7 (1) : 19 - 30
[35] Computing reachability relations in timed automata
Dima, C
17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2002, : 177 - 186
[36] The power of reachability testing for timed automata
Aceto, L
Bouyer, P
Burgueño, A
Larsen, KG
FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 245 - 256
[37] Reachability relations of timed pushdown automata
Clemente, Lorenzo
Lasota, Slawomir
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 117 : 202 - 241
[38] On probabilistic timed automata
Beauquier, D
THEORETICAL COMPUTER SCIENCE, 2003, 292 (01) : 65 - 84
[39] Approximate reachability analysis of timed automata
Balarin, F
17TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 1996, : 52 - 61
[40] Reachability Probabilities in Markovian Timed Automata
Chen, Taolue
Han, Tingting
Katoen, Joost-Pieter
Mereacre, Alexandru
2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 7075 - 7080

← 1 2 3 4 5 →