Modified M-timed Petri nets in modelling and performance evaluation of systems

Authors:
W. M. Zuberek
Affiliations:
Department of Computer Science, Memorial University of Newfoundland, St.John', Newfoundland, Canada A1C 5S7
Venue:
CSC '87 Proceedings of the 15th annual conference on Computer Science
Year:
1987

Citing 10
Cited 0

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

ACM Transactions on Computer Systems (TOCS)
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Performance Evaluation Using Extended Petri Nets

International Workshop on Timed Petri Nets
Performance Evaluation of Systems Using Nets

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Formal Properties of Place/Transition Nets

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Use of Petri Nets for Performance Evaluation

Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
M-timed Petri nets, priorities, preemptions, and performance evaluation of Petri nets

Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Timed Petri nets and preliminary performance evaluation

ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The derivation of performance expressions for communication protocols from timed petri net models

SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modified M-timed Petri nets are Petri nets with exponentially distributed firing times and with generalized inhibitor arcs to interrupt firing transitions. It is shown that the behavior of modified free-choice M-timed Petri nets can be represented by probabilistic state graphs, stationary probabilities of states can thus be obtained by standard techniques used for analysis of continuous-time homogeneous Markov chains. An immediate application of such a model is performance analysis of queueing systems with exponentially distributed service and interarrival times, and with priority and/or preemptive scheduling disciplines. Simple models of computer systems with different scheduling strategies are used as an illustration of modelling and performance analysis.