Lumpable continuous-time stochastic automata networks
| dc.citation.epage | 451 | en_US |
| dc.citation.issueNumber | 2 | en_US |
| dc.citation.spage | 436 | en_US |
| dc.citation.volumeNumber | 148 | en_US |
| dc.contributor.author | Gusak, O. | en_US |
| dc.contributor.author | Dayar, T. | en_US |
| dc.contributor.author | Fourneau, J. M. | en_US |
| dc.date.accessioned | 2015-07-28T11:57:16Z | |
| dc.date.available | 2015-07-28T11:57:16Z | en_US |
| dc.date.issued | 2003-07-16 | en_US |
| dc.department | Department of Computer Engineering | en_US |
| dc.description.abstract | The generator matrix of a continuous-time stochastic automata network (SAN) is a sum of tensor products of smaller matrices, which may have entries that are functions of the global state space. This paper specifies easy to check conditions for a class of ordinarily lumpable partitionings of the generator of a continuous-time SAN in which aggregation is performed automaton by automaton. When there exists a lumpable partitioning induced by the tensor representation of the generator, it is shown that an efficient aggregation-iterative disaggregation algorithm may be employed to compute the steady-state distribution. The results of experiments with two SAN models show that the proposed algorithm performs better than the highly competitive block Gauss-Seidel in terms of both the number of iterations and the time to converge to the solution. © 2002 Elsevier Science B.V. All rights reserved. | en_US |
| dc.description.provenance | Made available in DSpace on 2015-07-28T11:57:16Z (GMT). No. of bitstreams: 1 10.1016-S0377-2217(02)00431-9.pdf: 207404 bytes, checksum: ee8794864e0d4ac463f50683528372f8 (MD5) | en_US |
| dc.identifier.doi | 10.1016/S0377-2217(02)00431-9 | en_US |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.issn | 1872-6860 | |
| dc.identifier.uri | http://hdl.handle.net/11693/11258 | en_US |
| dc.language.iso | English | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/S0377-2217(02)00431-9 | en_US |
| dc.source.title | European Journal of Operational Research | en_US |
| dc.subject | Markov Processes | en_US |
| dc.subject | Stochastic Automata Networks | en_US |
| dc.subject | Ordinary Lumpability | en_US |
| dc.subject | Aggregation With Iterative Disaggregation | en_US |
| dc.title | Lumpable continuous-time stochastic automata networks | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 10.1016-S0377-2217(02)00431-9.pdf
- Size:
- 202.54 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version