pm4py.algo.discovery.footprints.petri.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.algo.discovery.footprints.petri.variants.reach_graph 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
- class pm4py.algo.discovery.footprints.petri.variants.reach_graph.Outputs(value, names=<not given>, *values, module=None, qualname=None, type=None, start=1, boundary=None)[source]#
Bases:
Enum- DFG = 'dfg'#
- SEQUENCE = 'sequence'#
- PARALLEL = 'parallel'#
- START_ACTIVITIES = 'start_activities'#
- END_ACTIVITIES = 'end_activities'#
- ACTIVITIES = 'activities'#
- SKIPPABLE = 'skippable'#
- ACTIVITIES_ALWAYS_HAPPENING = 'activities_always_happening'#
- MIN_TRACE_LENGTH = 'min_trace_length'#
- TRACE = 'trace'#
- pm4py.algo.discovery.footprints.petri.variants.reach_graph.apply(net: PetriNet, im: Marking, parameters: Dict[Any, Any] | None = None) Dict[str, Any][source]#
Discovers a footprint object from a Petri net
Parameters#
- net
Petri net
- im
Initial marking
- parameters
Parameters of the algorithm
Returns#
- footprints_obj
Footprints object