 |
|
|||
| Authors: | Kai Lampka, Stefan Harwarth, Markus Siegle |
| Group: | Computer Engineering |
| Type: | Inproceedings |
| Title: | Can matrix-layout-independent numerical solvers be efficient? |
| Year: | 2007 |
| Month: | October |
| Pub-Key: | LampkaSiegleTSMC07 |
| Book Titel: | Proceedings of the International Workshop on Tools for solving Structured Markov Chains 2007 |
| Volume: | 2 |
| Pages: | 1-9 |
| Keywords: | Symbolic methods, Numerical Solution of Markov Chains |
| Publisher: | ACM CD edition |
| Abstract: | Symbolic approaches based on decision diagrams have shown to be well suited for representing very large continuous-time Markov chains (CTMC), as derived from high-level model descriptions. Unfortunately, each type of decision diagram requires its own implementation of the numerical solvers for computing the state probabilities of the CTMC. For this reason, some time ago the idea of separating numerical solution methods from the representation of the CTMC was proposed [12], suggesting the implementation of a so-called state-level abstract functional interface (AFI), which defines classes of iterators for accessing the entries of the CTMC transition rate matrix. In this paper we (a) present an implementation of the AFI for zero-suppressed multi-terminal binary decision diagrams (ZDDs) [18] and (b) empirically investigate the viability of matrix-layout-independent implementations of numerical solvers. |
| Location: | Nantes |
| Resources: | [BibTeX] [ External LINK ] |
