Fractal Petri nets
Alexander S. Semenov · 2017
During the last decade a new kind of dynamic architectural models and algorithms for system scalability has emerged. The dynamic scalability is one of the most important design goals for developers of distributed systems and cloud computing. We introduce Fractal Petri nets (FP-nets) that takes into account the dynamically scalable distributed architectures. FP-nets are a backward compatible extension of Petri Nets on the base of algebraic structure. FP-nets are synthesized from the initial marking Petri net by replication. FP-nets are considered as distributed. Well-known techniques for analysis of Petri net theory are adjusted to FP-nets. New techniques for modeling distributed resources named “token-stub” are suggested. The distributed IT resources are integrated into the architectures of FP-nets. Three FP-nets architectures such as layered, folded, and unfolded are proposed. A FP-net avoids the scalability problems. There are properties of FP-nets: scalability, self-similarity, and token-stub dependences. FP-nets can be highly recommended for automatic modeling dynamically scalable distributed architectures.