Elementary Siphons of Petri Nets and Deadlock Control in FMS

Abdul-Hussin, Mowafak Hassan

doi:10.4236/jcc.2015.37001

Cited by 12 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The basic form of specification used in Dedan is IMDS, because it enables automatic conversion between the server view and the agent view of a system, and conversion to other formalisms: Petri net for static analysis and finding deadlocks using siphons [63], Uppaal input for timed verification [64], etc. However, the specification in the form of a relation between pairs λ = ((message, state), (message', state')) is exotic for the users.…”

Section: Using Da 3 In the Dedan Environmentmentioning

confidence: 99%

Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)

Daszczuk

2021

Softw Syst Model

View full text Add to dashboard Cite

Automated verification of distributed systems becomes very important in distributed computing. The graphical insight into the system in the early and late stages of the project is essential. In the design phase, the visual input helps to articulate the collaborative distributed components clearly. The formal verification gives evidence of correctness or malfunction, but in the latter case, graphical simulation of counterexample helps for better understanding design errors. For these purposes, we invented Distributed Autonomous and Asynchronous Automata (DA3), which have the same semantics as the formal verification base—Integrated Model of Distributed Systems (IMDS). The IMDS model reflects the natural characteristics of distributed systems: unicasting, locality, autonomy, and asynchrony. Distributed automata have all of these features because they share the same semantics as IMDS. In formalism, the unified system definition has two views: the server view of the cooperating distributed nodes and the agent view of the migrating agents performing distributed computations. The automata have two formally equivalent forms that reflect two views: Server DA3 for observing servers exchanging messages, and Agent DA3 for tracking agents, which visit individual servers in their progress of distributed calculations. We present the DA3 formulation based on the IMDS formalism and their application to design and verify distributed systems in the Dedan environment. DA3 formalism is compared with other concepts of distributed automata known from the literature.

show abstract

Section: Using Da 3 In the Dedan Environmentmentioning

confidence: 99%

Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)

Daszczuk

2021

Softw Syst Model

View full text Add to dashboard Cite

show abstract

“…There are two primary analyzing methodologies for system deadlock of FMS: structural analysis [44][45][46][47][48][49][50][51][52] and reachability graph (RG) analysis [28,29,53]. Structural analysis is based on some structural items (or subnet) for deadlock prevention policy, including siphons and place invariants (PI).…”

Section: Introductionmentioning

confidence: 99%

Enhancement of Computational Efficiency for Deadlock Recovery of Flexible Manufacturing Systems Using Improved Generating and Comparing Aiding Matrix Algorithms

Pan,

Tseng,

Chen

2023

Processes

View full text Add to dashboard Cite

After the fourth industrial evolution, precision and automatic manufacturing have become increasingly widely accepted in production. With highly variable productivity and flexibility, flexible manufacturing systems (FMS) lower production costs and increase efficiency. Due to its resource shareability, unexpected system deadlock may occur in some specific situations. Many existing works use deadlock prevention as the primary control methodology in research on system deadlock control, while this type of control policy would constrain the transportation resources and reduce the system’s liveness. This paper adopts a new transition-based deadlock recovery policy as the direct control strategy, which uses generating and comparing aiding matrix (GCAM) to determine the optimal control transition. We also improve the existing GCAM-based method by reducing the computational redundancy. This kind of control strategy and its benefit could be demonstrated through two typical systems of simple sequential processes with resource (S3PR) nets and their Petri nets model.

show abstract

“…Deadlocks happen in the Petri net when a siphon or a trap forms the structure. Moreover, there are three control elements to solve the deadlocks by place [1][2][3], transition [4][5][6][7][8][9], or weight of the arc [10,11]. From another viewpoint, there are four strategies to deal with the deadlocks in flexible manufacturing systems [12][13][14]: (1) deadlock avoidance [15,16], (2) deadlock detection and recovery [5,7,17,18], (3) deadlock prevention [19][20][21][22], and (4) deadlock ignoring [23].…”

Section: Introductionmentioning

confidence: 99%

Identifying the Saturated Line Based on the Number of Idle Places: Achieving Precise Maximal Permissiveness without Deadlocks Using Control Transitions or Control Places

2023

View full text Add to dashboard Cite

In the flexible manufacturing system deadlock prevention domain, researchers’ almost final target is to seek the maximally permissive controllers for solving the deadlock problems of flexible manufacturing systems. However, it seems a challenging work. Whatever you adopt, what kinds of methods, policies, and strategies, it seems complicated to obtain optimal controllers for deadlock prevention even if they claim their algorithms are optimal until the deadlock recovery is developed. Therefore, many experts, including us, have decided to design all kinds of actual maximally permissive recovery policies based on control transitions. It is a pity that these policies usually solve some particular flexible manufacturing systems’ deadlock problems. The controllers failed to recover the deadlock situation of flexible manufacturing systems once the idle or resource places were changed. In other words, these policies could never know or identify the real number of maximally permissive controllers in the same structure with different idle places. The precise combination of the number of idle places is called the saturated line, and it divides the reachability states into two region (saturated region and unsaturated region). Accordingly, this paper proposes a novel concept that achieves the precise maximum permissiveness and fits all kinds of flexible manufacturing systems. The experimental results show how our policy does in practice.

show abstract

Elementary Siphons of Petri Nets and Deadlock Control in FMS

Cited by 12 publications

References 7 publications

Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)

Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)

Enhancement of Computational Efficiency for Deadlock Recovery of Flexible Manufacturing Systems Using Improved Generating and Comparing Aiding Matrix Algorithms

Identifying the Saturated Line Based on the Number of Idle Places: Achieving Precise Maximal Permissiveness without Deadlocks Using Control Transitions or Control Places

Contact Info

Product

Resources

About