Inhibitor D-Timed Petri Nets And Pereormance Analysis Of Communication Protocols
W.M. Zuberek · INFOR Information Systems and Operational Research · 1986
It is shown that the behaviour of inhibitor free-choice Petri nets with deterministic firing times can be represented by probabilistic state graphs. For bounded petri nets the corresponding state graphs are finite, and stationary descriptions can thus be obtained by standard techniques used for analysis of Markov chains. An immediate application of such a model is jseri^ormance analysis of systems of asynchronous concurrent processes and, in particular, communicatioii protocols. Places of Petri nets model queues of messages, transitions represent events in communication networks, inhibitor arcs are used to indicate priorities of simultaneous events, and probabilities associated with free-choice classes correspond to relative frequencies of random events. The alternating bit protocol is used as an illustration of analysis.