|
|
|
|
| LEADER |
02407nmm a2200397 u 4500 |
| 001 |
EB001652693 |
| 003 |
EBX01000000000000000955367 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
171111 ||| eng |
| 020 |
|
|
|a 9783540458043
|
| 100 |
1 |
|
|a Hermanns, Holger
|
| 245 |
0 |
0 |
|a Interactive Markov Chains
|h Elektronische Ressource
|b The Quest for Quantified Quality
|c by Holger Hermanns
|
| 250 |
|
|
|a 1st ed. 2002
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2002, 2002
|
| 300 |
|
|
|a XII, 217 p
|b online resource
|
| 505 |
0 |
|
|a Interactive Processes -- Markov Chains -- Interactive Markov Chains -- Algebra of Interactive Markov Chains -- Interactive Markov Chains in Practice -- Conclusion -- Proofs for Chapter 3 and Chapter 4 -- Proofs for Chapter 5
|
| 653 |
|
|
|a Mathematical statistics
|
| 653 |
|
|
|a Electronic digital computers / Evaluation
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a System Performance and Evaluation
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Probability and Statistics in Computer Science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Probability Theory
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Probabilities
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-45804-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45804-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 519.2
|
| 520 |
|
|
|a Markov Chains are widely used as stochastic models to study a broad spectrum of system performance and dependability characteristics. This monograph is devoted to compositional specification and analysis of Markov chains. Based on principles known from process algebra, the author systematically develops an algebra of interactive Markov chains. By presenting a number of distinguishing results, of both theoretical and practical nature, the author substantiates the claim that interactive Markov chains are more than just another formalism: Among other, an algebraic theory of interactive Markov chains is developed, devise algorithms to mechanize compositional aggregation are presented, and state spaces of several million states resulting from the study of an ordinary telefone system are analyzed
|