Maximal and minimal dynamic Petri net slicing

04/07/2021
by   Marisa Llorens, et al.
0

Context: Petri net slicing is a technique to reduce the size of a Petri net so that it can ease the analysis or understanding of the original Petri net. Objective: Presenting two new Petri net slicing algorithms to isolate those places and transitions of a Petri net (the slice) that may contribute tokens to one or more places given (the slicing criterion). Method: The two algorithms proposed are formalized. The completeness of the first algorithm and the minimality of the second algorithm are formally proven. Both algorithms together with other three state-of-the-art algorithms have been implemented and integrated into a single tool so that we have been able to carry out a fair empirical evaluation. Results: Besides the two new Petri net slicing algorithms, a public, free, and open-source implementation of five algorithms is reported. The results of an empirical evaluation of the new algorithms and the slices that they produce are also presented. Conclusions: The first algorithm collects all places and transitions that may influence (in any computation) the slicing criterion, while the second algorithm collects a minimum set of places and transitions that may influence (in some computation) the slicing criterion. Therefore, the net computed by the first algorithm can reproduce any computation that contributes tokens to any place of interest. In contrast, the second algorithm loses this possibility but it often produces a much more reduced subnet (which still can reproduce some computations that contribute tokens to some places of interest). The first algorithm is proven complete, and the second one is proven minimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

Petri Net Reductions for Counting Markings

We propose a method to count the number of reachable markings of a Petri...
research
11/20/2019

Synthesis of Reduced Asymmetric Choice Petri Nets

A Petri net is choice-free if any place has at most one transition in it...
research
12/21/2022

Discovering Process Models With Long-Term Dependencies While Providing Guarantees and Filteribng Infrequent Behavior Patterns

In process discovery, the goal is to find, for a given event log, the mo...
research
05/15/2018

Executions in (Semi-)Integer Petri Nets are Compact Closed Categories

In this work, we analyse Petri nets where places are allowed to have a n...
research
06/24/2021

Accelerating the Computation of Dead and Concurrent Places using Reductions

We propose a new method for accelerating the computation of a concurrenc...
research
06/17/2023

Sleptsov Nets are Turing-complete

The present paper proves that a Sleptsov net (SN) is Turing-complete, th...
research
03/02/2022

Theoretical Foundation of Colored Petri Net through an Analysis of their Markings as Multi-classification

Barwise and Seligman stated the first principle of information flow: "In...

Please sign up or login with your details

Forgot password? Click here to reset