How distributed algorithms play the token game.

For the most recent entries see the Petri Nets Newsletter.

How distributed algorithms play the token game.

In: Freksa, C.; Jantzen, M.; Valk, R.: Lecture Notes in Computer Science, Vol. 1337: Foundations of Computer Science: Potential - Theory - Cognition, pages 297-306. Springer-Verlag, 1997.

Abstract: We argue that high-level Petri nets are an appropriate technique for the formulation of distributed algorithms. To this end, we introduce sufficient conditions for a faithful modeling of message-passing algorithms and of shared-memory algorithms.

Keywords: distributed algorithms, high-level Petri nets, message passing.

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

Back to the Petri Nets Bibliography