Spaces:
Running
Running
File size: 4,656 Bytes
e60e568 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 |
'''
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/>.
'''
from abc import ABC
from collections import Counter
from typing import List, Collection, Any, Optional, Generic, Dict
from pm4py.algo.discovery.inductive.cuts.abc import Cut, T
from pm4py.algo.discovery.inductive.dtypes.im_dfg import InductiveDFG
from pm4py.algo.discovery.inductive.dtypes.im_ds import IMDataStructureUVCL, IMDataStructureDFG
from pm4py.objects.dfg import util as dfu
from pm4py.objects.dfg.obj import DFG
from pm4py.objects.process_tree.obj import Operator, ProcessTree
class ConcurrencyCut(Cut[T], ABC, Generic[T]):
@classmethod
def operator(cls, parameters: Optional[Dict[str, Any]] = None) -> ProcessTree:
return ProcessTree(operator=Operator.PARALLEL)
@classmethod
def holds(cls, obj: T, parameters: Optional[Dict[str, Any]] = None) -> Optional[List[Collection[Any]]]:
dfg = obj.dfg
alphabet = dfu.get_vertices(dfg)
alphabet = sorted(list(alphabet))
edges = dfu.get_edges(dfg)
edges = sorted(list(edges))
groups = [{a} for a in alphabet]
if len(groups) == 0:
return None
cont = True
while cont:
cont = False
i = 0
while i < len(groups):
j = i + 1
while j < len(groups):
for act1 in groups[i]:
for act2 in groups[j]:
if (act1, act2) not in edges or (act2, act1) not in edges:
groups[i] = groups[i].union(groups[j])
del groups[j]
cont = True
break
if cont:
break
if cont:
break
j = j + 1
if cont:
break
i = i + 1
groups = list(sorted(groups, key=lambda g: len(g)))
i = 0
while i < len(groups) and len(groups) > 1:
if len(groups[i].intersection(set(dfg.start_activities.keys()))) > 0 and len(
groups[i].intersection(set(dfg.end_activities.keys()))) > 0:
i += 1
continue
group = groups[i]
del groups[i]
if i == 0:
groups[i].update(group)
else:
groups[i - 1].update(group)
return groups if len(groups) > 1 else None
class ConcurrencyCutUVCL(ConcurrencyCut[IMDataStructureUVCL]):
@classmethod
def project(cls, obj: IMDataStructureUVCL, groups: List[Collection[Any]], parameters: Optional[Dict[str, Any]] = None) -> List[IMDataStructureUVCL]:
r = list()
for g in groups:
c = Counter()
for t in obj.data_structure:
c[tuple(filter(lambda e: e in g, t))] = obj.data_structure[t]
r.append(c)
return list(map(lambda l: IMDataStructureUVCL(l), r))
class ConcurrencyCutDFG(ConcurrencyCut[IMDataStructureDFG]):
@classmethod
def project(cls, obj: IMDataStructureDFG, groups: List[Collection[Any]], parameters: Optional[Dict[str, Any]] = None) -> List[IMDataStructureDFG]:
dfgs = []
skippable = []
for g in groups:
dfn = DFG()
for a in obj.dfg.start_activities:
if a in g:
dfn.start_activities[a] = obj.dfg.start_activities[a]
for a in obj.dfg.end_activities:
if a in g:
dfn.end_activities[a] = obj.dfg.end_activities[a]
for (a, b) in obj.dfg.graph:
if a in g and b in g:
dfn.graph[(a, b)] = obj.dfg.graph[(a, b)]
skippable.append(False)
dfgs.append(dfn)
r = list()
[r.append(IMDataStructureDFG(InductiveDFG(dfg=dfgs[i], skip=skippable[i]))) for i in range(len(dfgs))]
return r
|