Exploiting colored Petri nets to decide on permutation admissibility

EMU I-REP

Show simple item record

dc.contributor.author Bashirov, Rza
dc.contributor.author Kordon, Fabrice
dc.contributor.author Lort, Hüseyin
dc.date.accessioned 2016-01-18T12:46:37Z
dc.date.available 2016-01-18T12:46:37Z
dc.date.issued 2009
dc.identifier.citation Bashirov, R., Kordon, F., Lort, H. (2009) Exploiting colored Petri nets to decide on permutation admissibility, Acta Informatica, Springer Berlin/Heidelberg, 46, 43-55 (indexed in SCI). en_US
dc.identifier.issn 1432-0525 (online)
dc.identifier.issn 0001-5903 (print)
dc.identifier.other DOI: 10.1007/s00236-008-0084-1
dc.identifier.uri http://dx.doi.org/10.1007/s00236-008-0084-1
dc.identifier.uri http://hdl.handle.net/11129/1996
dc.description 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. en_US
dc.description.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. en_US
dc.language.iso en_US en_US
dc.publisher Acta Informatica, Springer en_US
dc.subject Permutation admissibility en_US
dc.subject Multistage interconnection network en_US
dc.title Exploiting colored Petri nets to decide on permutation admissibility en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record