Strict Minimal Siphon-Based Colored Petri Net Supervisor Synthesis for Automated Manufacturing Systems With Unreliable Resources

Various deadlock control policies for automated manufacturing systems with reliable and shared resources have been developed, based on Petri nets. In practical applications, a resource may be unreliable. Thus, the deadlock control policies proposed in previous studies are not applicable to such applications. This paper proposes a two-step robust deadlock control strategy for systems with unreliable and shared resources. In the first step, a live (deadlock-free) controlled system that does not consider the failure of resources is derived by using strict minimal siphon control. The second step deals with deadlock control issues caused by the failures of the resources. Considering all resource failures, a common recovery subnet based on colored Petri nets is proposed for all resource failures in the Petri net model. The recovery subnet is added to the derived system at the first step to make the system reliable. The proposed method has been tested using an automated manufacturing system deployed at King Saud University.publishedVersio

Intelligent Colored Token Petri Nets for Modeling, Control, and Validation of Dynamic Changes in Reconfigurable Manufacturing Systems

The invention of reconfigurable manufacturing systems (RMSs) has created a challenging problem: how to quickly and effectively modify an RMS to address dynamic changes in a manufacturing system, such as processing failures and rework, machine breakdowns, addition of new machines, addition of new products, removal of old machines, and changes in processing routes induced by the competitive global market. This paper proposes a new model, the intelligent colored token Petri net (ICTPN), to simulate dynamic changes or reconfigurations of a system. The main idea is that intelligent colored tokens denote part types that represent real-time knowledge about changes and status of a system. Thus, dynamic configurations of a system can be effectively modeled. The developed ICTPN can model dynamic changes of a system in a modular manner, resulting in the development of a very compact model. In addition, when configurations appear, only the changed colored token of the part type from the current model has to be modified. Based on the resultant ICTPN model, deadlock-free, conservative, and reversible behavioral properties, among others, are guaranteed. The developed ICTPN model was tested and validated using the GPenSIM tool and compared with existing methods from the literature.publishedVersio

An Efficient Siphon-Based Deadlock Prevention Policy for a Class of Generalized Petri Nets

We propose a new deadlock prevention policy for an important class of resource allocation systems (RASs) that appear in the modeling of flexible manufacturing systems (FMSs). The model of this class in terms of generalized Petri nets is, namely, S 4 PR. On the basis of recent structural analysis results related to the elementary siphons in generalized Petri nets on one hand and an efficient deadlock avoidance policy proposed for the class of conjunctive/disjunctive (C/D) RASs on the other hand, we show how one can generate monitors to be added to a net system such that all its strict minimal siphons are max -controlled and no insufficiently marked siphon is generated. Thereby, a new, simple, and more permissive liveness-enforcing supervisor synthesis method for S 4 PR is established

Supervisory Control and Analysis of Partially-observed Discrete Event Systems

Nowadays, a variety of real-world systems fall into discrete event systems (DES). In practical scenarios, due to facts like limited sensor technique, sensor failure, unstable network and even the intrusion of malicious agents, it might occur that some events are unobservable, multiple events are indistinguishable in observations, and observations of some events are nondeterministic. By considering various practical scenarios, increasing attention in the DES community has been paid to partially-observed DES, which in this thesis refer broadly to those DES with partial and/or unreliable observations. In this thesis, we focus on two topics of partially-observed DES, namely, supervisory control and analysis. The first topic includes two research directions in terms of system models. One is the supervisory control of DES with both unobservable and uncontrollable events, focusing on the forbidden state problem; the other is the supervisory control of DES vulnerable to sensor-reading disguising attacks (SD-attacks), which is also interpreted as DES with nondeterministic observations, addressing both the forbidden state problem and the liveness-enforcing problem. Petri nets (PN) are used as a reference formalism in this topic. First, we study the forbidden state problem in the framework of PN with both unobservable and uncontrollable transitions, assuming that unobservable transitions are uncontrollable. For ordinary PN subject to an admissible Generalized Mutual Exclusion Constraint (GMEC), an optimal on-line control policy with polynomial complexity is proposed provided that a particular subnet, called observation subnet, satisfies certain conditions in structure. It is then discussed how to obtain an optimal on-line control policy for PN subject to an arbitrary GMEC. Next, we still consider the forbidden state problem but in PN vulnerable to SD-attacks. Assuming the control specification in terms of a GMEC, we propose three methods to derive on-line control policies. The first two lead to an optimal policy but are computationally inefficient for large-size systems, while the third method computes a policy with timely response even for large-size systems but at the expense of optimality. Finally, we investigate the liveness-enforcing problem still assuming that the system is vulnerable to SD-attacks. In this problem, the plant is modelled as a bounded PN, which allows us to off-line compute a supervisor starting from constructing the reachability graph of the PN. Then, based on repeatedly computing a more restrictive liveness-enforcing supervisor under no attack and constructing a basic supervisor, an off-line method that synthesizes a liveness-enforcing supervisor tolerant to an SD-attack is proposed. In the second topic, we care about the verification of properties related to system security. Two properties are considered, i.e., fault-predictability and event-based opacity. The former is a property in the literature, characterizing the situation that the occurrence of any fault in a system is predictable, while the latter is a newly proposed property in the thesis, which describes the fact that secret events of a system cannot be revealed to an external observer within their critical horizons. In the case of fault-predictability, DES are modeled by labeled PN. A necessary and sufficient condition for fault-predictability is derived by characterizing the structure of the Predictor Graph. Furthermore, two rules are proposed to reduce the size of a PN, which allow us to analyze the fault-predictability of the original net by verifying that of the reduced net. When studying event-based opacity, we use deterministic finite-state automata as the reference formalism. Considering different scenarios, we propose four notions, namely, K-observation event-opacity, infinite-observation event-opacity, event-opacity and combinational event-opacity. Moreover, verifiers are proposed to analyze these properties

Design and Management of Manufacturing Systems

Although the design and management of manufacturing systems have been explored in the literature for many years now, they still remain topical problems in the current scientific research. The changing market trends, globalization, the constant pressure to reduce production costs, and technical and technological progress make it necessary to search for new manufacturing methods and ways of organizing them, and to modify manufacturing system design paradigms. This book presents current research in different areas connected with the design and management of manufacturing systems and covers such subject areas as: methods supporting the design of manufacturing systems, methods of improving maintenance processes in companies, the design and improvement of manufacturing processes, the control of production processes in modern manufacturing systems production methods and techniques used in modern manufacturing systems and environmental aspects of production and their impact on the design and management of manufacturing systems. The wide range of research findings reported in this book confirms that the design of manufacturing systems is a complex problem and that the achievement of goals set for modern manufacturing systems requires interdisciplinary knowledge and the simultaneous design of the product, process and system, as well as the knowledge of modern manufacturing and organizational methods and techniques

Traffic management and control of automated guided vehicles using artificial neural networks

An industrial traffic management and control system based on Automated Guided Vehicles faces several combined problems. Decisions must be made concerning which vehicles will respond, or are allocated to each of the transport orders. Once a vehicle is allocated a transport order, a route has to be selected that allows it to reach its target location. In order for the vehicle to move efficiently along the selected route it must be provided with the means to recognise and adapt to the changing characteristics of the path it must follow. When several vehicles are involved these decisions are interrelated and must take into account the coordination of the movements of the vehicles in order to avoid collisions and maximise the performance of the transport system. This research concentrates on the problem of routing the vehicles that have already been assigned destinations associated with transport orders. In nearly all existing AGV systems this problem is simplified by considering there to be a fixed route between source and destination workstations. However if the system is to be used more efficiently, and particularly if it must support the requirements of modern manufacturing strategies, such as Justin- Time and Flexible Manufacturing Systems, of moving very small batches more frequently, then there is a need for a system capable of dealing with the increased complexity of the routing problem. The consideration of alternative paths between any two workstations together with the possibility of other vehicles blocking routes while waiting at a particular location, increases enormously the number of alternatives that must be considered in order to identify the routes for each vehicle leading to an optimum solution. Current methods used to solve this type of problem do not provide satisfactory solutions for all cases, which leaves scope for improvement. The approach proposed in this work takes advantage of the use of Backpropagation Artificial Neural Networks to develop a solution for the routing problem. A novel aspect of the approach implemented is the use of a solution derived for routing a single vehicle in a physical layout when some pieces of track are set as unavailable, as the basis for the solution when several vehicles are involved. Another original aspect is the method developed to deal with the problem of selecting a route between two locations based on an analysis of the conditions of the traffic system, when each movement decision has to be made. This lead to the implementation of a step-by-step search of the available routes for each vehicle. Two distinct phases can be identified in the approach proposed. First the design of a solution based on an ANN to solve the single vehicle case, and subsequently the development and testing of a solution for a multi-vehicle case. To test and implement these phases a specific layout was selected, and an algorithm was implemented to generate the data required for the design of the ANN solution. During the development of alternative solutions it was found that the addition of simple rules provided a useful means to overcome some of the limitations of the ANN solution, and a "hybrid" solution was originated. Numerous computer simulations were performed to test the solutions developed against alternatives based on the best published heuristic rules. The results showed that while it was not possible to generate a globally optimal solution, near optimal solutions could be obtained and the best hybrid solution was marginally better than the best of the currently available heuristic rules

Discrete Event Systems: Models and Applications; Proceedings of an IIASA Conference, Sopron, Hungary, August 3-7, 1987

Work in discrete event systems has just begun. There is a great deal of activity now, and much enthusiasm. There is considerable diversity reflecting differences in the intellectual formation of workers in the field and in the applications that guide their effort. This diversity is manifested in a proliferation of DEM formalisms. Some of the formalisms are essentially different. Some of the "new" formalisms are reinventions of existing formalisms presented in new terms. These "duplications" reveal both the new domains of intended application as well as the difficulty in keeping up with work that is published in journals on computer science, communications, signal processing, automatic control, and mathematical systems theory - to name the main disciplines with active research programs in discrete event systems. The first eight papers deal with models at the logical level, the next four are at the temporal level and the last six are at the stochastic level. Of these eighteen papers, three focus on manufacturing, four on communication networks, one on digital signal processing, the remaining ten papers address methodological issues ranging from simulation to computational complexity of some synthesis problems. The authors have made good efforts to make their contributions self-contained and to provide a representative bibliography. The volume should therefore be both accessible and useful to those who are just getting interested in discrete event systems

Formal techniques for the procedural control of industrial processes

Imperial Users onl

Supervisory control of fuzzy discrete event systems with applications to mobile robotics

Fuzzy Discrete Event Systems (FDES) were proposed in the literature for modeling and control of a class of event driven and asynchronous dynamical systems that are affected by deterministic uncertainties and vagueness on their representations. In contrast to classical crisp Discrete Event Systems (DES), which have been explored to a sufficient extent in the past, an in-depth study of FDES is yet to be performed, and their feasible real-time application areas need to be further identified. This research work intends to address the supervisory control problem of FDES broadly, while formulating new knowledge in the area. Moreover, it examines the possible applications of these developments in the behavior-based mobile robotics domain. An FDES-based supervisory control framework to facilitate the behavior-based control of a mobile robot is developed at first. The proposed approach is modular in nature and supports behavior integration without making state explosion. Then, this architecture is implemented in simulation as well as in real-time on a mobile robot moving in unstructured environments, and the feasibility of the approach is validated. A general decentralized supervisory control theory of FDES is then established for better information association and ambiguity management in large-scale and distributed systems, while providing less complexity of control computation. Furthermore, using the proposed architecture, simulation and real-time experiments of a tightly-coupled multi-robot object manipulation task are performed. The results are compared with centralized FDES-based and decentralized DES-based approaches. -- A decentralized modular supervisory control theory of FDES is then established for complex systems having a number of modules that are concurrently operating and also containing multiple interactions. -- Finally, a hierarchical supervisory control theory of FDES is established to resolve the control complexity of a large-scale compound system by modularizing the system vertically and assigning multi-level supervisor hierarchies. As a proof-of-concept example to the established theory, a mobile robot navigation problem is discussed. This research work will contribute to the literature by developing novel knowledge and related theories in the areas of decentralized, modular and hierarchical supervisory control of FDES. It also investigates the applicability of these contributions in the mobile robotics arena