scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A class of Petri nets for manufacturing system integration

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 ArticleDOI
TL;DR: The methodology has two distinctive features, namely, a formal specification of use cases and a rigorous and systematic process for deriving a system design whose correctness and consistency can be optimally achieved.

23 citations

Journal ArticleDOI
TL;DR: In this paper, the issue of resource failures in automated flexible manufacturing cells is addressed, and systematic procedures are described to re-configure the supervisor to continue operation of the system.
Abstract: An important consideration in the real-time supervisory control of flexible manufacturing systems is the resource failures. These disturbances may cause pre-determined part processing sequences impossible to execute. In this paper the issue of resource failures in automated flexible manufacturing cells is addressed. Failures both during processing and in the idle mode are considered, and systematic procedures are described to re-configure the supervisor to continue operation of the system. The described supervisory controller based on finite automata formalism accommodates resource failures, while taking into consideration deadlocks and dynamic routing flexibility options when generating a set of allowable events for the real-time control of automated flexible manufacturing cells.

23 citations

Journal ArticleDOI
Liming Wang1, Xiaolan Xie1
01 Oct 1996
TL;DR: This paper introduces a class of Petri nets with input and output transitions called extended controllable-output (ECO) nets, and shows that the integration of such Petrinets preserves these properties under some fairly weak conditions as the integrated model is also an ECO net.
Abstract: In this paper, we introduce a class of Petri nets with input and output transitions called extended controllable-output (ECO) nets. These nets are live and reversible. By appropriate control, it is possible to realize the output transitions in any given ratio while keeping the marking bounded. These properties are highly needed from a manufacturing point of view. Furthermore, we show that the integration of such Petri nets preserves these properties under some fairly weak conditions as the integrated model is also an ECO net.

21 citations

Journal ArticleDOI
TL;DR: A timed process algebra called BTC (for bounded true concurrency) is developed by extending CSP in order to consider the duration of actions and the context in which processes are executed, able to take into account that the resources in a system must be shared by all the processes.

19 citations


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

  • ...Hybrid methodologies [9] combine the features of top-down and bottom-up approaches....

    [...]

Journal ArticleDOI
TL;DR: A new modeling methodology termed as Extended Color Time Net of Set of Simple Sequential Process with Resources (ECTS3PR) has been presented that efficiently handles dynamic behavior of the manufacturing system and performs better than various benchmark strategies available in the literature.
Abstract: Deadlock-free scheduling of parts is vital for increasing the utilization of an Automated Manufacturing System (AMS). An existing literature survey has identified the role of an effective modeling methodology for AMS in ensuring the appropriate scheduling of the parts on the available resources. In this paper, a new modeling methodology termed as Extended Color Time Net of Set of Simple Sequential Process with Resources (ECTS3PR) has been presented that efficiently handles dynamic behavior of the manufacturing system. The model is subsequently utilized to obtain a deadlock-free schedule with minimized makespan using a new Evolutionary Endosymbiotic Learning Automata (EELA) algorithm. The ECTS3PR model, which can easily handle various relations and structural interactions, proves to be very helpful in measuring and managing system performances. The novel algorithm EELA has the merits of both endosymbiotic systems and learning automata. The proposed algorithm performs better than various benchmark strategies available in the literature. Extensive experiments have been performed to examine the effectiveness of the proposed methodology, and the results obtained over different data sets of varying dimensions authenticate the performance claim. Superiority of the proposed approach has been validated by defining a new performance index termed as the ‘makespan index’ (MI), whereas the ANOVA analysis reveals the robustness of the algorithm.

17 citations

References
More filters
Journal ArticleDOI
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 ArticleDOI
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 ArticleDOI
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
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
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

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.