Presenting two new Petri net slicing algorithms to isolate those places and transitions that may contribute tokens to one or more places given (the slicing criterion) The completeness of thefirst algorithm and the minimality of the second algorithm are formally proven . A public, free,and open-source implementation of five algorithms is reported . Conclusions: The first algorithm is proven complete, and the second one is proven minimal. The first and second algorithms are proven complete. The results of an empirical evaluation of the new algorithms and the slices that they produce are also presented . The first algorithms collects all places and . transitions that . may influence (in any computation) the slicing criterion, while the second algorithms collects a minimum set of places . that may influence(in some computations) the . slicing criterion . Therefore, the net computed by the first algorithm can reproduce any computation that contributes tokens to anyplace of interest. In contrast, the . first algorithm loses this possibility but it often produces a much more reduced subnet . The second algorithm produces a . much more limited subnet often produces an . more reduced subsets of a Petri subnet (which . still can reproduce somecomputations that contribute

Author(s) : Marisa Llorens, Javier Oliver, Josep Silva, Salvador Tamarit

Links : PDF - Abstract

Code :
Coursera

Keywords : algorithm - algorithms - slicing - proven - places -

Leave a Reply

Your email address will not be published. Required fields are marked *