Preemptive D-timed Petri nets, timeouts, modeling and analysis of communication protocols

Zuberek, W. M. (1987) Preemptive D-timed Petri nets, timeouts, modeling and analysis of communication protocols. In: IEEE 6-th Annual Conference on Global Networks (INFOCOM'87), March 30 - April 2, 1987, San Francisco, CA.

[English] PDF - Accepted Version Available under License Creative Commons Attribution Non-commercial. Download (298kB)

Abstract

Preemptive D-timed Petri nets are Petri nets with deterministic firing times and with generalized inhibitor arcs to interrupt firing transitions. A formalism is presented which represents the behavior of free-choice D-timed Petri nets by discrete-space discrete-time semi-Markov processes. Stationary probabilities of states can thus be determined by standard techniques used for analysis of Markov chains. A straightforward application of timed Petri nets is modelling and analysis of systems of asynchronous communicating processes, and in particular communication protocols. Places of Petri nets model queues of messages, transitions represent delays in communication networks, interrupt arcs conveniently model timeout mechanisms, and probabilities associated with free-choice classes correspond to relative frequencies of random events. Simple protocols are used as an illustration of modelling and analysis.

Actions (login required)

View Item