The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Este artigo apresenta um método eficiente para derivar o primeiro tempo de passagem de uma rede de Petri estocástica estendida por meio de operações algébricas simples. O gráfico de alcançabilidade é derivado de uma rede de Petri estocástica estendida e depois convertido em uma máquina de estado estocástica cronometrada que é um processo semi-Markov. A média e a variância do primeiro tempo de passagem são derivadas por manipulações algébricas com a média e a variância do tempo de transição e a probabilidade de transição para cada transição no modelo da máquina de estados. Para a derivação, três regras de redução são introduzidas nas trajetórias de transição em uma expressão regular bem formada. Um algoritmo eficiente é fornecido para automatizar o método sugerido.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hong-ju MOON, Wook Hyun KWON, "An Efficient Computing of the First Passage Time in an Extended Stochastic Petri Net" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 6, pp. 1267-1276, June 2000, doi: .
Abstract: This paper presents an efficient method to derive the first passage time of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine which is a semi-Markov process. The mean and the variance of the first passage time are derived by algebraic manipulations with the mean and the variance of the transition time, and the transition probability for each transition in the state machine model. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. An efficient algorithm is provided to automate the suggested method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_6_1267/_p
Copiar
@ARTICLE{e83-a_6_1267,
author={Hong-ju MOON, Wook Hyun KWON, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Computing of the First Passage Time in an Extended Stochastic Petri Net},
year={2000},
volume={E83-A},
number={6},
pages={1267-1276},
abstract={This paper presents an efficient method to derive the first passage time of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine which is a semi-Markov process. The mean and the variance of the first passage time are derived by algebraic manipulations with the mean and the variance of the transition time, and the transition probability for each transition in the state machine model. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. An efficient algorithm is provided to automate the suggested method.},
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
TY - JOUR
TI - An Efficient Computing of the First Passage Time in an Extended Stochastic Petri Net
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1267
EP - 1276
AU - Hong-ju MOON
AU - Wook Hyun KWON
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2000
AB - This paper presents an efficient method to derive the first passage time of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine which is a semi-Markov process. The mean and the variance of the first passage time are derived by algebraic manipulations with the mean and the variance of the transition time, and the transition probability for each transition in the state machine model. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. An efficient algorithm is provided to automate the suggested method.
ER -