Concerned by the reachability of a specific designated destination from a given initial state, this paper focuses on the study of deadlock-freeness in the framework of mono-T-semiflow Petri nets. The systems considered in this paper are composed of several subsystems interconnected via a limited number of shared resources. Local control laws are enforced separately to each subsystem with the least communication among them, thus substantially reducing the complexity of computation. With the aid of global critical stages, we provide two versions of a distributed control method, which can be realized in an online, look-ahead, and dynamic way. Each step's execution depends on a model predictive control strategy, which searches for a feasible sequence of events that brings the currently-active process to its nearest global critical stage. During this search-based procedure, current resource allocation status, combined with information about future process resource requirements, is used to keep the currently-active process away from deadlocks.
['Yan Yang', 'Hesuan Hu']
Mono-T-semiflow systems with resources and their distributed control using Petri nets