pm4py.algo.discovery.inductive.variants.im.util package

Submodules

pm4py.algo.discovery.inductive.variants.im.util.base_case 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.util.base_case.empty_log(log)

Returns bool if log is empty

pm4py.algo.discovery.inductive.variants.im.util.base_case.single_activity(log, activity_key)

Returns bool if log consists of single activity only

pm4py.algo.discovery.inductive.variants.im.util.constants 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.util.fall_through 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.util.fall_through.act_once_per_trace(l, activities, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.activity_concurrent(self, l, activities, activity_key, parameters=None)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.empty_trace(l)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.filter_activity_from_log(l, act, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.filter_activity_use_idx(l, act, activity_key, idx)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.index_containing(l, activities, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.show_nice_log(old_log)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.split_before_start(trace, start_activities, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.split_between_end_and_start(trace, start_activities, end_activities, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.strict_tau_loop(l, start_activities, end_activities, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.fall_through.tau_loop(l, start_activities, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.get_tree_repr_implain 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/>.

class pm4py.algo.discovery.inductive.variants.im.util.get_tree_repr_implain.Parameters

Bases: enum.Enum

An enumeration.

ACTIVITY_KEY = 'pm4py:param:activity_key'

CASE_ID_KEY = 'pm4py:param:case_id_key'

CONCURRENT_KEY = 'concurrent'

EMPTY_TRACE_KEY = 'empty_trace'

NOISE_THRESHOLD = 'noiseThreshold'

ONCE_PER_TRACE_KEY = 'once_per_trace'

START_TIMESTAMP_KEY = 'pm4py:param:start_timestamp_key'

STRICT_TAU_LOOP_KEY = 'strict_tau_loop'

TAU_LOOP_KEY = 'tau_loop'

TIMESTAMP_KEY = 'pm4py:param:timestamp_key'

pm4py.algo.discovery.inductive.variants.im.util.get_tree_repr_implain.check_loop_need(spec_tree_struct)

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

pm4py.algo.discovery.inductive.variants.im.util.get_tree_repr_implain.get_new_hidden_trans()

Create a hidden node (transition) in the process tree

pm4py.algo.discovery.inductive.variants.im.util.get_tree_repr_implain.get_repr(spec_tree_struct, rec_depth, contains_empty_traces=False)

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

pm4py.algo.discovery.inductive.variants.im.util.get_tree_repr_implain.get_transition(label)

Create a node (transition) with the specified label in the process tree

pm4py.algo.discovery.inductive.variants.im.util.splitting 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.util.splitting.split_loop(cut, l, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.splitting.split_parallel(cut, l, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.splitting.split_sequence(cut, l, activity_key)

pm4py.algo.discovery.inductive.variants.im.util.splitting.split_xor(cut, l, activity_key)

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/>.