000 | 03288nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-540-45804-3 | ||
003 | DE-He213 | ||
005 | 20240423132457.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540458043 _9978-3-540-45804-3 |
||
024 | 7 |
_a10.1007/3-540-45804-2 _2doi |
|
050 | 4 | _aQA273.A1-274.9 | |
072 | 7 |
_aPBT _2bicssc |
|
072 | 7 |
_aPBWL _2bicssc |
|
072 | 7 |
_aMAT029000 _2bisacsh |
|
072 | 7 |
_aPBT _2thema |
|
072 | 7 |
_aPBWL _2thema |
|
082 | 0 | 4 |
_a519.2 _223 |
100 | 1 |
_aHermanns, Holger. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aInteractive Markov Chains _h[electronic resource] : _bThe Quest for Quantified Quality / _cby Holger Hermanns. |
250 | _a1st ed. 2002. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2002. |
|
300 |
_aXII, 217 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2428 |
|
505 | 0 | _aInteractive 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. | |
520 | _aMarkov 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. | ||
650 | 0 | _aProbabilities. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer science. | |
650 | 0 |
_aElectronic digital computers _xEvaluation. |
|
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aMathematical statistics. | |
650 | 1 | 4 | _aProbability Theory. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aSystem Performance and Evaluation. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aProbability and Statistics in Computer Science. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540442615 |
776 | 0 | 8 |
_iPrinted edition: _z9783662207031 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2428 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45804-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188177 _d188177 |