pm4py.algo.analysis.woflan.not_well_handled_pairs.not_well_handled_pairs module

pm4py.algo.analysis.woflan.not_well_handled_pairs.not_well_handled_pairs.create_network_graph(net)

Transform a given Petri Net in a network graph. Each place and transition is node and gets duplicated. The even numbers handle the inputs of a node, the odds the output. :param net: PM4Py Petri Net representation :return: networkx.DiGraph(), bookkeeping dictionary

pm4py.algo.analysis.woflan.not_well_handled_pairs.not_well_handled_pairs.apply(net)

Using the max-flow min-cut theorem, we compute a list of nett well handled TP and PT pairs (T=transition, P=place) :param net: Petri Net :return: List