YMCA - Why Markov Chain Algebra?-

被引：10

作者：

Bravetti, Mario ^{[1
]}

Hermanns, Holger ^{[2
,3
]}

Katoen, Joost-Pieter ^{[3
,4
]}

机构：

[1] Univ Bologna, Dipartimento Sci Informaz, I-40127 Bologna, Italy

[2] Univ Saarland, Dept Comp Sci, Dependable Syst & Software, D-66123 Saarbrucken, Germany

[3] Univ Twente, Formal Methods & Tools, NL-7500 AE Enschede, Netherlands

[4] Rhein Westfal TH Aachen, Software Modeling & Verificat, Aachen, Germany

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2006年 / 162卷

关键词：

Markov chain; process algebra; concurrency theory;

D O I：

10.1016/j.entcs.2005.12.108

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Markov chains are widely used to determine system performance and reliability characteristics. The vast majority of applications considers continuous-time Markov chains (CTMCs). This note motivates how concurrency theory can be extended (as opposed to twisted) to CTMCs. We provide the core motivation for the algebraic setup of Interactive Markov Chains. Therefore, this note should have better been baptized YIMC.

引用

页码：107 / 112

页数：6

共 11 条

[1] The theory of interactive generalized semi-Markov processes [J].

Bravetti, M ;

Gorrieri, R .

THEORETICAL COMPUTER SCIENCE, 2002, 282 (01) :5-32

[2]

Bravetti M., 2002, ELECT NOTES THEOR CO, V68

[3]

Bravetti M., 2000, ELECT NOTES THEOR CO, V39

[4]

D'Argenio P. R., 1998, Programming Concepts and Methods. PROCOMET '98. IFIP TC2/WG2.2,2.3 International Conference, P126

[5] Process algebra for performance evaluation [J].

Hermanns, H ;

Herzog, U ;

Katoen, JP .

THEORETICAL COMPUTER SCIENCE, 2002, 274 (1-2) :43-87

[6] Automated compositional Markov chain generation for a plain-old telephone system [J].

Hermanns, H ;

Katoen, JP .

SCIENCE OF COMPUTER PROGRAMMING, 2000, 36 (01) :97-127

[7]

Hermanns H., 2002, LNCS, V2428

[8]

Hillston J., 1996, COMPOSITIONAL APPROA

[9]

Neuts M.F., 1981, MATRIX GEOMETRIC SOL

[10]

Puterman M.L., 2014, MARKOV DECISION PROC, DOI DOI 10.1002/9780470316887

← 1 2 →