For the most recent entries see the Petri Nets Newsletter.

A Comparative Performance Study of Distributed Mutual Exclusion Algorithms with a Class of Extended Petri Nets.

Kostin, Alexander; Ilushechkina, Ljudmila; Basri, Erhan

In: Michael Hobbs, Andrzej M. Goscinski, Wanlei Zhou (Eds.): Lecture Notes in Computer Science, 3719: Distributed and Parallel Computing: 6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP, Melbourne, Australia, October 2-3, 2005., pages 11-22. Springer-Verlag, October 2005. URL:,.

Abstract: A few algorithms of distributed mutual exclusion are discussed, their unified model in terms of a finite-population queuing system is proposed, and their simulation performance study is presented with the assumption that they use multicast communication if possible. To formally represent the algorithms for simulation, a class of extended Petri nets is used. The simulation was done in the simulation system Winsim based on this class of Petri nets.

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

Back to the Petri Nets Bibliography