scispace - formally typeset
Search or ask a question
Journal Article•DOI•

A class of Petri nets for manufacturing system integration

Jean-Marie Proth, Liming Wang1, Xiaolan Xie2•
University of Manitoba1, French Institute for Research in Computer Science and Automation2
01 Jun 1997-Vol. 13, Iss: 3, pp 317-326
TL;DR: A class of Petri nets which are reversible, live, and can be kept bounded, which is expected to shed light on the design, management and control of large scale manufacturing systems since modular approach is a way to cope with complexity.
Abstract: This paper introduces a class of Petri nets which are reversible, live, and can be kept bounded. Furthermore, these Petri nets have output transitions that can be fired independently from each other. These properties are required when modeling manufacturing systems. Another important property is that the integration of models which belong to this class of Petri nets still belongs to the same class, assuming that the integration is performed following rules which reflect common manufacturing practice. As a result, the qualitative properties of the module models are preserved. The results obtained in this paper are expected to shed light on the design, management and control of large scale manufacturing systems since modular approach is a way to cope with complexity.

Summary (1 min read)

Jump to:  and [Summary]

Summary

  • HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.
  • The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

Did you find this useful? Give us your feedback

Content maybe subject to copyright    Report

HAL Id: inria-00074617
https://hal.inria.fr/inria-00074617
Submitted on 24 May 2006
HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entic research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diusion de documents
scientiques de niveau recherche, publiés ou non,
émanant des établissements d’enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.
A class of Petri nets for manufacturing system
integration
Jean-Marie Proth, Liming Wang, Xiaolan Xie
To cite this version:
Jean-Marie Proth, Liming Wang, Xiaolan Xie. A class of Petri nets for manufacturing system inte-
gration. [Research Report] RR-2055, INRIA. 1993, pp.28. �inria-00074617�
Citations
More filters
Journal Article•DOI•
Scheduling of flexible manufacturing systems: An ant colony optimization approach

[...]

Ravinder Kumar, Manoj Kumar Tiwari, Ravi Shankar
01 Oct 2003
TL;DR: In this paper, the ant colony optimization (ACO) technique has been used to solve the scheduling problem of FMSs in manufacturing systems using a graph-based representation with nodes and arcs representing operation and transfer.
Abstract: The scheduling problem forexiblemanufacturing systems (FMSs)has beenattempted inthis paper using the ant colony optimization (ACO) technique. Since the operation of a job in FMSs can be performed on more than one machine, the scheduling of the FMS is considered as a computationally hard problem. Ant algorithms are based on the foraging behaviour of real ants. The article deals with the ant algorithm with certain modi® cations that make it suitable for application to the required problem. The proposed solution procedure applies a graph-based representation technique with nodes and arcs representing operation and transfer from one stage of processing to the other. Individual ants move from the initial node to the ® nal node through all nodes desired to be visited. The solution of the algorithm is a collective outcome of the solution found by all the ants. The pheromone trail is updated after all the ants have found out their respective solutions. Various features like stagnation avoidance and prevention from quick convergence have been incorporated in the proposed algorithm so that the near-optimal solution is obtained for the FMS scheduling problem, which is considered as a non-polynomial (NP)-hard problem. The algorithm stabilizes to the solution in considerably lesser computational eA ort. Extensive computational experiments have been carried out to study the inuence of various parameters on the system performance.

117 citations

Journal Article•DOI•
Integrated system for BIM-based collaborative design

[...]

Minho Oh1, Jaewook Lee1, Seung Wan Hong2, Yongwook Jeong1•
Sejong University1, Inha University2
01 Oct 2015-Automation in Construction
TL;DR: In this article, the authors proposed an integrated design system for the improvement of BIM-based collaborative design, which consists of three modules: BIM Modeler, BIM Checker and BIM Server.

99 citations

Journal Article•DOI•
Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems-part I: Petri net modelling and heuristic search

[...]

Hongnian Yu1, A. Reyes, Shuang Cang2, S. Lloyd3•
University of Bradford1, University of Exeter2, University of Sussex3
01 Apr 2003-Computers & Industrial Engineering
TL;DR: A new class of PNs, Buffer-nets, for defining FMS is proposed, which enhances the modelling techniques for manufacturing systems with features that are considered difficult to model.

61 citations

Cites methods from "A class of Petri nets for manufactu..."

  • ...The recently proposed modular and hierarchical modelling techniques ( Proth et al., 1997; Wang & Xie, 1996; Yu et al., 1997) provide a promising method to solve the modelling problems of large manufacturing systems....

    [...]

  • ...The FMS introduced in Section 2 can be modelled using PNs (Lee & Dicesare, 1994; Lloyd et al., 1995; Proth et al., 1997; Reyes et al., 1998)....

    [...]

  • ...Some researchers in this area have defined several PN classes ( Proth, Wang, & Xie, 1997 ) for manufacturing systems by extending the PN modelling power (Konstans, Llyod, & Yu, 1998; Wang & Wu, 1998; Wang & Xie, 1996)....

    [...]

Journal Article•DOI•
Deadlock avoidance in flexible manufacturing systems using finite automata

[...]

Ali Yalcin1, Thomas O. Boucher•
Rutgers University1
01 Aug 2000
TL;DR: The issue of deadlock avoidance in systems having these characteristics and a deadlock-free and maximally permissive control policy that incorporates this flexibility is developed based on finite automata models of part process plans and the FMS.
Abstract: A distinguishing feature of a flexible manufacturing system (FMS) is the ability to perform multiple tasks in one machine or workstation (alternative machining) and the ability to process parts according to more than one sequence of operations (alternative sequencing). In this paper, we address the issue of deadlock avoidance in systems having these characteristics. A deadlock-free and maximally permissive control policy that incorporates this flexibility is developed based on finite automata models of part process plans and the FMS. The resulting supervisory controller is used for dynamic evaluation of deadlock avoidance based on the remaining processing requirements of the parts.

54 citations

Journal Article•DOI•
Production-process modelling based on production-management data: a Petri-net approach

[...]

Dejan Gradišar1, Gašper Mušič2•
Jožef Stefan Institute1, University of Ljubljana2
01 Dec 2007-International Journal of Computer Integrated Manufacturing
TL;DR: This paper describes how to apply timed Petri nets and existing production data to the modelling of production systems and describes a method for using these data to construct a Petri-net model algorithmically.
Abstract: During the development of a production control system, an appropriate model of the production process is needed to evaluate the various control strategies. This paper describes how to apply timed Petri nets and existing production data to the modelling of production systems. Information concerning the structure of a production facility and the products that can be produced is usually given in production-data management systems. We describe a method for using these data to construct a Petri-net model algorithmically. The timed Petri-net simulator, which was constructed in Matlab, is also described. This simulator makes it possible to introduce heuristics, and, in this way, various production scenarios can be evaluated. To demonstrate the applicability of our approach, we applied it to a scheduling problem in the production of furniture fittings.

30 citations

Cites background or methods from "A class of Petri nets for manufactu..."

  • ...Other approaches to the automatic synthesis of PN models are presented by Camurri et al. (1993), Ezpeleta and Colom (1997) and Basile et al. (2006) and special PN classes appropriate for modelling FMS appear in Proth et al. (1997), Van der Aalst (1998) and Janneck and Esser (2002)....

    [...]

  • ...Keywords: Timed Petri nets; Modelling; Scheduling; Production systems; Simulation...

    [...]

References
More filters
Journal Article•DOI•
Petri nets: Properties, analysis and applications

[...]

Tadao Murata1•
University of Illinois at Urbana–Champaign1
01 Apr 1989
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Abstract: Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >

10,755 citations

"A class of Petri nets for manufactu..." refers result in this paper

  • ...The proof of this claim is totally parallel to that of theorem 16 in [ 12 ]....

    [...]

Journal Article•DOI•
Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows

[...]

Zbigniew Banaszak, Bruce H. Krogh1•
Carnegie Mellon University1
01 Dec 1990
TL;DR: The authors develop a Petri net model of concurrent job flow and dynamic resource allocation in an FMS and define deadlock in terms of transition enabling in the PN model to prove that restricted deadlock can never occur for any resource allocation policy implemented under the DAA restriction policy.
Abstract: The concurrent flow of multiple jobs through a FMS can lead to deadlock conditions due to competition for limited resources in the system. The authors develop a Petri net (PN) model of concurrent job flow and dynamic resource allocation in an FMS and define deadlock in terms of transition enabling in the PN model. The problem of deadlock avoidance is addressed by introducing the notion of a restriction policy, which is a feedback policy for excluding some enabled transitions from the current resource allocation alternatives. The authors then present their deadlock avoidance algorithm (DAA) and prove that restricted deadlock can never occur for any resource allocation policy implemented under the DAA restriction policy. The DAA can be implemented easily in real time and is much less restrictive for FMS applications than existing algorithms for deadlock avoidance in computer systems. Application of the DAA is illustrated for three FMS examples: allocation of finite buffer space in a multicell machining facility, collision avoidance in a multirobot assembly cell, and coordination of multiple AGVs on a shop floor. >

522 citations

"A class of Petri nets for manufactu..." refers methods in this paper

  • ...It is worth mentioning that Petri nets have been used as well in the deadlock avoidance control of manufacturing systems in [ 2 ]....

    [...]

Journal Article•DOI•
A hybrid methodology for synthesis of Petri net models for manufacturing systems

[...]

MengChu Zhou1, Frank DiCesare2, Alan A. Desrochers2•
New Jersey Institute of Technology1, Rensselaer Polytechnic Institute2
01 Jun 1992
TL;DR: Petri nets are synthesized by first refining operation places through basic design modules in top-down modular ways, then adding nonshared resource places stepwise, and finally adding shared resources places step by step in a bottom-up manner.
Abstract: Beginning with a bounded (safe), live, or reversible Petri net as a first-level net model for a system, Petri nets are synthesized by first refining operation places through basic design modules in top-down modular ways, then adding nonshared resource places stepwise, and finally adding shared resource places step by step in a bottom-up manner. Refinement theory is extended to include reversibility of Petri nets. Parallel and sequential mutual exclusions are used to model shared resources. Design of the first-level Petri nets is discussed, and two basic kinds of Petri nets, choice-free and choice-synchronization, are given to cope with different types of manufacturing systems. The major advantages of the method are that the modeling details can be introduced in incremental ways such that complexity can be handled, and the important properties of the resulting Petri net are guaranteed so that costly mathematical analysis for boundedness, liveness, and reversibility can be avoided. A manufacturing system consisting of four machines, one assembly cell, two shared robots, and two buffers is used to illustrate the design methodology. >

425 citations

Book•
Graphes et algorithmes

[...]

Michel Gondran, Michel Minoux
01 Jan 1995
TL;DR: Les algorithmes approches / Annexes :Programmation lineaire - Programmation LINEAIR en nombres entiers - Relaxation lagrangienne et resolution du probleme dual - Programme dynamique - Les problemes de ratio m minimumm as discussed by the authors.
Abstract: 1.Generalites sur les graphes / 2.Le probleme du plus court chemin / 3. Les algebres de chemins / 4.Arbres et arborescences / 5. Flots et reseaux de transport / 6.Flots avec multiplicateurs.multiflots / 7.Couplages et b-couplages / 8.Parcours euleriens et hamiltoniens / 9.Matroides / 10.Les problemes"non polynomiaux"/ 11.Les algorithmes d'enumeration par separation et evaluations / 12.Les algorithmes approches / Annexes :Programmation lineaire - Programmation lineaire en nombres entiers - Relaxation lagrangienne et resolution du probleme dual - Programmation dynamique - Les problemes de ratio m minimumm

347 citations

Book•
Practice of Petri Nets in Manufacturing

[...]

Simon Peck
30 Sep 1993
TL;DR: This work introduces Petri nets, a model for manufacturing information systems, and some net subclasses and their analysis, as well as hybrid synthesis: combining top-down and bottom-up methods.
Abstract: Introduction. 1: Introducing Petri nets M. Silva. Nets and net systems. On modelling features. On net systems interpretations. Approaching concurrency qualitative problems. Qualitative analysis of net system models. Some net subclasses and their analysis. Concluding remarks. 3: Principles of system modelling J.M. Proth. Manufacturing system modelling: basic concepts. Transportation system between two points on a shop-floor. Storage facilities. Operation modelling. Tool systems. Material-handling systems. Conclusion. 3: Synthesis for manufacturing systems integration F. DiCesare, Mu Der Jeng. Introduction to Synthesis. Bottom-up synthesis. Top-down methods. Hybrid synthesis: combining top-down and bottom-up. Summary. 4: Performance evaluation of manufacturing systems J.M. Proth. Introduction. Event graphs: definition and properties. Manufacturing systems working on a cyclic basis. The general case. 5: Petri nets for manufacturing information systems G. Harhalakis, F.B. Vernadat. Introduction. Basics of manufacturing information systems. High-level Petri nets. Organization analysis and conceptual database design. Modeling, analysis and implementation of company policies. Conclusions. Index.

337 citations

Related Papers (5)
Petri nets: Properties, analysis and applications

[...]

01 Apr 1989
Tadao Murata
Automatic synthesis of colored Petri nets for the control of FMS

[...]

01 Jun 1997
Joaquín Ezpeleta, José Manuel Colom
Scheduling flexible manufacturing systems using Petri nets and heuristic search

[...]

01 Apr 1994
Doo Yong Lee, Frank DiCesare
A method for stepwise refinement and abstraction of Petri nets

[...]

01 Aug 1983-Journal of Computer and System Sciences
Ichiro Suzuki, Tadao Murata
Modular transformation methods for generalized Petri nets and their application to automated manufacturing systems

[...]

01 Nov 1991
I. Koh, Frank DiCesare
Frequently Asked Questions (1)
Q1. What contributions have the authors mentioned in the paper "A class of petri nets for manufacturing system integration" ?

HAL this paper is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.