Exploiting colored Petri nets to decide on permutation admissibility

DOI10.1007/s00236-008-0084-1zbMath1172.68042OpenAlexW2009353747MaRDI QIDQ1006895

Hüseyin Lort, Fabrice Kordon, Rza Bashirov

Publication date: 26 March 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-008-0084-1

zbMATH Keywords

switching theorymultistage interconnection networks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• GreatSPN
• GreatSPN 1.7
• Helena

Cites Work

• Unnamed Item
• Merged processes: a new condensed representation of Petri net behaviour
• Packet routing in fixed-connection networks: A survey
• Rearrangeability of \((2\log_n N-1)\)-stage networks employing a uniform connection pattern
• Analyzing permutation capability of multistage interconnection networks with colored Petri nets
• GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets
• Optimized Colored Nets Unfolding
• On a Class of Multistage Interconnection Networks
• Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
• An optimal algorithm for permutation admissibility to multistage interconnection networks
• Optimally routing LC permutations on k-extra-stage cube-type networks
• An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks
• Applications and Theory of Petri Nets 2005

This page was built for publication: Exploiting colored Petri nets to decide on permutation admissibility