Using Petri Nets for analysis of permutation capability in multistage networks

Simple item page
dc.contributor.authorBashirov, R
dc.date.accessioned2026-02-06T18:28:58Z
dc.date.issued2001
dc.departmentDoğu Akdeniz Üniversitesi
dc.descriptionInternational Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001) -- JUN 25-28, 2001 -- LAS VEGAS, NV
dc.description.abstractPetri 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.
dc.description.sponsorshipComp Sci Res Educ & Applicat Press,Int Technol Inst,Korea Informat Processing Soc,World Acad Sci Informat Technol,PACT Corp
dc.identifier.endpage230
dc.identifier.isbn1-892512-71-8
dc.identifier.scopusqualityN/A
dc.identifier.startpage226
dc.identifier.urihttps://hdl.handle.net/11129/11208
dc.identifier.wosWOS:000174014500034
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.language.isoen
dc.publisherC S R E A Press
dc.relation.ispartofPdpta'2001: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectPetri Net
dc.subjectMultistage Network
dc.subjectPermutation Capability
dc.subjectRearrangeability
dc.subjectCombinatorial Power
dc.titleUsing Petri Nets for analysis of permutation capability in multistage networks
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection