ACM Computing Surveys (CSUR)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Timed Petri nets and preliminary performance evaluation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
M-timed Petri nets and Markov chains in modelling of computer systems
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
A Proposal For Relative Time Petri Nets
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Modeling infrastructure interdependency among floodplain infrastructures with extended Petri-Net
ASM '07 The 16th IASTED International Conference on Applied Simulation and Modelling
Hi-index | 0.00 |
It is shown that the behavior of Petri nets with exponentially distributed firing times can be represented by labeled directed “state” graphs in which labels describe the probabilities of transitions between vertices of the graph. For bounded Petri nets the corresponding state graphs are finite, and are isomorphic to finite state Markov chains, stationary descriptions can thus be obtained by standard techniques. An immediate application of such a model is performance analysis of concurrent systems, and in particular queueing systems with exponentially distributed arrival and service times. A simple example of an interactive computer system model is used as an illustration of performance evaluation.