“Forgotten topics” of net theory
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
A Generalized Timed Petri Net Model for Performance Analysis
IEEE Transactions on Software Engineering
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Hierarchies in Coloured Petri Nets
APN 90 Proceedings on Advances in Petri nets 1990
IEEE Transactions on Software Engineering
Efficient Discrete-Event Simulation of Colored Petri Nets
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Sufficient Conditions for Existence of a Fixed Point in Stochastic Reward Net-Based Iterative Models
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Fault tolerant permutation mapping in multistage interconnection network
Journal of Systems Architecture: the EUROMICRO Journal
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
Dependability Modeling and Analysis of Distributed Programs
IEEE Transactions on Software Engineering
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net
IEEE Transactions on Software Engineering
Permutation Mapping for MIN Using High Level Net Models
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Modeling networking issues of network-on-chip: a coloured petri nets approach
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Hi-index | 0.00 |
This paper introduces a new high-level net, named S-net, for modelling multistage interconnection networks. Based on the stochastic behaviour of GSPN and coupled with the flexibility and compactness of Coloured Petri net uses tokens for storage and manipulation of data besides modelling the flow of control. It requires exactly 3N/2 number of places to model an N×N multistage interconnection network irrespective of the number of stages and buddy properties of the network. A polynomial time algorithm is developed to check feasibility of mapping a permutation using the proposed S-net model of an MIN.