DocumentCode
3322653
Title
Throughput lower bounds for Markovian Petri nets: transformation techniques
Author
Campos, Javier ; Sánchez, Beatriz ; Silva, Manuel
Author_Institution
Centro Politecnio Superior Zaragoza Univ., Spain
fYear
1991
fDate
2-5 Dec 1991
Firstpage
322
Lastpage
331
Abstract
Addresses the computation of lower bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. The authors try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering some pessimistic transformation rules operating locally on the net structure, its initial marking, and stochastic interpretation. Special interest have the obtained results for the case of live and bounded free choice nets and live marked graphs systems
Keywords
Markov processes; Petri nets; queueing theory; Markovian Petri nets; lower bounds; queueing networks; stochastic Petri net theory; Bridges; Circuits; Distributed computing; Network theory (graphs); Petri nets; Queueing analysis; Steady-state; Stochastic processes; Stochastic systems; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1991. PNPM91., Proceedings of the Fourth International Workshop on
Conference_Location
Melbourne, Vic.
Print_ISBN
0-8186-2285-7
Type
conf
DOI
10.1109/PNPM.1991.238788
Filename
238788
Link To Document