Using Petri Nets for analysis of permutation capability in multistage networks
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
C S R E A Press
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
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.
Description
International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001) -- JUN 25-28, 2001 -- LAS VEGAS, NV
Keywords
Petri Net, Multistage Network, Permutation Capability, Rearrangeability, Combinatorial Power
Journal or Series
Pdpta'2001: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
