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
Proceedings Article•DOI•
A top-down approach to systematic synthesis of Petri net models for manufacturing systems

[...]

MengChu Zhou1, Frank DiCesare1, Alan A. Desrochers1•
Rensselaer Polytechnic Institute1
14 May 1989
TL;DR: Using the proposed method, it is possible to obtain a Petri net model which is guaranteed to have the most important properties in the context of manufacturing: safeness, liveness, and reversibility.
Abstract: The authors propose an approach to systematic synthesis of Petri net models for manufacturing systems. It is based on top-down, modular, and decomposition philosophies which make the stepwise refinement of the Petri-net models possible. Using the proposed method, it is possible to obtain a Petri net model which is guaranteed to have the most important properties in the context of manufacturing: safeness, liveness, and reversibility. A formal problem statement is presented first. Then, the previous research on synthesis approaches is reviewed. Next, several modules are defined which, when combined according to a proposed algorithm, lead to the derived model. It is proven that the algorithm yields the safeness, liveness, and reversibility properties. An example of piston-rod assembly is used to demonstrate the proposed method. >

71 citations

Book Chapter•DOI•
Liveness and Boundedness Analysis for Petri Nets with Event Graph Modules

[...]

Vanio M. Savi1, Xiaolan Xie1•
French Institute for Research in Computer Science and Automation1
22 Jun 1992
TL;DR: It is proved that each event graph module can be replaced by a simple but still equivalent event graph model called minimal representation in which the internal transitions of the initial module are removed.
Abstract: An efficient way to cope with the complexity in modelling a large-scale system consists in decomposing it into subsystems called modules, modelling each module using Petri nets and integrating these models together to obtain the model of the whole system. This paper addresses the liveness and boundedness analysis for a Petri net model with event graph modules (also called marked graphs). We prove that each event graph module can be replaced by a simple but still equivalent event graph model called minimal representation in which the internal transitions of the initial module are removed. We also prove some properties of general Petri nets which allow to simplify the liveness and boundedness analysis.

28 citations

Proceedings Article•DOI•
Synthesis method using deviation bounds in automated manufacturing systems

[...]

I. Koh1, Frank DiCesare1•
Rensselaer Polytechnic Institute1
12 May 1992
TL;DR: The authors describe the resource sharing interaction between subprocesses, which frequently appear in automated manufacturing systems, using the deviation bound and a weighted deviation bound is introduced and used to characterize concurrency in generalized Petri nets.
Abstract: The authors describe the resource sharing interaction between subprocesses, which frequently appear in automated manufacturing systems, using the deviation bound. The results are used for synthesizing Petri nets in which liveness and boundedness are guaranteed. A shared resource net that can be considered a basic formulation for handling shared resource problems is introduced. A weighted deviation bound is introduced and used to characterize concurrency in generalized Petri nets. >

4 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.