Using Petri Nets for Analysis of Permutation Capability in Multistage Networks

摘要

Petri Nets represent a mathematical tool to design and anlysis of discrete event systems. In this paper we propose a Petri Net model of the multistage networks. Using Petri Net model we investigate the permutation capability in interconnection networks; we verify whether a multistage network is rearrangeable. If it is not, we measure its combinatorial power.