For the most recent entries see the Petri Nets Newsletter.

Backward coupling in petri nets.

Bouillard, Anne; Gaujal, Bruno

In: valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, pages 1-33. ACM Press, 2006.

Abstract: In this paper, we show how to design a perfect sampling algorithm for stochastic Free-Choice Petri nets by backward coupling. For Markovian event graphs, the simulation time can be greatly reduced by using extremal initial states, namely blocking marking, although such nets do not exhibit any natural monotonicity property. Another approach for perfect simulation of non-Markovian event graphs is based on a (max,plus) representation of the system and the theory of (max,plus) stochastic systems. Next, we show how to extend this approach to one-bounded free choice nets to the expense of keeping all states. Finally, experimental runs show that the (max,plus) approach needs a larger simulation time than the Markovian approach.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography