Analýza distribuovaných algoritmů pomocí Petriho sítí

Abstract

This diploma thesis describes possibilities of modeling and analysis of distributed algorithms using Petri nets. Algorithms, typically introduced by pseudocode are converted to Petri nets using described methods. Thesis is extended by scripts and animations, created in freely available software, for further approach to reader. This diploma thesis contains summary and comparison between Elements of Distributed Algorithms by W. Reisig and Coloured Petri nets by K. Jensen and L. M. Kristensen.