A reduced reachability tree for a class of unbounded petri nets

Wang, Shouguang; Gan, MengDi; Zhou, MengChu; You, Dan

doi:10.1109/jas.2015.7296528

Cited by 31 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Petri nets are widely used for modeling and analysis of concurrent systems, such as flexible manufacturing systems [34,35,36], process aware systems [37][38][39][40]. There are also many Petri-net-based methods to model concurrent programs [41][42][43][44].…”

Section: Program Trace Netmentioning

confidence: 99%

See 1 more Smart Citation

Petri Net Unfolding-Based Detection and Replay of Program Deadlocks

Lu,

Lv,

Cui

et al. 2024

IEEE Access

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

Section: Program Trace Netmentioning

confidence: 99%

“…Much work has focused on detecting dead markings of Petri nets. Some are based on reachability trees [39,[47][48][49][50]. Some are based on structural analysis methods [51,52,53].…”

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

View full text Add to dashboard Cite

show abstract

“…In this paper, we use WFD-net systems to analyze the correctness of control-/data-flows in workflow systems. It is assumed that our control-flows in WFD-net systems are sound (i.e., no deadlocks [9,15,16] or livelocks [17][18][19]), without taking data operations into consideration [12,20,21]. The aim of this paper is to detect and repair four kinds of data-flow errors (i.e., redundant data, missing data, lost data, and inconsistent data) in WFD-net systems.…”

Section: Introductionmentioning

confidence: 99%

Detecting and Repairing Data-Flow Errors in WFD-net Systems

Zhao¹,

Xiang²,

Liu³

et al. 2022

Computer Modeling in Engineering &Amp; Sciences

View full text Add to dashboard Cite

Workflow system has become a standard solution for managing a complex business process. How to guarantee its correctness is a key requirement. Many methods only focus on the control-flow verification, while they neglect the modeling and checking of data-flows. Although some studies are presented to repair the data-flow errors, they do not consider the effect of delete operations or weak circulation relations on the repairing results. What's more, repairing some data-flow errors may bring in new errors. In order to solve these problems, we use workflow net with data (WFD-net) systems to model and analyze a workflow system. Based on weak behavioral relations and order relations in a WFD-net system, we formalize four kinds of data-flow errors. After then, we reveal the relations between these errors and organize them into a hierarchy. Furthermore, we propose some new methods to repair data-flow errors in a WFD-net system based on system requirements and repair strategies. Finally, a case study of campus-card recharging shows the applicability of our methods, and a group of experiments show their advantages and effectiveness.

show abstract

A path detecting method to analyze the interactive compatibility of service processes based on WS‐BPEL

Liu

Zhen

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Petri nets are frequently used formal tools to analyze the compatibility of interactive service processes described by Web Services Business Process Execution Language (WS-BPEL). However, the traditional methods based on Petri nets were with a high computable complexity for state space explosion. To resolve such problem, a logic Petri net-based path detecting method for compatibility analysis of interactive service processes is proposed. From the provided mapping rules, the service process described by WS-BPEL is modeled as a service net based on logic Petri nets. The evaluation of interactive compatibility of two service processes is converted to analyze whether their service nets can be composed as a non-blocked synthetic service net. The non-blocked property is checked by detecting the reachability of the potential connected paths in a service net. To reduce the complexity of computing the connected paths in a service net, we propose a merge-reduced method to generate the path expression of its skeleton service net.The potential connected paths of a service net can be obtained by unfolding the path expression.Compared with the traditional method based Petri nets, the proposed method is with high efficiency and it can greatly alleviate the problem of state space explosion in analyzing interactive compatibility of service processes.

show abstract

A reduced reachability tree for a class of unbounded petri nets

Cited by 31 publications

References 25 publications

Petri Net Unfolding-Based Detection and Replay of Program Deadlocks

Petri Net Unfolding-Based Detection and Replay of Program Deadlocks

Detecting and Repairing Data-Flow Errors in WFD-net Systems

A path detecting method to analyze the interactive compatibility of service processes based on WS‐BPEL

Contact Info

Product

Resources

About