Pattern-type Reachability Analysis of Distributed Systems Based on Fractal Petri Nets

Abstract

This paper presents a Pattern-type Reachability Analysis of distributed systems modelled by Fractal Petri Nets. We define Fractal Petri Nets as a net which is dynamically synthesized from self-similar Place/Transition subnets on the base of algebraic operations. Fractal Petri nets are considered as distributed. This means, that every self-similar subnet can be considered autonomously. Resources can be shared between subnets of Fractal net. For purpose of modelling shared resources the operation of overlapping places of the subnets is introduced. To investigate dynamic properties of Fractal Petri Nets a Pattern-type Reachability Analysis is developed. It is helpful for understandability and readability of complicated reachability trees.