Automated Generalized Petri Net Reduction Using an Evolutionary Approach Applied to a Manufacturing System Model

Beviláqua, André Firpo; Kato, E.R.R.; Pedrino, Emerson Carlos; Tsunaki, Roberto Hideaki

doi:10.1109/smc.2013.403

Cited by 3 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[19] randomly selects one element in PNs and verifies if any characteristic at some point near the selected element enables some reduction rules. Inspired by evolutionary computing, [10] proposes an automated reduction scenario which is modelled as Genetic Algorithm (GA). In the GA algorithm, PNs are forced to receive some genetic variability using some reduction rules, achieving diverse possibilities of crossover and based on that improve the convergence rate of the algorithm.…”

Section: Reduction Algorithmmentioning

confidence: 99%

“…In order to measure the reduction quantitatively, many evaluations have been proposed to represent the scale of a PN [10]. Here we measure the scale by the count of places and transitions respectively.…”

Section: The Performance Of Net Reduction Rulementioning

confidence: 99%

“…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%

See 2 more Smart Citations

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

Section: Reduction Algorithmmentioning

confidence: 99%

Section: The Performance Of Net Reduction Rulementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

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

2015

2015 Third International Symposium on Computing and Networking (CANDAR)

View full text Add to dashboard Cite

An Improved Optimization Algorithm for Timed Petri Net Based on Genetic Algorithm

Li¹,

Wang²,

Li³

et al. 2016

Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control

View full text Add to dashboard Cite

Abstract.A variety of theoretical and practical work exists on Petri-net-based optimization algorithm. However, the efficiency of optimization is still the bottleneck of its application, especial for NP problem (e.g., Flexible Manufacturing System (FMS) scheduling problem). In order to improve the optimization efficiency, an optimization approach for the Timed Petri Net (TPN) model is proposed in this paper. Firstly, definition of Simplified Timed Petri Net (Simplified TPN) and method of simplifying traditional model are proposed. Based on this Simplified TPN, the concepts of mutual exclusion contracts and order contracts are defined, and the optimization mathematical model is obtained. Then, a reachability checking method is introduced to ensure the feasibility of solutions. Finally, this paper proposes a new crossover operator and mutation operator of Genetic Algorithm (GA) and describes the steps of optimization approach. This proposed approach is evaluated on FMS scheduling.

show abstract

Automated Generalized Petri Net Reduction Using an Evolutionary Approach Applied to a Manufacturing System Model

Cited by 3 publications

References 29 publications

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

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

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

An Improved Optimization Algorithm for Timed Petri Net Based on Genetic Algorithm

Contact Info

Product

Resources

About