skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Modeling and performance evaluation of flexible manufacturing systems using Petri nets

Abstract

A timed Petri net approach is used to model resource allocation-utilization-release patterns for performance evaluation. First, simple resource utilization sequences are derived from a directed graph representing the process plan of parts. Second, the place-transitions sequences are connected introducing places whose marking models the resources needed to perform the manufacturing operation indicated in the process plan. Time is introduced as a permanence time of tokens at the place-transition sequence, modeling the utilization time of resources. The corresponding model leads to a simultaneous resource possession problem. Finally, flow equations for the description of the quantitative behavior of the resulting timed Petri net are presented. A major conclusion of the paper is that performance evaluation can be adequately abstracted and analytically solved, in a simple way, even in presence of complicating factors like resource sharing and routing flexibility in process plans.

Authors:
; ;  [1]
  1. Eletrica e Informatica Industrial, Curitiba (Brazil)
Publication Date:
OSTI Identifier:
501756
Report Number(s):
CONF-961239-
TRN: 97:002725-0046
Resource Type:
Conference
Resource Relation:
Conference: IDPT-2: 2. world conference on integrated design and process technology, Austin, TX (United States), 1-4 Dec 1996; Other Information: PBD: 1996; Related Information: Is Part Of Integrated design and process technology. Volume 3; Esat, I.I.; Veniali, F.; Rasty, J.; Gransberg, D.D.; Ertas, A. [eds.]; PB: 407 p.
Country of Publication:
United States
Language:
English
Subject:
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION; 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; MANUFACTURING; PERFORMANCE TESTING; NETWORK ANALYSIS; MATHEMATICAL MODELS; ALGORITHMS

Citation Formats

Callotta, M.P., Cimenez, C., and Tazza, M. Modeling and performance evaluation of flexible manufacturing systems using Petri nets. United States: N. p., 1996. Web.
Callotta, M.P., Cimenez, C., & Tazza, M. Modeling and performance evaluation of flexible manufacturing systems using Petri nets. United States.
Callotta, M.P., Cimenez, C., and Tazza, M. 1996. "Modeling and performance evaluation of flexible manufacturing systems using Petri nets". United States. doi:.
@article{osti_501756,
title = {Modeling and performance evaluation of flexible manufacturing systems using Petri nets},
author = {Callotta, M.P. and Cimenez, C. and Tazza, M.},
abstractNote = {A timed Petri net approach is used to model resource allocation-utilization-release patterns for performance evaluation. First, simple resource utilization sequences are derived from a directed graph representing the process plan of parts. Second, the place-transitions sequences are connected introducing places whose marking models the resources needed to perform the manufacturing operation indicated in the process plan. Time is introduced as a permanence time of tokens at the place-transition sequence, modeling the utilization time of resources. The corresponding model leads to a simultaneous resource possession problem. Finally, flow equations for the description of the quantitative behavior of the resulting timed Petri net are presented. A major conclusion of the paper is that performance evaluation can be adequately abstracted and analytically solved, in a simple way, even in presence of complicating factors like resource sharing and routing flexibility in process plans.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 1996,
month =
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In this paper the authors prove that the minimal cycle time problem, for non-P-invariant Petri nets and for a small subclass of P-invariant Petri nets called free-choice nets having live and safe marking, is NP-complete.
  • This thesis addresses the issue of being able to efficiently solve large, complex computer system models by means of a unified technique that employs a combination of product-form queueing networks and Generalized Stochastic Petri Nets. An algorithm is developed for the solution of homogeneous queueing networks with many processors and many classes. Because of the exponential complexity in terms of the number of classes for the general-purpose algorithms like Mean Value Analysis, medium to large-sized networks are beyond tractability. A particular class of queueing network is identified that is suitable for modeling local area networks; then a polynomial algorithm ismore » developed for the solution of this category of networks that exploits the inherent symmetry of these networks. The author then describes the central ideas behind a new modeling technique that combines the best features of product form queueing networks and Generalized Stochastic Petri Nets. He explains how this technique is related to many other existing techniques. This technique has the following features: (1) a representational power and/or flexibility comparable to that of Generalized Stochastic Petri Nets: (2) an accuracy comparable to that found when using a complete set of global balance equations for the system model; and (3) an efficiency comparable to that of product-form queueing networks.« less
  • Generalized stochastic Petri nets (GSPNs) are presented and are applied to the performance evaluation of multiprocessor systems. GSPNs are derived from standard Petri nets by partitioning the set of transitions into two subsets comprising timed and immediate transitions. An exponentially distributed random firing time is associated with each timed transition, whereas immediate transitions fire in zero time. It is shown that GSPN are equivalent to continuous-time stochastic processes, and solution methods for the derivation of the steady state probability distribution are presented. Examples of application of gspn models to the performance evaluation of multiprocessor systems show the usefulness and themore » effectiveness of this modeling tool. 15 references.« less
  • The ability to model the iteration between the hardware and the software components of a system is extremely useful in distributed system design, real-time system analysis, parallel algorithm design, and several other significant areas of research. Non-deterministic performance analysis of such interactions carried out using simulation methods, queueing analysis or hybrid methods, becomes prohibitively expensive for systems of any practical interest.
  • This paper is concerned with the application of a formal technique to software engineering. In this case study we have used rule-based refinement of algebraic high-level nets for the requirements engineering of a medical information system. We outline the basic ideas of rule-based refinement and discuss how this technique is applied to the development from actual state analysis to functional essence.