Zuberek, W. M. (1985) Performance evaluation using extended timed Petri nets. In: International Workshop on Timed Petri Nets, July 1-3, 1985, Torino, Italy.
![[img]](https://research.library.mun.ca/style/images/fileicons/application_pdf.png) |
[English]
PDF
- Accepted Version
Available under License Creative Commons Attribution Non-commercial. Download (300kB) |
Abstract
It is shown that the behavior of extended limited-choice Petri nets with exponentially distributed firing times can be represented by probabilistic state graphs. For bounded Petri nets, the corresponding state graphs are finite, stationary descriptions can thus be obtained by standard techniques used for analysis of continuous-time finite-state homogenous Markov chains. An immediate application of such a model is performance analysis of concurrent systems, and in particular queueing systems with exponentially distributed interarrival and service times. A simple model of an interactive computer system with priority scheduling is used as an illustration of performance evaluation, and a short comparison of timed Petri nets with stochastic Petri nets is given.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| URI: | http://research.library.mun.ca/id/eprint/14822 |
| Item ID: | 14822 |
| Additional Information: | DOI number in PDF is incorrect. |
| Keywords: | Timed Petri nets, reachability analysis, Markov chains, performance analysis |
| Department(s): | Science, Faculty of > Computer Science |
| Date: | July 1985 |
| Date Type: | Completion |
| Related URLs: |
Actions (login required)
 |
View Item |
Download statistics
Download statistics