pm4py.algo.discovery.inductive.variants.im_d.util package¶
Submodules¶
pm4py.algo.discovery.inductive.variants.im_d.util.check_skip_trans module¶
This file is part of PM4Py (More Info: https://pm4py.fit.fraunhofer.de).
PM4Py is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
PM4Py 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 General Public License for more details.
You should have received a copy of the GNU General Public License along with PM4Py. If not, see <https://www.gnu.org/licenses/>.
-
pm4py.algo.discovery.inductive.variants.im_d.util.check_skip_trans.verify_skip_for_parallel_cut(dfg, children)[source]¶ Verify skip necessity, specific version for parallel cuts
Parameters: - dfg – Directly-follows graph
- children – Child of the parallel cut
Returns: Boolean value that is true if the skip shall be added
Return type: must_add_skip
-
pm4py.algo.discovery.inductive.variants.im_d.util.check_skip_trans.verify_skip_transition_necessity(must_add_skip, initial_dfg, dfg, activities)[source]¶ Utility functions that decides if the skip transition is necessary
Parameters: - must_add_skip – Boolean value, provided by the parent caller, that tells if the skip is absolutely necessary
- initial_dfg – Initial DFG
- dfg – Current DFG
- activities – Provided activities of the DFG
pm4py.algo.discovery.inductive.variants.im_d.util.get_tree_repr_dfg_based module¶
This file is part of PM4Py (More Info: https://pm4py.fit.fraunhofer.de).
PM4Py is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
PM4Py 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 General Public License for more details.
You should have received a copy of the GNU General Public License along with PM4Py. If not, see <https://www.gnu.org/licenses/>.
-
pm4py.algo.discovery.inductive.variants.im_d.util.get_tree_repr_dfg_based.check_loop_need(spec_tree_struct)[source]¶ Check whether a forced loop transitions shall be added
Parameters: spec_tree_struct – Internal tree structure (after application of Inductive Miner) Returns: Checks if the loop on the subtree is needed Return type: need_loop_on_subtree
Create a hidden node (transition) in the process tree
-
pm4py.algo.discovery.inductive.variants.im_d.util.get_tree_repr_dfg_based.get_repr(spec_tree_struct, rec_depth, contains_empty_traces=False)[source]¶ Get the representation of a process tree
Parameters: - spec_tree_struct – Internal tree structure (after application of Inductive Miner)
- rec_depth – Current recursion depth
- contains_empty_traces – Boolean value that is True if the event log from which the DFG has been extracted contains empty traces
Returns: Representation of the tree (could be printed, transformed, viewed)
Return type: final_tree_repr
Module contents¶
This file is part of PM4Py (More Info: https://pm4py.fit.fraunhofer.de).
PM4Py is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
PM4Py 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 General Public License for more details.
You should have received a copy of the GNU General Public License along with PM4Py. If not, see <https://www.gnu.org/licenses/>.