Zuberek, W.M.
Proc. Int. Conference on Parallel Processing; St.Charles, IL, August 1987, pp.695-698.
Abstract:
Timed Petri nets discussed in this paper are extended Petri nets with exponentially distributed firing times. Since the behavior of such nets can be represented by probabilitstic state graphs, stationary probabilities of states can be obtained by standard techniques used for analysis of continuos-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 in particular, distributed computer systems. Places of Petri nets model system's queues, transitions represent servers, inhibitor arcs are used to model priorities of simultaneous events, and interrupt arcs provide preemption of servers. Simple models of multiprocessor systems are used as an illustration of modeling and performance evaluation.
Keywords:
Timed Petri nets, multiprocessor systems, reachability analysis, performance evaluation.