This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Discrete-Event Simulation of Colored Petri Nets
September 1996 (vol. 22 no. 9)
pp. 629-639

Abstract—Colored Petri nets are a powerful formalism for the description of complex, asynchronous distributed systems. They can express in a very concise way the behavior of very large systems, 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 stochastic well-formed nets (SWN) we present a set of optimizations that allow a very efficient implementation of the event-driven simulation technique. Three approaches are followed to improve simulation efficiency: First, efficient algorithm for the computation of the occurrences of a transition in a given marking; second, 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 color functions for the SWN formalism; third, 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.

[1] G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “Stochastic Well-Formed Coloured Nets for Symmetric Modeling Applications,” IEEE Trans. Computers, vol. 42, no. 11, Nov. 1993.
[2] High-Level Petri Nets: Theory and Application, K. Jensen and G. Rozenberg eds. Springer Verlag, 1991.
[3] G. Chiola, G. Franceschinis, and R. Gaeta, "A Symbolic Simulation Mechanism for Well-Formed Colored Petri Nets," Proc. 25th SCS Ann. Simulation Symp.,Orlando, Fla., Apr. 1992.
[4] G. Chiola, "Simulation Framework for Timed and Stochastic Petri Nets," Int'l J. Computer Simulation, vol. 1, no. 2, pp. 153-168, 1991.
[5] C. Dutheillet and S. Haddad, "Conflict Sets in Coloured Petri Nets," Proc. Fifth Int'l Workshop Petri Nets and Performance Models,Toulouse, France, IEEE/CS Press, Oct. 1993.
[6] J.M. Ilié and O. Rojas, "On Well-Formed Nets and Optimizations in Enabling Tests," Proc. 14th Int'l Conf. Application and Theory of Petri Nets,Chicago, Springer Verlag, June 1993.
[7] G. Chiola and A. Ferscha, "Distributed Simulation of Petri Nets," IEEE Parallel and Distributed Technology, vol. 1, no. 3, pp. 33-50, Aug. 1993.
[8] D. Nicol, "Automated Parallel Simulation of Timed Petri-Nets," J. Parallel and Distributed Computing, vol. 25, no. 1, pp. 60-74, Aug. 1995.
[9] G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo, “GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets,” Performance Evaluation, vol. 24, nos. 1-2, pp. 47-68, Nov. 1995.
[10] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[11] G. Chiola, R. Gaeta, and M. Sereno, "A Simulation Model of a Double Ring Protocol Based on Timed Well-Formed Colored Petri Nets," Proc. Int'l Workshop MASCOTS '93, vol. 25 of Simulation Series, pp. 259-264,San Diego, Jan. 1993.
[12] C. Anglano, S. Donatelli, and R. Gaeta, "Parallel Architectures with Regular Structure: A Case Study in Modeling Using SWN," Proc. Fifth Int'l Workshop Petri Nets and Performance Models,Toulouse, France, IEEE/CS Press, Oct. 1993.
[13] G. Chiola, G. Franceschinis, and R. Gaeta, "Modeling Symmetric Computer Architectures by Stochastic Well-Formed Coloured Nets," Proc. 15th Int'l Conf. Application and Theory of Petri Nets,Zaragoza, Spain, Springer Verlag LNCS 815, June 1994.
[14] G. Chiola, "Compiling Techniques for the Analysis of Stochastic Petri Nets," Proc. Fourth Int'l Conf. Modeling Techniques and Tools for Computer Performance Evaluation, R. Puigjaner and D. Potier eds., Palma de Mallorca, Spain. New York: Plenum Press, Sept. 1988.
[15] L. Lamport, “A Fast Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 5, no. 1, pp. 1–11, 1987.
[16] G. Balbo, S. Bruell, O. Chen, and G. Chiola, “An Example of Modeling and Evaluation of a Concurrent Program Using Coloured Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm,” IEEE Trans. Parallel and Distributed Systems, pp. 221–240, 1992.
[17] A. Bondavalli, L. Strigini, and M. Sereno, "Destination Stripping Dual Ring: A New Protocol for MANs," Computer Networks and ISDN Systems, vol. 24, no. 9, pp. 15-32, Mar. 1992.
[18] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.

Index Terms:
Discrete event simulation, high-level Petri nets, stochastic well-formed nets, model symmetries, efficient simulation algorithms, symbolic simulation.
Citation:
Rossano Gaeta, "Efficient Discrete-Event Simulation of Colored Petri Nets," IEEE Transactions on Software Engineering, vol. 22, no. 9, pp. 629-639, Sept. 1996, doi:10.1109/32.541434
Usage of this product signifies your acceptance of the Terms of Use.