Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications

IEEE Transactions on Computers

Volumn 42, Issue 11, 1993, Pages 1343-1360

  Dutheillet, Claude ^b   Haddad, Serge ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Bus and memory contention. computational; complexity; high level Petri nets; lumpability condition; Markov chains; model symmetry; multiprocessor systems; performance evaluation; symbolic reachability graph

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MULTIPROCESSING SYSTEMS; PERFORMANCE;

MARKOV CHAINS; MODEL SYMMETRY; STOCHASTIC WELL FORMED COLORED NETS; SYMBOLIC REACHABILITY GRAPH;

PETRI NETS;

EID: 0027703137     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.247838     Document Type: Article

References (26)

1. M. K. Molloy “Performance analysis using stochastic Petri nets,” IEEE Trans. Comput., vol. C-31, pp. 913–917, Sept. 1982.
2. M. Ajmone Marsan, G. Balbo, G. Conte, and F. Gregoretti, “Modeling bus contention and memory interference in a multiprocessor system,” IEEE Trans. Comput., vol. C-32, pp. 60–72, Jan. 1983.
3. M. Ajmone Marsan, G. Balbo, and G. Conte, “A class of generalized stochastic Petri nets for the performance analysis of multiprocessor systems,” ACM Trans. Comput. Syst., vol. 2, May 1984.
4. M. Ajmone Marsan, G. Balbo, and G. Conte, Performance Models of Multiprocessor Systems. Cambridge, MA: MIT Press, 1986.
5. M. Ajmone Marsan and G. Chiola, “Construction of generalized stochastic Petri net models of bus oriented multiprocessor systems by stepwise refinements,” in Proc. 2nd Int. Conf Modeling Techniques and Tools for Performance Analysis, France, June 1985.
6. M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte, “Modeling the software atchitecture of a prototype parallel machine,” in Proc. 1987 SIGMETRICS Conf., Alberta, Canada, May 1987.
7. C. Lin and D. C. Marinescu, “Stochastic high-level Petri nets and applications,” IEEE Trans. Comput., vol. 37, pp. 815–825, July 1988.
8. S. Haddad, “Une categorie regulier de reseau de Petri de haut niveau: Definition, proprietes et reductions,” Ph.D. dissertation, Lab. MASI, Universite P. et M. Curie (Paris 6), Paris, France, Oct. 1987. These de Doctorat, RR87/197 (in French).
9. K. Jensen, “Coloured Petri nets and the invariant method,” Theoretical Comp. Sci., vol. 14, pp. 317–336, 1981.
10. C. Dutheillet and S. Haddad, “Regular stochastic Petri nets,” in Proc. 10th Int. Conf. Application and Theory of Petri Nets, Bonn, Germany, June 1989.
11. C. Dutheillet and S. Haddad, “Aggregation and disaggregation of states in colored stochastic Petri nets: Application to a multiprocessor architecture,” in Proc. 3rd Int. Workshop Petri Nets and Performance Models, Kyoto, Japan, December 1989.
12. P. Huber, A. M. Jensen, L. O. Jepsen, and K. Jensen, “Towards reachability trees for high-level Petri nets,” in Advances on Petri Nets ’84, vol. 188, LNCS, G. Rozenberg, Ed. New York: Springer-Verlag, 1984, 215–233.
13. A. Zenie, “Colored stochastic Petri nets,” in Proc. Int. Workshop Timed Petri Nets, Torino, Italy, July 1985, pp. 262–271.
14. J. A. Carrasco, “Automated construction of compound Markov chains from generalized stochastic high-level Petri nets,” in Proc. 3rd Int. Workshop Petri Nets and Performance Models, Kyoto, Japan, Dec. 1989, 93–102.
15. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “On well-formed coloured nets and their symbolic reachability graph,” in Proc. 11th Int. Conf. Application and Theory of Petri Nets, Paris, France, June 1990; reprinted in High-Level Petri Nets, Theory and Application, K. Jensen and G. Rozenberg, Eds. New York: Springer-Verlag, 1991.
16. C. Dutheillet, “Symetries dans les reseaux colores. Definition, analyse et application a revaluation de performances,” Ph.D. dissertation, Lab. MASI, Universite P. et M. Curie (Paris 6), France, Jan. 1991 (in French).
17. T. Murata, “Petri nets: Properties, analysis, and applications,” Proc. IEEE, vol. 77, pp. 541–580, Apr. 1989.
18. K. Jensen and G. Rozenberg, Eds. High-Level Petri Nets; Theory and Application. New York: Springer-Verlag, 1991.
19. G. Chiola, M. Ajmone Marsan, G. Balbo, and G. Conte, “Generalized stochastic Petri nets: A definition at the net level and its implications,” IEEE Trans. Software Eng., vol. 19, pp. 89–102, Feb. 1993.
20. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, “Stochastic well-formed coloured nets and multiprocessor modeling applications,” in High-Level Petri Nets; Theory and Application, K. Jensen and G. Rozenberg, Eds. New York: Springer Verlag, 1991.
21. G. Chiola, R. Gaeta, and M. Ribaudo, “Designing an efficient tool for stochastic well-formed coloured Petri nets,” in Proc. 6th Int. Conf. Modeling Techniques and Tools for Computer Performance Evaluation, Edinburg, UK, Sept. 1992, pp. 391–395.
22. G. Chiola, “Great SPN1.5 software architecture,” in Proc. 5th Int. Conf. Modeling Techniques and Tools for Computer Performance Evaluation, Torino, Italy, Feb. 1991.
23. M. Ajmone Marsan, G. Balbo, and G. Conte, “Comparative performance analysis of single bus multiprocessor architectures,” IEEE Trans. Comput., vol. C-31, Dec. 1982.
24. S. Haddad, “Generalization of reduction theory to coloured nets,” in Proc. 9th Europ. Workshop Application and Theory of Petri Nets, Venezia, Italy, June 1988.
25. G. Chiola, S. Donatelli, and G. Franceschinis, “GSPN versus SPN: What is the actual role of immediate transitions?” in Proc. 4th Int. Workshop Petri Nets and Performance Models, Melbourne, Australia, Dec. 1991, pp. 20–31.
26. G. Balbo, G. Chiola, S. C. Bruell, and P. Chen, “An example of modeling and evaluation of a concurrent program using coloured stochastic Petri nets: Lamport’s fast mutual exclusion algorithm,” IEEE Trans. Parallel Distrib. Syst., vol. 3, pp. 221–240, Mar. 1992.