scispace - formally typeset
Search or ask a question
Topic

Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This work proves the existence of its onewafer cyclic schedule that features with the ease of industrial implementation and the use of the found schedules enables industrial multi-cluster tools to operate with their highest productivity.
Abstract: A treelike hybrid multi-cluster tool is composed of both single-arm and dual-arm cluster tools with a treelike topology. Scheduling such a tool is challenging. For a hybrid treelike multi-cluster tool whose bottleneck individual tool is process-bound, this work aims at finding its optimal one-wafer cyclic schedule. It is modeled with Petri nets such that a onewafer cyclic schedule is parameterized as its robots’ waiting time. Based on the model, this work proves the existence of its onewafer cyclic schedule that features with the ease of industrial implementation. Then, computationally efficient algorithms are proposed to find the minimal cycle time and optimal onewafer cyclic schedule. Multi-cluster tool examples are given to illustrate the proposed approach. The use of the found schedules enables industrial multi-cluster tools to operate with their highest productivity.

82 citations

Journal ArticleDOI
01 Apr 2000
TL;DR: Three planning and execution algorithms (globally fixed, limited adaptive, adaptive) are presented for disassembly processes and Petri nets are demonstrated comprehensively through a robotic disassembly system.
Abstract: This paper presents a methodology for designing and implementing disassembly plans and processes using Petri nets (PN) for remanufacturing obsolete products. Process modeling and planning using PN are discussed. The proposed PN accommodate product topology and precedence relations during disassembly. Decision values are attached to PN to enable consideration of uncertainty during process execution. The resulting planner guarantees the plan's optimality when product remanufacturing parameters are known. In cases of uncertainty about product parameters, an adaptation scheme is designed and implemented to facilitate the goal of maximum benefit. Three planning and execution algorithms (globally fixed, limited adaptive, adaptive) are presented for disassembly processes. They are demonstrated comprehensively through a robotic disassembly system, and its use is demonstrated in disassembly of a car radio.

82 citations

Journal ArticleDOI
Heinz Schmidt1
15 Mar 2003
TL;DR: Key requirements for an architecture-based approach to trustworthy components are defined, enabling prediction of extra-functional properties during architectural design and RADL contracts permit static compatibility checks and automatic gate adaptation for true black-box reuse.
Abstract: This article defines key requirements for an architecture-based approach to trustworthy components. We then provide a brief overview of our architecture definition language RADL with a focus on compositionality and extra-functional properties.RADL aims at very high-level specification and validation of hierarchical assemblies of distributed real-time components. Several ideas in RADL are oriented towards modern middleware technologies such as .NET and EJB and to software-engineering methods such as UML. RADL dynamic models are centered around contracts, state machines and Petri nets. These are associated to contact points and connectors for defining connection constraints in architectural specification. They define configuration and behavioral contracts when they are associated to components and architectural assemblies of components.RADL contracts permit static compatibility checks and automatic gate adaptation for true black-box reuse. Dynamic monitoring of deployed components complements this with execution-based mechanism enabling prediction of extra-functional properties during architectural design.

82 citations

Book ChapterDOI
TL;DR: The CO-OPN/2 formalism (Concurrent Object-Oriented Petri Net) which is devised for the specification of large concurrent systems is presented and a case study on groupware is adopted or, more specifically, on a cooperative editor of hierarchical diagrams.
Abstract: This paper presents and formally defines the CO-OPN/2 formalism (Concurrent Object-Oriented Petri Net) which is devised for the specification of large concurrent systems. We introduce the basic principles of the formalism, and describe how some aspects of objectorientation - such as the notions of class/object, object reference, inheritance and subtyping - are taken into account. In CO-OPN/2, classes (considered as templates) are described by means of algebraic nets in which places play the role of attributes, and methods are external parameterized transitions. A semantic extension for the management of the object references is defined. Inheritance and subtyping are clearly distinguished. Interaction between objects consists of synchronizations. Synchronization expressions are provided which allow the designer to select interaction policies between the partners. We also provide a step semantics which expresses the true concurrency of the object behaviors. Finally, in order to illustrate the modeling capabilities of our formalism, we adopted a case study on groupware or, more specifically, on a cooperative editor of hierarchical diagrams.

82 citations

Book ChapterDOI
01 Jun 1991
TL;DR: A new solution to the problem of finding generating families of siphons, traps, traps and st-components in Petri Nets by means of transformation into a system of linear equations.
Abstract: In this paper we propose a new solution to the problem of finding generating families of siphons (structural dead-locks in classical terminology), traps and st-components in Petri Nets. These families are obtained as solutions of some systems of linear inequalities. Their transformation into a system of linear equations allows to interpret the technique as follows: traps (siphons, st-components) of a net N are deduced from the support of psemiflows of a transformed net NΘ(NΣ,NΣΘ).

82 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
85% related
Control system
129K papers, 1.5M citations
85% related
Server
79.5K papers, 1.4M citations
85% related
Fuzzy logic
151.2K papers, 2.3M citations
85% related
Robustness (computer science)
94.7K papers, 1.6M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023290
2022662
2021466
2020574
2019651
2018751