Papers
Topics
Authors
Recent
Search
2000 character limit reached

OmegaPRM: Outcome-Oriented Process Supervision

Updated 13 April 2026
  • OmegaPRM is an outcome-oriented prescriptive process supervision framework that employs temporal logic patterns to guide flexible business process execution.
  • It utilizes a decision tree-based machine learning model to estimate outcome probabilities and generate interpretable temporal constraints in real time.
  • Evaluations on diverse event logs demonstrate that OmegaPRM achieves high reliability (F1 > 90% in most benchmarks) while maintaining operational flexibility.

Process Supervision OmegaPRM is an outcome-oriented prescriptive process monitoring framework that leverages temporal logic patterns to provide flexible, real-time recommendations during the execution of business processes. Designed to maximize the likelihood of achieving desired outcomes, OmegaPRM employs a transparent, interpretable mechanism that moves beyond rigid prescriptive controls by recommending temporal relations among process activities, thus providing both reliability and operational flexibility (Donadello et al., 2022).

1. Mathematical Formulation and Problem Definition

Let Σ\Sigma denote the finite set of activity names in a business process. A trace σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle, with ai∈Σa_i \in \Sigma, represents a sequence of activities. The event log L⊆Σ∗L \subseteq \Sigma^* comprises observed completed traces, each labeled with y(σ)∈{0,1}y(\sigma)\in \{0,1\} indicating whether the trace yielded a desirable outcome (1) or not (0).

Given a historical labeled log Ltrain={(σ1,y(σ1)),…,(σN,y(σN))}L_{\text{train}} = \{(\sigma_1, y(\sigma_1)), \ldots, (\sigma_N, y(\sigma_N))\}, the prescriptive process monitoring task is as follows: for each ongoing process case, at prefix σk\sigma_k (i.e., the first kk executed activities), OmegaPRM outputs at each decision point a set Rk\mathcal{R}_k of temporal logic constraints---each constraint associated with a requirement to be satisfied or violated---such that compliance with Rk\mathcal{R}_k maximizes the probability σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle0.

OmegaPRM is formulated to satisfy two desiderata:

  • Reliability: If the recommendations σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle1 are obeyed, the probability of achieving the positive outcome is high (empirically, σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle2 in 18 of 22 benchmarks).
  • Flexibility: Recommendations are temporal relations (not rigid activity sequences), maintaining operational freedom.

2. Temporal Logic Pattern Encoding

OmegaPRM builds on a catalog of Linear Temporal Logic over finite traces (LTLσ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle3) patterns, known as Declare templates, to express process-level constraints. Patterns include:

  • Existence: σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle4 (“Activity σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle5 must eventually occur”)
  • Absence: σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle6 (“Activity σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle7 must not occur”)
  • Response: σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle8 (“If σ=⟨a1,…,an⟩\sigma = \langle a_1, \ldots, a_n \rangle9 occurs, ai∈Σa_i \in \Sigma0 must eventually occur afterwards”)
  • Precedence: ai∈Σa_i \in \Sigma1 (“ai∈Σa_i \in \Sigma2 can only occur if ai∈Σa_i \in \Sigma3 has already occurred”)

A feature mapping ai∈Σa_i \in \Sigma4 projects each prefix to a binary vector indicating which patterns are satisfied.

3. Machine Learning Model for Outcome Estimation

OmegaPRM utilizes a machine learning classifier ai∈Σa_i \in \Sigma5---specifically, a decision tree (DT)---trained to estimate ai∈Σa_i \in \Sigma6, where ai∈Σa_i \in \Sigma7. Training uses the Gini impurity on splits, with hyperparameters controlling tree depth and minimum node size. The model learns mappings between combinations of satisfied/violated temporal logic patterns and outcome probabilities.

The classifier ai∈Σa_i \in \Sigma8 is trained as: ai∈Σa_i \in \Sigma9 where L⊆Σ∗L \subseteq \Sigma^*0 denotes the 0--1 loss approximated by Gini impurity.

4. Real-Time Supervision and Recommendation Procedure

At runtime, for an ongoing case at prefix L⊆Σ∗L \subseteq \Sigma^*1:

  1. Encode: Compute L⊆Σ∗L \subseteq \Sigma^*2 indicating satisfied patterns for the prefix.
  2. Query: Feed L⊆Σ∗L \subseteq \Sigma^*3 into the DT classifier to identify “positive” paths (paths to leaves with the majority of training labels L⊆Σ∗L \subseteq \Sigma^*4).
  3. Score: For each such path L⊆Σ∗L \subseteq \Sigma^*5, compute:
    • Fitness: fraction of split conditions in L⊆Σ∗L \subseteq \Sigma^*6 that L⊆Σ∗L \subseteq \Sigma^*7 satisfies,
    • Purity: L⊆Σ∗L \subseteq \Sigma^*8 Gini impurity of the leaf,
    • Support: fraction of training positives reaching L⊆Σ∗L \subseteq \Sigma^*9.

Score each path as

y(σ)∈{0,1}y(\sigma)\in \{0,1\}0

  1. Select the highest scoring path y(σ)∈{0,1}y(\sigma)\in \{0,1\}1. For any split y(σ)∈{0,1}y(\sigma)\in \{0,1\}2 along y(σ)∈{0,1}y(\sigma)\in \{0,1\}3 not satisfied by y(σ)∈{0,1}y(\sigma)\in \{0,1\}4, output the recommendation:
    • “Pattern y(σ)∈{0,1}y(\sigma)\in \{0,1\}5 must be satisfied” if y(σ)∈{0,1}y(\sigma)\in \{0,1\}6 and y(σ)∈{0,1}y(\sigma)\in \{0,1\}7,
    • “Pattern y(σ)∈{0,1}y(\sigma)\in \{0,1\}8 must be violated” otherwise.

Recommendations are prioritized by split order in y(σ)∈{0,1}y(\sigma)\in \{0,1\}9. This produces a ranked set Ltrain={(σ1,y(σ1)),…,(σN,y(σN))}L_{\text{train}} = \{(\sigma_1, y(\sigma_1)), \ldots, (\sigma_N, y(\sigma_N))\}0 of temporal constraints.

5. Experimental Evaluation and Performance

OmegaPRM was evaluated on 22 real-world event logs from the process mining literature, covering business, healthcare, and production domains. Metrics included:

  • Classifier Quality: Precision, recall, F1-score on complete traces (achieving F1 > 90% on 18/22 datasets).
  • Prescriptive Quality: Offline “what-if” experimentation, scoring F1 > 90% in prescriptive peaks, showing no loss of reliability versus more rigid next-activity recommenders.
  • Efficiency: Each recommendation is generated in milliseconds, even for long traces.
  • Pattern Selection: Response and precedence patterns, and collections covering all patterns, delivered the best prescriptive accuracy.

A typical running case: In a sepsis-management log, if the current prefix lacks occurrence of ReleaseA, OmegaPRM recommends “◇ ReleaseA must be satisfied”—in LTLLtrain={(σ1,y(σ1)),…,(σN,y(σN))}L_{\text{train}} = \{(\sigma_1, y(\sigma_1)), \ldots, (\sigma_N, y(\sigma_N))\}1, expressing the clinical imperative that a specific intervention should eventually be performed.

6. Deployment Considerations and Best Practices

Deployment involves:

  • Offline: Mining labeled logs, selecting a moderate set of frequent LTLLtrain={(σ1,y(σ1)),…,(σN,y(σN))}L_{\text{train}} = \{(\sigma_1, y(\sigma_1)), \ldots, (\sigma_N, y(\sigma_N))\}2 patterns (e.g., via Apriori), and DT training/tuning.
  • Online: Maintaining current prefixes, incrementally encoding satisfied patterns, executing the recommendation algorithm in real time, and serving recommendations in either formulaic or controlled natural language (e.g., “Please ensure that eventually ReleaseA occurs”).
  • Scenarios: Optimal for knowledge-intensive, unpredictable domains (e.g., healthcare, crisis management) where prescriptive flexibility is essential.
  • Scalability: Recommendations are generated in real time (milliseconds per case).
  • Extensibility: For data-heavy traces where data-payload correlations are important, extend the pattern set Ltrain={(σ1,y(σ1)),…,(σN,y(σN))}L_{\text{train}} = \{(\sigma_1, y(\sigma_1)), \ldots, (\sigma_N, y(\sigma_N))\}3 to capture data-aware temporal logic.

7. Context within Process Supervision and Limitations

OmegaPRM represents a class of process supervision systems that operationalize flexible, interpretable prescriptive interventions via learned temporal-logic rules. Unlike static “next-activity” recommenders, OmegaPRM's constraints capture temporal dependencies and allow end-users to select implementation strategies—as long as high-level temporal goals are met. A limitation is the reliance on well-selected LTLLtrain={(σ1,y(σ1)),…,(σN,y(σN))}L_{\text{train}} = \{(\sigma_1, y(\sigma_1)), \ldots, (\sigma_N, y(\sigma_N))\}4 patterns; inadequate pattern sets may underrepresent latent process relationships. Additionally, effectiveness hinges on the quality and representativeness of the labeled training log. Future directions include extending pattern sets to handle complex data correlations and integrating continuous learning in evolving process contexts (Donadello et al., 2022).


OmegaPRM demonstrates the integration of symbolic temporal logic, interpretable machine learning, and real-time monitoring to deliver outcome-oriented, user-friendly process supervision in business-process environments.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Process Supervision OmegaPRM.