On Algebraic Identification of Critical States for Deadlock Control in Automated Manufacturing Systems Modeled With Petri Nets

Abstract

Petri nets are an important and popular tool to model and analyze deadlocks in automated manufacturing systems. The state space of a Petri net model can be divided into two disjoint parts: a live-zone and a dead-zone. A first-met bad marking (FBM) is a marking in the dead-zone, representing the very first entry from the live-zone to the dead-zone, and the calculation of FBMs to a large extent contributes to the complexity of designing optimal liveness-enforcing supervisors. Most existing studies have to fully enumerate the reachable markings of a Petri net model to obtain the FBMs, which exacerbates the computational overheads. This paper first explores a variation mechanism of calculating FBMs with respect to the resource capacity in a class of S 3 PR (Systems of Simple Sequential Processes with Resources) from the structural analysis perspective, which contains a ξ -resource. More generally, for the class of S 3 PR with an η-resource as defined in this paper, the FBMs can be calculated in an algebraic way by a customized structural analysis technique without enumerating all the reachable markings. Finally, the variation mechanism of calculating FBMs is revealed for these considered classes of Petri net models. Examples are given to demonstrate the proposed method.INDEX TERMS Petri net, first-met bad marking, deadlock control, automated manufacturing system.

Improved Multi-Core Real-Time Task Scheduling of Reconfigurable Systems With Energy Constraints

“…We intend to implement real-time middleware that embeds the proposed contribution and some intelligent optimization methods [40], [42]. In the future, we plan to use the developed method to the social networks [43], [44] and discret event systems [45]- [47].…”

Adaptive Consensus of Two Coupled Heterogeneous Networked Systems With Bidirectional Actions

“…Moreover, motivated by the works in [37], [38], the more practical communication factors can be considered in the consensus problem, such as communication restriction or unreliable link. In addition, the consensus problem in discrete event systems are of much interest [39][40][41][42][43][44][45].…”

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

“…Traditional Petri nets are popularly used to model, simulate, control, and analyze automated manufacturing systems (AMSs). Existing traditional Petri net studies assumed one or more of the following: (1) the system configuration is recognized and does not change throughout the operation, (2) there is no addition of new machines and no removal of old machines, and machine failures are not addressed, (3) rework is not required, and (4) products to be manufactured are identified, their process routes are specified, and the addition of new products is not applicable [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31][32]. This means that traditional Petri net models do not undergo dynamic configurations, such as processing failures and rework, machine breakdowns, addition of new machines, addition of new products, removal of old machines, or change processing routes induced by the competitive global market.…”