A method to approximate first passage times distributions in direct time Markov processes

dc.contributor.author	Ferreira, Manuel Alberto M.
dc.contributor.author	Andrade, Marina
dc.date.accessioned	2013-10-01T17:56:35Z
dc.date.available	2013-10-01T17:56:35Z
dc.date.issued	2012
dc.description.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.	por
dc.distribution	Internacional	por
dc.identifier.citation	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
dc.identifier.issn	1337-6365	por
dc.identifier.uri	http://hdl.handle.net/10071/5673
dc.journal	Aplimat - Journal of Applied Mathematics	por
dc.language.iso	eng	por
dc.number	3	por
dc.pagination	217	por
dc.peerreviewed	Sim	por
dc.publicationstatus	Publicado	por
dc.publisher	Slovak University of Technology	por
dc.rights	open access	por
dc.subject	Randomisation procedure	por
dc.subject	Sojourn time	por
dc.subject	Jackson three node acyclic networks	por
dc.subject.fos	Domínio/Área Científica::Ciências Naturais::Matemáticas
dc.title	A method to approximate first passage times distributions in direct time Markov processes	por
dc.type	article	por
dc.volume	5	por
dspace.entity.type	Publication	en

Ficheiros

A mostrar 1 - 1 de 1