pm4py.algo.analysis.woflan.not_well_handled_pairs package#

PM4Py – A Process Mining Library for Python

Copyright (C) 2024 Process Intelligence Solutions UG (haftungsbeschränkt)

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.

You should have received a copy of the GNU Affero General Public License along with this program. If not, see this software project’s root or visit <https://www.gnu.org/licenses/>.

Website: https://processintelligence.solutions Contact: info@processintelligence.solutions

Submodules#

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

PM4Py – A Process Mining Library for Python

Copyright (C) 2024 Process Intelligence Solutions UG (haftungsbeschränkt)

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.

You should have received a copy of the GNU Affero General Public License along with this program. If not, see this software project’s root or visit <https://www.gnu.org/licenses/>.

Website: https://processintelligence.solutions Contact: info@processintelligence.solutions

pm4py.algo.analysis.woflan.not_well_handled_pairs.not_well_handled_pairs.create_network_graph(net)[source]#

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)[source]#

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