A method to abstract a stochastic Petri net

Mathematical and Computer Modelling

Volumn 31, Issue 10-12, 2000, Pages 251-260

  Nakada, K ^a   Yoneyama, T ^a  

^a TAMAGAWA UNIVERSITY   (Japan)

Author keywords

Abstraction; First passage time; Markov renewal process; Petri nets; State transition system

Indexed keywords

EID: 0034701949     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(00)00094-7     Document Type: Article

References (5)

1. T. Murata, Petri nets: Properties, analysis and applications, Proc, of the IEEE 77 (4), 541-580, (1989).
2. M.K. Molloy, On the Integration of Delay and Throughput Measures in Distributed Processing Models, Ph.D. Thesis, University of California (1981).
3. R. Pyke, Markov renewal process: Definition and preliminary properties, Ann. Math. Statist. 32, 1231-1242, (1961).
4. R. Pyke, Markov renewal process with finitely many states, Ann. Math. Statist. 32, 1243-1259, (1961).
5. K. Nakada and T. Yoneyama, An algorithm to compute the moments of the first passage time in the Markov renewal process with finite states, Trans. of the IEICE E71 (7), 669-678, (1988).