Deadlock detection-oriented unfolding of unbounded Petri nets

Lu, Faming; Tao, Ranran; Du, Yuyue; Zeng, Qingtian; Bao, Yukun

doi:10.1016/j.ins.2019.05.021

Cited by 8 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, one major limitation imposed on the system for the application of our method is the boundedness of the PN model, which we require to ensure the finiteness of the BRG. As a consequence, interesting directions for future research include how to apply techniques such as model predictive control [26], ω-markings [15], [27], and net unfolding [33] to remove or relax this limitation enforced on the system so as to make our proposed method more applicable. It is also in our future research agenda to make a case study to bridge the gap between the proposed theoretical contribution and realistic applications.…”

Section: Discussionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper develops an approach for solving the problem of least-cost transition firing sequences estimation in labeled Petri nets with unobservable transitions. Each transition in the net is labeled as either observable or unobservable, and has a nonnegative cost. Additionally, we assume that the net system is bounded, the unobservable subnet is acyclic, and the cost of each unobservable transition is strictly positive. We propose the method mainly on the basis of the notions of basis marking and basis reachability graph (BRG), which is a compact representation of the reachability graph of the net system. By sacrificing extra storage space to keep the BRG and other necessary information in memory, some time-consuming computations are moved off-line. This makes our proposed approach more feasible for on-line applications. Finally, we present a brief survey and comparison of some representative methods that use labeled Petri nets as a formalism in the literature. INDEX TERMS Basis reachability graph (BRG), discrete event system (DES), Petri net (PN), transition firing sequence.

show abstract

Section: Discussionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Some are based on structural analysis methods [51,52,53]. However, unfolding technologies are widely adopted due to its efficiency in tackling with state explosion problems [26,54,55,56]. In this paper, we use the unfolding technique to detect dead markings.…”

Section: B Unfolding Based Dead Marking Detection Of Deadlock-adjoint...mentioning

confidence: 99%

Petri Net Unfolding-Based Detection and Replay of Program Deadlocks

Lu,

Lv,

Cui

et al. 2024

IEEE Access

Self Cite

View full text Add to dashboard Cite

Program deadlock detection plays an important role in ensuring the stability of software systems. In view of the high efficiency and low false alarm rate, dynamic deadlock analysis methods are widely studied. However, existing dynamic analysis methods use lock graph or its extended variants to model program behavior. Since there are information loss in existing lock graphs, deadlock false positives still exist. To solve the problem, a novel 2-stage dynamic deadlock analysis method is proposed. In the first stage, a Petri net model of the program is constructed by analyzing program running traces. Then, unfolding-based Petri net dead marking detection methods are used to identify potential program deadlocks. In the second stage, based on Petri net unfolding techniques, a deterministic program scheduling scheme that can be used for deadlock replay is derived for each potential deadlock. Each successfully replayed program deadlock is a real deadlock. It is shown that the proposed deadlock detection and replay method can eliminate more false positives compared to general dynamic methods, and the deadlock replay scheme is deterministic and easy to understand compared with existing random scheduling strategies.

show abstract

“…They discuss a payment as a flow and to elaborate the chance of combined multiple paths. Most of the existing method required the global knowledge and a centralized coordinator [11]. The approach in push-relabel algorithm allows a concurrent execution but solves a flow problem.…”

Section: Push-relabel Algorithmmentioning

confidence: 99%

Comparative Analysis of Deadlock Detection Algorithm based on Blockchain

2023

IJCCN

View full text Add to dashboard Cite

The aim of the study is to compare the deadlock detection algorithms in distributed systems with respective Blockchain technology presented in this paper. Today, detecting deadlocks in distributed systems is a very important challenge. Without the proper deadlock detection mechanism, the system can get stuck in a reject state. The goal of this work is to figure out which algorithm is more suitable for deadlock detection in Blockchain technology based on these factors i-e Security, Time, Performance, Communication, and Correctness. Under the positivism paradigm. The descriptive research design and distributed technique are used to minimize the occurrence of deadlock and to identify the deadlock in parallel collective operation verified up to maximum threads. The algorithms for deadlock detection that are compared in this study are Scalable deadlock detection, Push-relabel algorithm, Knapp’s, Fulgor, and Consensus based on Blockchain technology. Blockchain technology provides a secure environment and helps to build trust. According to this paper, the Fulgor algorithm is more effective at removing deadlocks and maintaining communication security between distributed systems. Both controlled and uncontrolled environments are tested with different algorithms and are compared to define efficiency side-by-side. Deadlock detection requires identifying some properties and message delays in the global state of the distributed system. The number of common parameters has been identified in the selected algorithms to detect deadlocks in a distributed system

show abstract

Deadlock detection-oriented unfolding of unbounded Petri nets

Cited by 8 publications

References 27 publications

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Petri Net Unfolding-Based Detection and Replay of Program Deadlocks

Comparative Analysis of Deadlock Detection Algorithm based on Blockchain

Contact Info

Product

Resources

About