Please use this identifier to cite or link to this item:
http://hdl.handle.net/10071/5673
Author(s): | Ferreira, Manuel Alberto M. Andrade, Marina |
Date: | 2012 |
Title: | A method to approximate first passage times distributions in direct time Markov processes |
Volume: | 5 |
Number: | 3 |
Pages: | 217 |
Reference: | Ferreira, M. A. M., & Andrade, M. (2012). A method to approximate first passage times distributions in direct time Markov processes. Aplimat - Journal of Applied Mathematics, 5(3), 217-224. http://hdl.handle.net/10071/5673 |
ISSN: | 1337-6365 |
Keywords: | Randomisation procedure Sojourn time Jackson three node acyclic networks |
Abstract: | A numerical method to approximate first passage times distributions in direct Markov processes will be presented. It is useful to compute sojourn times in queue systems, namely in Jackson queuing networks. Using this method (Kiessler et al., 1988) achieved to clear a problem that arises in the Jackson three node acyclic networks sojourn times. |
Peerreviewed: | Sim |
Access type: | Open Access |
Appears in Collections: | DM-RI - Artigos em revistas científicas internacionais com arbitragem científica |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
article_hdl5673.pdf | 272,82 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.