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 published on a yearly basis
Papers
More filters
01 Dec 2004
TL;DR: List of CONTRIBUTors PREFACE INTRODUCTION to DEADLOCK RESEARCH in COMPUTER-INTEGRATED SYSTEMS M.P. Fanti and M.C. Zhou DEADLOCK AVOIDANCE and DYNAMIC ROUTing FLEXIBILITY in AUTOMATED MANUFACTURING SYSTEMS, and the EFFECT of MODELING and CONTROL TECHNIQUES on the MANAGEMENT of DEADLOCKS in FMS.
Abstract: LIST OF CONTRIBUTORS PREFACE INTRODUCTION TO DEADLOCK RESEARCH IN COMPUTER-INTEGRATED SYSTEMS M.P. Fanti and M.C. Zhou DEADLOCK AVOIDANCE IN AUTOMATED MANUFACTURING SYSTEMS USING FINITE AUTOMATA AND STATE SPACE SEARCH A. Yalcin, T. Tai, and T.O. Boucher SYNTHESIS OF DEADLOCK-FREE SUPERVISORY CONTROLLERS USING AUTOMATA A. Ramirez-Serrano and B. Benhabib DEADLOCK AVOIDANCE AND DYNAMIC ROUTING FLEXIBILITY IN AUTOMATED MANUFACTURING SYSTEMS M. Lawley DIGRAPH-BASED TECHNIQUES FOR DEADLOCK RESOLUTION IN AUTOMATED MANUFACTURING SYSTEMS M.P. Fanti, B. Maione, G. Maione, and B. Turchiano DEADLOCK-FREE SUPERVISORY CONTROL FOR ASSEMBLY AND DISASSEMBLY SYSTEMS E. Roszkowska DEADLOCK AVOIDANCE ALGORITHMS AND IMPLEMENTATION: A MATRIX-BASED APPROACH J. Mireles Jr., F. Lewis, A. Gurel, and S. Bogdan DEADLOCK DETECTION AND PREVENTION OF AUTOMATED MANUFACTURING SYSTEMS USING PETRI NETS AND SIPHONS M.D. Jeng, and X. Xie SIPHON-BASED CHARACTERIZATION OF LIVENESS AND LIVENESS-ENFORCING SUPERVISION FOR SEQUENTIAL RESOURCE ALLOCATION SYSTEMS S. Reveliotis ELEMENTARY SIPHONS OF PETRI NETS FOR EFFICIENT DEADLOCK CONTROL Z. Li and M.C. Zhou RESOURCE-ORIENTED PETRI NETS IN DEADLOCK PREVENTION AND AVOIDANCE N. Wu and M.C. Zhou THE EFFECT OF MODELING AND CONTROL TECHNIQUES ON THE MANAGEMENT OF DEADLOCKS IN FMS L. Ferrarini and L. Piroddi DEADLOCK CHARACTERIZATION AND RESOLUTION IN INTERCONNECTION NETWORKS T. M. Pinkston DEADLOCK MODELS FOR A MULTI-SERVICE MEDIUM ACCESS PROTOCOL EMPLOYING A SLOTTED ALOHA OR Q-ARY TREE BASED SIGNALING CHANNEL M.V. Ivanovich DEADLOCK-FREE TCP OVER HIGH-SPEED INTERNET R.K.C. Chang, H.Y. Chan and A.W. Yeung DEADLOCK RESOLUTION IN LARGE-SCALE INTERNET COMPUTING J. Park MODELS USED IN STATIC ANALYSIS FOR DEADLOCKS OF ADA TASKING PROGRAMS M. Tiusanen and T. Murata DEADLOCK HANDLING IN DATABASE SYSTEMS M. Weske INDEX
115 citations
23 Jun 2009
TL;DR: This paper proposes a three-step solution that automatically adapts terminal models to their evolving metamodels, and validates the ideas by implementing a prototype based on the AtlanMod Model Management Architecture (AMMA) platform.
Abstract: Technological and business changes influence the evolution of software systems. When this happens, the software artifacts may need to be adapted to the changes. This need is rapidly increasing in systems built using the Model-Driven Engineering (MDE) paradigm. An MDE system basically consists of metamodels, terminal models, and transformations. The evolution of a metamodel may render its related terminal models and transformations invalid. This paper proposes a three-step solution that automatically adapts terminal models to their evolving metamodels. The first step computes the equivalences and (simple and complex) changes between a given metamodel, and a former version of the same metamodel. The second step translates the equivalences and differences into an adaptation transformation. This transformation can then be executed in a third step to adapt to the new version any terminal model conforming to the former version. We validate our ideas by implementing a prototype based on the AtlanMod Model Management Architecture (AMMA) platform. We present the accuracy and performance that the prototype delivers on two concrete examples: a Petri Net metamodel from the research literature, and the Netbeans Java metamodel.
115 citations
TL;DR: It is shown that a bounded OR-AND GMEC can be enforced by a special control structure composed by a set of AND-GMEC monitor places plus a switcher that determines the current active ones.
Abstract: In this paper, a type of specifications called OR-AND Generalized Mutual Exclusion Constraints (GMEC) for place/transition nets is defined. Such a specification consists of a disjunction of conjunction of several single GMECs, i.e., the requirement is that, at any given time, the controlled system should satisfy at least one set of conjunctive GMECs. We show that a bounded OR-AND GMEC can be enforced by a special control structure composed by a set of AND-GMEC monitor places plus a switcher that determines the current active ones. We also show that such a simple control structure can be modified to ensure maximal permissiveness. This approach can be used in the framework of supervisory control in Petri nets.
115 citations
05 Jan 2016
TL;DR: This work studies the scheduling problem of a single-arm multicluster tool with a linear topology and process-bound bottleneck individual tool to find a one-wafer cyclic schedule such that the lower bound of cycle time is reached by optimally configuration spaces in buffering modules that link individual cluster tools.
Abstract: This work studies the scheduling problem of a single-arm multicluster tool with a linear topology and process-bound bottleneck individual tool. The objective is to find a one-wafer cyclic schedule such that the lower bound of cycle time is reached by optimally configuring spaces in buffering modules that link individual cluster tools. A Petri net (PN) model is developed to describe the dynamic behavior of the system by extending resource-oriented PNs such that a schedule can be parameterized by robots’ waiting time. Based on this model, conditions are presented under which a one-wafer cyclic schedule with the lower bound of cycle time can be found. With the derived conditions, an algorithm is developed to find such a schedule and optimally configure buffer spaces. The algorithm requires only simple calculation to set the robots’ waiting time and buffer size. Illustrative examples are presented to demonstrate the proposed method.
115 citations
TL;DR: The proposed net model offers a syntactical variant of Horn clause logic and has two distinctions from other existing schemes for the logic programs: representation formalism and the deduction method.
Abstract: A predicate/transition net model for a subset of Horn clause logic programs is presented. The syntax, transformation procedure, semantics, and deduction process for the net model are discussed. A possible parallel implementation for the net model is described, which is based on the concepts of communicating processes and relations. The proposed net model offers a syntactical variant of Horn clause logic and has two distinctions from other existing schemes for the logic programs: representation formalism and the deduction method. The net model provides an approach towards the solutions of the separation of logic from control and the improvement of the execution efficiency through parallel processing for the logic programs. The abstract nature of the net model also lends itself to different implementation strategies. >
114 citations