Types & Structures

Algorithm parameters for Alpha+++

Arc in a Petri net Connecting a transition and a place (or the other way around)

A directly-follows graph of [`Activity`]s. Graph containing a set of activities, a set of directly-follows relations, a set of start activities, and a set of end activities. Both, the number of occurrences of activities and of directly follows relations are annotated with their frequency.

OC-DECLARE Constraint arc/edge between two nodes (i.e., activities)

Options for the automatic discovery of OC-DECLARE constraints

An object-centric directly-follows graph containing a [`DirectlyFollowsGraph`] for each object type involved.

A Petri net of [`Place`]s and [`Transition`]s Bipartite graph of [`Place`]s and [`Transition`]s with [`Arc`]s connecting them, as well as initial and final [`Marking`]s

Place in a Petri net

Transition in a Petri net

O2O Mode for OC-DECLARE Discovery Determines to what extent object-to-object (O2O) relationships are considered

OC-DECLARE Arc Direction/Type Models temporal relationships

Mode for reducing OC-DECLARE constraints