New Efficient Petri Nets Reductions for Parallel Programs Verification

Haddad, Serge; Pradat-Peyre, Jean-François

doi:10.1142/s0129626406002502

Cited by 27 publications

(26 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We discuss respective extensions in Section 3.5. Finally, the idea of preserving traces by structural changes based on Petri Nets is described in [21,10].…”

Section: Under Which Conditions May Process Instances Be Adapted?mentioning

confidence: 99%

Flexibility in Process-Aware Information Systems

Reichert

Rinderle-Ma

Dadam

2009

Transactions on Petri Nets and Other Models of Concurrency II

View full text Add to dashboard Cite

Abstract. Process-aware information systems (PAIS) must be able to deal with uncertainty, exceptional situations, and environmental changes. Needed business agility is often hindered by the lacking flexibility of existing PAIS. Once a process is implemented, its logic cannot be adapted or refined anymore. This often leads to rigid behavior or gaps between real-world processes and implemented ones. In response to this drawback, adaptive PAIS have emerged, which allow to dynamically adapt or evolve the structure of process models under execution. This paper deals with fundamental challenges related to structural process changes, discusses how existing approaches deal with them, and shows how the various problems have been exterminated in ADEPT2 change framework. We also survey existing approaches fostering flexible process support.

show abstract

“…We discuss respective extensions in Section 3.5. Finally, the idea of preserving traces by structural changes based on Petri Nets is described in [21,10].…”

Section: Under Which Conditions May Process Instances Be Adapted?mentioning

confidence: 99%

Flexibility in Process-Aware Information Systems

Reichert

Rinderle-Ma

Dadam

2009

Transactions on Petri Nets and Other Models of Concurrency II

View full text Add to dashboard Cite

show abstract

“…As for the pre-agglomeration, these conditions (or a subset of) ensure that fundamental properties of a net are preserved by the post-agglomeration reduction (the demonstration is provided in [6]). …”

Section: H-independent Strongly Quasi-persistent and H-similar Thenmentioning

confidence: 99%

“…We proposed in [6] new Petri nets reductions that cover a large range of patterns by introducing algebraic conditions whereas the previously defined ones rely solely on structural conditions. We adapted them in [7] to colored Petri nets which are an abbreviation of Petri nets and define a concise formalism for the modeling of concurrent software.…”

Section: Related Work On Syntactical Model Reductionsmentioning

confidence: 99%

See 1 more Smart Citation

Adapting Petri Nets Reductions to Promela Specifications

Pajault

Pradat-Peyre

Rousseau

2008

Formal Techniques for Networked and Distributed Systems – FORTE 2008

View full text Add to dashboard Cite

Abstract. The interleaving of concurrent processes actions leads to the well-known combinatorial explosion problem. Petri nets theory provides some structural reductions to tackle this phenomenon by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that does not observe the modified transitions. Furthermore, they can be combined with other kinds of reductions such as partial-order techniques to improve the efficiency of state space reduction. We present in this paper an adaptation of these reductions for Promela specifications and propose simple rules to automatically infer atomic steps in the Promela model while preserving the checked property. We demonstrate on typical examples the efficiency of this approach and propose some perspectives of this work in the scope of software model checking.

show abstract

“…Over the past few decades, a number of optimization techniques have been proposed to make it applicable for larger programs. Structure-level approaches attempt to reduce the size of the net by reduction [8]- [10], abstraction [11], [12] or transformation [13], [14] techniques. The most famous efforts are six well-known PN reduction rules [8], which reduce the net while preserving concerned properties (boundedness, liveness and reversibility).…”

Section: Introductionmentioning

confidence: 99%

Accelerating Reachability Analysis on Petri Net for Mutual Exclusion-Based Deadlock Detection

Zhou

2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYPetri Net (PN) is a frequently-used model for deadlock detection. Among various detection methods on PN, reachability analysis is the most accurate one since it never produces any false positive or false negative. Although suffering from the well-known state space explosion problem, reachability analysis is appropriate for small-and medium-scale programs. In order to mitigate the explosion problem several kinds of techniques have been proposed aiming at accelerating the reachability analysis, such as net reduction and abstraction. However, these techniques are for general PN and do not take the particularity of application into consideration, so their optimization potential is not adequately developed. In this paper, the feature of mutual exclusion-based program is considered, therefore several strategies are proposed to accelerate the reachability analysis. Among these strategies a customized net reduction rule aims at reducing the scale of PN, two marking compression methods and two pruning methods can reduce the volume of reachability graph. Reachability analysis on PN can only report one deadlock on each path. However, the reported deadlock may be a false alarm in which situation real deadlocks may be hidden. To improve the detection efficiency, we proposed a deadlock recovery algorithm so that more deadlocks can be detected in a shorter time. To validate the efficiency of these methods, a prototype is implemented and applied to SPLASH2 benchmarks. The experimental results show that these methods accelerate the reachability analysis for mutual exclusion-based deadlock detection significantly.

show abstract

New Efficient Petri Nets Reductions for Parallel Programs Verification

Cited by 27 publications

References 15 publications

Flexibility in Process-Aware Information Systems

Flexibility in Process-Aware Information Systems

Adapting Petri Nets Reductions to Promela Specifications

Accelerating Reachability Analysis on Petri Net for Mutual Exclusion-Based Deadlock Detection

Contact Info

Product

Resources

About