A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
High-level Petri nets: theory and application
High-level Petri nets: theory and application
Destination stripping dual ring: a new protocol for MANs
Computer Networks and ISDN Systems
A symbolic simulation mechanism for well-formed coloured Petri nets
ANSS '92 Proceedings of the 25th annual symposium on Simulation
Distributed Simulation of Petri Nets
IEEE Parallel & Distributed Technology: Systems & Technology
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
A Simulation Model of a Double Ring Protocol Based on Timed Well-Formed Coloured Petri Nets
MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Distributed Simulation of Timed Petri Nets: Exploiting the Net Structure to Obtain Efficiency
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
On Well-Formed Nets and Optimizations in Enabling Tests
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Performance prediction of a reconfigurable high voltage substation simulator: a case study using SWN
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Performance evaluation of UML design with Stochastic Well-formed Nets
Journal of Systems and Software
On simulation of non-Markovian stochastic Petri nets with heavy-tailed firing times
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Coloured Petri nets are a powerful formalism for the description of complex, asynchronous distributed systems. They can express in a very concise way the behaviour of very large system especially in case these systems are composed of many replications of a few basic components that individually behave in a similar way. The simulation of such models is however difficult to perform in a computationally efficient way. For the specific class of well formed stochastic nets (SWN) we present a set of techniques that allow a very efficient implementation of the event-driven simulation approach. Two approaches are followed to improve simulation efficiency: first, reduction of the amount of work needed to schedule or preempt the occurrence of a transition as a consequence of a marking change, taking into account the restrictions on colour functions for the WN formalism; second, reduction of the average length of the event list in the case of symmetric models where the so called symbolic simulation technique applies. The approach is validated by performance measurements on several large SWN models taken from the literature.