pm4py.algo.conformance.alignments.process_tree.variants package

Subpackages

Submodules

pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt 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.conformance.alignments.process_tree.variants.search_graph_pt.Parameters(value)[source]

Bases: enum.Enum

An enumeration.

ACTIVITY_KEY = 'pm4py:param:activity_key'
CORES = 'cores'
SHOW_PROGRESS_BAR = 'show_progress_bar'
class pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt.SGASearchState(costs: float, index: int, state: Dict[Tuple[int, pm4py.objects.process_tree.obj.ProcessTree], pm4py.objects.process_tree.obj.ProcessTree.OperatorState], leaves: Optional[List[pm4py.objects.process_tree.obj.ProcessTree]] = None, parent: Optional[Any] = None, children: Optional[List[Any]] = None)[source]

Bases: object

pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt.align_variant(variant, tree_leaf_set, pt)[source]
pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt.apply(obj: Union[pm4py.objects.log.obj.EventLog, pm4py.objects.log.obj.Trace], pt: pm4py.objects.process_tree.obj.ProcessTree, parameters: Optional[Dict[Any, Any]] = None) Union[Dict[str, Any], List[Dict[str, Any]]][source]

Returns alignments for a process tree

Parameters
  • obj – Event log or trace (a conversion is done if necessary)

  • pt – Process tree

  • parameters – Parameters of the algorithm

Returns

Alignments

Return type

alignments

pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt.apply_from_variants_list(var_list, tree, parameters=None)[source]

Apply the alignments from the specification of a list of variants in the log

Parameters
  • var_list – List of variants (for each item, the first entry is the variant itself, the second entry may be the number of cases)

  • tree – Process tree

  • parameters – Parameters of the algorithm

Returns

Dictionary that assigns to each variant its alignment

Return type

dictio_alignments

pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt.apply_multiprocessing(obj: Union[pm4py.objects.log.obj.EventLog, pm4py.objects.log.obj.Trace], pt: pm4py.objects.process_tree.obj.ProcessTree, parameters: Optional[Dict[Any, Any]] = None) Union[Dict[str, Any], List[Dict[str, Any]]][source]

Returns alignments for a process tree (using the multiprocessing package to distribute the workload among different cores)

Parameters
  • obj – Event log or trace (a conversion is done if necessary)

  • pt – Process tree

  • parameters – Parameters of the algorithm

Returns

Alignments

Return type

alignments

pm4py.algo.conformance.alignments.process_tree.variants.search_graph_pt.apply_variant(variant, tree, parameters=None)[source]

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