Expected Directly-Follows Relations count

View in library docs
eDFR(g)\mathit{e}\mathit{DFR}(g)
Dimension:
Flexibility
Granularity:
Group of cases

Description

Expected number of activity pairs where one is instantiated directly after the other in a case belonging to a group of cases.

Potential use

Process where several distinct directly-follows relations can occur.

Assumptions

A greater number of directly-follows relations is desirable, as it implies a greater capability to address unexpected situations.

Desired Value:

MAXIMIZE

Required attributes

act
actinst
case
type

Equations

Formula for practitioners

cgDFR(c)C(g)\frac{\sum _{c \in g} \mathit{DFR}(c)}{\mathit{C}(g)}

DFR(c)\mathit{DFR}(c) returns the number of unique Directly-Follows Relations (DFR) in case cc.
C(g)\mathit{C}(g) returns the number of cases in group gg.

Formal Definition

cgDFR(c)C(g)\frac{\sum _{c \in g} \mathit{DFR}(c)}{\mathit{C}(g)}

Tags

act
actinst
case
type

Python implementation

This indicator is implemented in the process_performance_indicators Python library.

process_performance_indicators.indicators.flexibility.groups.expected_directly_follows_relations_count