We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Exploiting colored Petri nets to decide on permutation admissibility.
- Authors
Bashirov, Rza; Kordon, Fabrice; Lort, Hüseyin
- Abstract
In this work, we propose an innovative approach to investigate the admissibility of permutations to multistage interconnection networks—a challenging problem of switching theory. The proposed approach is centered upon modeling of multistage interconnection networks with colored Petri nets and use of Petri net analysis tools such as the unfolding technique and the invariants method. To assess the feasibility of the proposed approach we demonstrate that the complete unfoldings obtained in this work are polynomial in the problem size and employ an acyclic structure. The approach takes advantage of easy to use, yet extremely efficient, software tools.
- Subjects
PETRI nets; NETS (Mathematics); PERMUTATIONS; SWITCHING theory; POLYNOMIALS
- Publication
Acta Informatica, 2009, Vol 46, Issue 1, p43
- ISSN
0001-5903
- Publication type
Article
- DOI
10.1007/s00236-008-0084-1