IPA for Continuous Petri Nets

Recently there has been a considerable interest in the application of Infinitesimal Perturbation Analysis (IPA) to continuous queues, where its sample derivatives (gradients) were shown to be unbiased for a large class of systems. This paper extends the investigation to a class of hybrid Petri nets, where the special algebraic structure of continuous transitions yields simple algorithms for the IPA derivatives. We derive such algorithms for the performance functions of throughput and average workload, and show them to be model-free and easily computable from the sample paths.