Robustness control method of automatic manufacture system based on Petri network

Abstract

The invention relates to a robustness control method of an automatic manufacture system based on a Petri network. The robustness control method firstly detects all enabled transitions under an achievable state M, detects a transition set guaranteeing that a system has no deadlock from all enabled transitions, detects transitions guaranteeing the system to be robust from all transitions having no deadlocks, detects biggest concurrency allowable transitions from all robust transitions, chooses a transition to emit from the biggest concurrency allowable transition, wherein every time one transition is emitted, a new state is obtained, and executes the above steps in a new state. So repeatedly, a transition sequence which can guarantee system is robust and can operate without deadlock can be obtained, the that transition is emitted according to the sequence cannot only guarantee that the system has not deadlock, but also guarantee that the system has not blockage. The robustness control method uses a Petri network as a mathematic tool and performs modeling on an automatic manufacture system so as to realize a fact that the system can continuously and smoothly process.

Description

technical field [0001] The invention belongs to the technical field of automatic manufacturing systems, and relates to a robustness control method of an automatic manufacturing system based on Petri nets. Background technique [0002] Manufacturing automation is a main direction of manufacturing technology development. In response to the emergence of fierce market competition and the application of advanced automation technologies, automatic manufacturing systems have undergone leapfrog development. Its goals are to reduce manufacturing costs, improve product quality, increase productivity and ensure production safety. However, considering the scale of the system and the cost of resources, resources will not be provided unlimitedly. Therefore, resource sharing is an ideal solution. Since concurrently executing processes compete for shared resources, system deadlock problems arise unexpectedly. Once a deadlock occurs, the entire system either stagnates or enters an infini...

AI Technical Summary

Problems solved by technology

2. Most of the distributed methods are not practical because they are based on specific system structures or the design of a coordinator between local controls is a huge challenge

In fact, once a resource failure occurs, it may bring the entire system to a standstill

Images