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
본 논문은 간단한 대수적 연산을 통해 확장된 확률론적 페트리 넷의 첫 번째 통과 시간을 도출하는 효율적인 방법을 제시합니다. 도달가능성 그래프는 확장된 확률론적 페트리 넷에서 파생된 후 세미 마르코프 프로세스인 시간 제한 확률론적 상태 기계로 변환됩니다. 첫 번째 통과 시간의 평균과 분산은 상태 기계 모델의 각 전환에 대한 전환 시간의 평균과 분산, 전환 확률을 사용하여 대수적 조작을 통해 파생됩니다. 파생을 위해 잘 구성된 정규식의 전환 궤적에 세 가지 축소 규칙이 도입됩니다. 제안된 방법을 자동화하기 위한 효율적인 알고리즘을 제공합니다.
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.
부
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
부
@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},}
부
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 -