pm4py.objects.conversion.powl.variants 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.objects.conversion.powl.variants.to_petri_net 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.objects.conversion.powl.variants.to_petri_net.recursively_add_tree(powl, net, initial_entity_subtree, final_entity_subtree, counts, rec_depth, force_add_skip=False)[source]#
Recursively add the submodels to the Petri net
Parameters#
- powl
POWL model
- net
Petri net
- initial_entity_subtree
Initial entity (place/transition) that should be attached from the subtree
- final_entity_subtree
Final entity (place/transition) that should be attached from the subtree
- counts
Counts object (keeps the number of places, transitions and hidden transitions)
- rec_depth
Recursion depth of the current iteration
- force_add_skip
Boolean value that tells if the addition of a skip is mandatory
Returns#
- net
Updated Petri net
- counts
Updated counts object (keeps the number of places, transitions and hidden transitions)
- final_place
Last place added in this recursion
- pm4py.objects.conversion.powl.variants.to_petri_net.apply(powl, parameters=None)[source]#
Apply from POWL model to Petri net
Parameters#
- powl
POWL model
- parameters
Parameters of the algorithm
Returns#
- net
Petri net
- initial_marking
Initial marking
- final_marking
Final marking
- pm4py.objects.conversion.powl.variants.to_petri_net.get_new_place(counts)[source]#
Create a new place in the Petri net
Create a new hidden transition in the Petri net