Abstract
Modern manufacturing systems are highly parallel and distributed. They need to be analyzed from qualitative and quantitative points of view. Qualitative analysis looks for properties like the absence of deadlocks, the absence of (store) overflows, or the presence of certain mutual exclusions in the use of shared resources (e.g. a robot). Its ultimate goal is to prove the correctness of the modeled system. Quantitative analysis looks for performance properties (e.g. throughput), responsiveness properties (e.g. average completion times) or utilization properties (e.g. average queue lengths or utilization rates). In other words, the quantitative analysis concerns the evaluation of the efficiency of the modeled system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Ajmone, M., Balbo, G. and Conte, G. A class of generalized stochastic Petri nets for the performance analysis of multiprocessor systems. ACM Transactions on Computer Systems, 2(2), 93–122, May 1984.
Ajmone, M., Balbo, G. and Conte, G. Performance Models of Multiprocessor Systems. MIT Press, Cambridge, MA, 1987.
Ajmone, M., Balbo, G., Bobbio, A., Chiola, G., Conte, G. and Cumani, A. The effect of execution policies on the semantic and analysis of stochastic Petri nets. IEEE Transactions on Software Engineering, 15(7), 832–846, July 1989.
Al-Jaar, R. Y. and Desrochers, A. A survey of Petri nets in automated manufacturing systems. In IMACS World Congress, vol. 2, pp. 503–510, Paris, June 1988.
Berthelot, G. Transformations and decompositions of nets. In W. Brauer et al. (1987a), pp. 359–376, 1987.
Berthelot, G., Roucairol, G. and Valk, R. Reductions of nets and parallel programs. In Brauer (1980), pp. 277–290, 1980.
Best, E. Structure theory of Petri nets: the free choice hiatus. In W. Brauer et al. (1987a), pp. 168–205, 1987.
Best, E. and Thiagarajan, P. S. Some classes of live and save Petri nets. In Voss et al. (1987), pp. 71–94, 1987.
Best, E., Cherskasova, L., Desel, J. and Esparza, J. Characterization of home states in free choice systems. Hildesheimer Informatik-Berichte, no. 7/90, July 1990.
Brams, G. W. Réseaux de Petri: théorie et pratique (2 vols). Paris, Masson, 1983.
Brauer, W. (ed.) Net Theory and Applications. LNCS ′84, Springer-Verlag, Berlin, 1980.
Brauer, W., Reisig, W. and Rozenberg, G. Petri Nets: Central Models and their Properties. LNCS 254, Springer-Verlag, Berlin, 1987a.
Brauer, W., Reisig, W. and Rozenberg, G. Petri Nets: Applications and Relationships to other Models of Concurrency. LNCS 255, Springer-Verlag, Berlin, 1987b.
Brauer, W., Gold, R. and Vogler, W. A survey of behaviour and equivalence preserving refinements of Petri nets. Advances in Petri Nets ′90. (G. Rozenberg, ed.), LNCS 483, pp. 1–46. Springer-Verlag, Berlin, 1991.
Breeding, K. I. Digital Design Fundamentals. Prentice-Hall, Englewood Cliffs, NJ, 1989.
Bruno, G. and Marchetto, G. Process translatable Petri-nets for the rapid prototyping of control systems. IEEE Transactions on Software Engineering, vol. SE-12, no. 2, pp. 346–357, February 1985.
Campos, J., Colom, J. M. and Silva, M. Performance evaluation of repetitive automated manufacturing systems. In Proceedings of the 2nd International Conference on Computer Integrated Manufacturing (IEEE Computer Society Press). Troy, New York, pp. 78–91, May 1990.
Campos, J., Chiola, G. and Silva, M. Properties and performance bounds for closed free choice synchronized monoclass queueing networks. IEEE Transactions on Automatic Control, 36(12), December 1991. [Special issue on Multidimensional Queueing Networks.]
Colom, J. M. and Silva, M. Convex geometry and semiflows in P/T nets. Advances in Petri Nets ′90 (G. Rozenberg, ed.). LNCS 483, Springer-Verlag, Berlin, pp. 79–112, 1991a.
Colom, J. M. and Silva, M. Improving the linearly based characterization of P/T nets. Advances in Petri Nets ′90 (G. Rozenberg, ed.). LNCS 483, Springer-Verlag, Berlin, pp. 113–145, 1991b.
Colom, J. M., Silva, M. and Villarroel, J. L. On software implementations of Petri nets and colored Petri nets using high-level concurrent languages. In Proceedings of the 7th European Workshop on Application and Theory of Petri Nets. Oxford, pp. 207–241, July 1986.
Colom, J. M., Campos, J. and Silva, M. On liveness analysis through linear algebraic techniques. Dpto. Ing. Eléctrica e Informática, Research Report RR-90-11 (16 pp.). Also in Deliverables of Esprit Basic Research Action Demon, June 1990.
Commoner, F., Holt, A. W., Even, S. and Pnueli, A. Marked directed graphs. Journal of Computer and System Sciences, vol. 9, no. 2, pp. 72–79, 1971.
Dallery, Y., Liu, Z. and Towsley, D. Equivalence, reversibility and symmetry properties in fork/join queueing networks with blocking. Université Pierre et Marie Curie, MASI Technical Report 90–32, Paris, June 1990.
David, R. and Alla, H. Du grafcet aux réseaux de Petri. Hermes, Paris, 1989.
Deo, N. Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, Englewood Cliffs, NJ, 1974.
Desel, J. and Esparza, J. Reachability in reversible free-choice systems. Technical University of Munich, SFB-Bericht, No. 342/11/90A, June 1990.
Ercegovac, M. and Lang, T. Digital Systems and Hardware, Firmware Algorithms. John Wiley & Sons, New York, 1985.
Esparza, J. and Silva, M. On the analysis and synthesis of free choice systems. Advances in Petri Nets ′91 (G. Rozenberg, ed.). LNCS 483, Springer-Verlag, Berlin, pp. 243–286, 1991a.
Esparza, J. and Silva, M. Top-down synthesis of live and bounded free-choice nets. In Proceedings of the 11th International Conference on Applications and Theory of Petri Nets, pp. 63–83. Paris, June 1991b.
Finkel, A. A minimal coverability graph for Petri nets. In Proceedings of the 11th International Conference on Applications and Theory of Petri Nets, pp. 1–21. Paris, June 1990.
Genrich, H. J. and Lautenbach, K. Synchronisationsgraphen. Acta Informatica 2, pp. 143–161.
Gershwin, S. B. Representation and analysis of transfer lines with machines that have different processing rates. Annals of Operations Research, 9, 511–530, 1987.
Gibbons, A. Algorithmic Graph Theory. Cambridge University Press, London, 1985.
Girault, C. and Reisig, W. (eds). Application and Theory of Petri Nets. Informatik-Fachberichte 52, Springer-Verlag, Berlin, 1982.
Hack, M. T. Analysis of production schemata by Petri nets. MIT, TR-94. Boston, 1972 (corrected June 1974).
Hillion, H. P. and Proth, J. M. Performance evaluation of job-shop systems using timed event-graphs. IEEE Transactions on Automatic Control, 34(1), 3–9, January 1989.
Jensen, K. and Rozenberg, G. (eds). High-Level Petri Nets. Theory and Application. Springer-Verlag, Berlin, 1991.
Karp, R. and Miller, R. Parallel program schemata. Journal of Computer and System Science, 3(4), 167–195, May 1969.
Mailles, D. Files d’attente descriptives pour la modélisation de la synchronisation dans les systèmes informatiques. Université P. et M. Curie. These d’Etat. September 1987.
MartÃnez, J., Alla, H. and Silva, M. Petri nets for the specification of FMSs. In Modelling and Design of Flexible Manufacturing Systems (A. Kusiak, ed.). Elsevier, pp. 389–406, 1986.
Memmi, G. and Roucairol, G. Linear algebra in net theory. In Brauer (1980), pp. 213–223, 1980.
Molloy, M. K. Performance analysis using stochastic Petri nets. IEEE Transactions on Computers, 31(9), 913–917, September 1982.
Murata, T. Circuit theoretic analysis and synthesis of marked graphs. IEEE Transactions on Circuits and Systems, 24(7), 400–405, 1977.
Murata, T. Petri nets: properties, analysis and applications. Proceedings of the IEEE, 77(4), 541–580, April 1989.
Murty, K. G. Linear Programming. John Wiley & Sons., New York, 1983.
Nelson, R. Haibt, L. and Sheridan, P. Casting Petri-nets into programs. IEEE Transactions on Software Engineering, 9(5), 590–602, September 1983.
Nemhauser, G. L., Rinnoy Kan, A. H. G. and Todd, M. J. Optimization. Volume I of Handbook in Operations Research and Management Science. North-Holland, Amsterdam, 1989.
Peterson, J. L. Petri Net Theory and the Modelling of Systems. Prentice Hall, Englewood Cliffs, NJ, 1981.
Petri, C. A. Kommunikation mit Automaten. Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM No. 2, 1962.
Proceedings of the European Workshop on Applications and Theory of Petri Nets (EWPN ′81: Bad Honnef, Germany; EWPN ′82: Varenna, Italy; EWPN ′83: Toulouse, France; EWPN ′84: Aarhus, Denmark; EWPN ′85: Helsinki, Finland; EWPN ′86: Oxford, UK; EWPN ′87: Zaragoza, Spain; EWPN ′88: Venezia, Italy; EWPN ′89: Bonn, Germany).
Proceedings of the International Conference on Applications and Theory of Petri Nets (ICPN ′89: Bonn, Germany; ICPN ′90: Paris, France; ICPN ′91: Gjern, Denmark).
Proceedings of the International Workshop on Petri Nets and Performance Models (PNPM ′87: Madison, WI, USA, August 1987; PNPM ′89: Kyoto, Japan, December 1989; PNPM ′91: Melbourne, Australia, December 1991). IEEE Computer Society Press.
Proceedings of the International Workshop on Timed Petri Nets. Torino, Italy IEEE-Computer Society Press, July 1985.
Rozenberg, G. (ed.) Advances in Petri Nets. Lecture Notes in Computer Science: 188 (APN ′84), 222 (APN ′85), 266 (APN ′87), 340 (APN ′88), 424 (APN ′89) and 483 (APN ′90). Springer-Verlag, Berlin, various years.
Silva, M. Sur le concept de macroplace et son utilisation pour l’analyse des reseaux de Petri. RAIRO-Systems Analysis and Control, 15(4), 57–67, 1981.
Silva, M. Las redes de Petri en la Automática y la Informática. Editorial AC, Madrid, 1985.
Silva, M. and Velilla, S. Programmable logic controllers and Petri nets. In Proceedings of the International Symposium of the IFAC-IFIC on Software for Computer Control, SOCOCO ′82, pp. 29–34 (G. Ferraté and E. A. Puente, eds). Pergamon Press, Oxford, 1982.
Silva, M. and Colom, J. M. On the computation of structural synchronic invariants in P/T nets. Advances in Petri Nets ′88 (G. Rozenberg, ed.). LNCS 340, pp. 386–417, Springer-Verlag, Berlin, 1988.
Silva, M. and Valette, R. Petri nets and flexible manufacturing. Advances in Petri Nets ′89 (G. Rozenberg, ed.). LNCS 424, pp. 375–417. Springer-Verlag, Berlin, 1990.
Suzuki, I. and Murata, T. A method for stepwise refinement and abstraction of Petri nets. Journal of Computer and Systems Sciences, 27(1), 51–76, August 1983.
Thulasiraman, K. and Comeau, M. Maximum-weight marking in marked graphs: algorithms and interpretations based on the simplex method. IEEE Transactions on Circuits and Systems, 34(12), 1535–1545, December M1987.
Valette, R. Analysis of Petri nets by stepwise refinements. Journal of Computer and Systems Sciences, vol. 18, pp. 35–46, 1979.
Valette, R. Nets in production systems. In Brauer (1987b), pp. 191–217, 1987.
Valette, R., Courvoisier, M., Bigou, J. M. and Alburkerque, J. A. A Petri net based programmable logic controller. First International Conference on Computer Applications in Production and Engineering, CAPE ′83, Amsterdam, April 1983.
Voss, K., Genrich, H. J. and Rozenberg, G. (eds). Concurrency and Nets. Springer-Verlag, Berlin, 1987.
Rights and permissions
Copyright information
© 1993 F. DiCesare, G. Harhalakis, J. M. Proth, M. Silva and F. B. Vernadat
About this chapter
Cite this chapter
Silva, M. (1993). Introducing Petri nets. In: Practice of Petri Nets in Manufacturing. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-6955-4_1
Download citation
DOI: https://doi.org/10.1007/978-94-011-6955-4_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-011-6957-8
Online ISBN: 978-94-011-6955-4
eBook Packages: Springer Book Archive