Exploiting colored Petri nets to decide on permutation admissibility
| Autor: | Fabrice Kordon, Rza Bashirov, Hüseyin Lort |
|---|---|
| Přispěvatelé: | Modélisation et Vérification (MoVe), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: |
Structure (mathematical logic)
Polynomial Computer Networks and Communications business.industry Computer science Multistage interconnection networks 020206 networking & telecommunications 02 engineering and technology Petri net Permutation Software Permutation admissibility Multistage interconnection network Theory of computation 0202 electrical engineering electronic engineering information engineering Stochastic Petri net 020201 artificial intelligence & image processing [INFO]Computer Science [cs] business Algorithm Information Systems |
| Zdroj: | Acta Informatica Acta Informatica, Springer Verlag, 2009, 46 (1), pp.43-55. ⟨10.1007/s00236-008-0084-1⟩ Acta Informatica, 2009, 46 (1), pp.43-55. ⟨10.1007/s00236-008-0084-1⟩ |
| ISSN: | 0001-5903 1432-0525 |
| DOI: | 10.1007/s00236-008-0084-1⟩ |
| Popis: | 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. Due to copyright restrictions, the access to the publisher version (published version) of this article is only available via subscription. You may click URI (with DOI: 10.1007/s00236-008-0084-1) and have access to the Publisher Version of this article through the publisher web site or online databases, if your Library or institution has subscription to the related journal or publication. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink