Lennart Fertig, Lukas Kirchdorfer, Tobias Sesterhenn
6 min
Predictive Process Monitoring (PPM) aims to forecast future process outcomes—such as the next activity, remaining time, or time until the next event—using historical event logs. While deep sequence models (like LSTMs) have long been the standard, the rise of foundation models has introduced new alternatives, including Large Language Models (LLMs) and tabular foundation models. This paper provides a systematic, controlled benchmark comparing these three paradigms to determine if classical sequence models remain the most effective approach.
The authors categorize PPM approaches into three distinct paradigms:
The empirical benchmark across five real-world event logs reveals that no single paradigm dominates every task. Sequence models (LSTM and Transformer) consistently achieve the highest accuracy for next-activity prediction, likely because they explicitly model the sequential trajectory of events. In contrast, tabular foundation models are highly competitive for temporal tasks (remaining time and next-event timing), often matching or exceeding sequence models. LLMs generally underperform compared to the other two paradigms while incurring significantly higher computational costs.
This study clarifies the trade-offs between specialized sequence modeling and general-purpose foundation models in process mining. For practitioners, the results suggest that sequence models remain the robust choice for activity-based predictions, while tabular foundation models offer a viable, efficient alternative for temporal forecasting. The findings also highlight the limitations of applying LLMs to structured process data, suggesting that their general-purpose capabilities do not automatically translate to superior performance in process-specific tasks.
Predictive process monitoring (PPM) leverages event logs to forecast the future of running process instances, for instance, predicting the next activity, the remaining time until case completion, or the time to the next event. While PPM research in recent years has been dominated by deep sequence models trained from scratch, such as Long Short-Term Memory (LSTM) models, foundation-model approaches---particularly large language models (LLMs)---are increasingly explored for PPM. At the same time, tabular foundation models with in-context learning capabilities offer a promising alternative but have not yet been systematically benchmarked for PPM. Thus, it remains unclear whether classical sequence-based models remain competitive in this evolving landscape. This paper compares the three modeling paradigms both conceptually and empirically through a controlled benchmark across multiple datasets and prediction tasks. The results show that sequence models consistently perform best for next activity prediction, whereas tabular foundation models are competitive on temporal tasks, with LLMs usually lagging behind despite higher cost.
Alex: And what did they find?
Sam: For predicting the next activity—the actual next step—the specialized sequence models were the clear winners. The reason gets at something fundamental about how these models are built. Sequence models have a built-in instinct for order. They're wired to ask, "given everything that happened before, what comes next?" When a process has many possible branching paths—after step A, you might go to B, C, or D—that instinct is very valuable. The sequence model has learned which branches are likely from thousands of examples. The LLM is making a more educated guess based on general knowledge, and the tabular model isn't really tracking the sequence at all.
Alex: So the more complex the branching, the more the sequence model pulls ahead?
Sam: That's what the data suggests, and it held across the different event logs they tested. But here's where it gets more nuanced: for timing predictions, the picture flips.
Alex: How so?
Sam: For predicting how long a process will take, the tabular foundation models were genuinely competitive—in some cases, better than the sequence models. The reason is almost the opposite of why sequence models win on next-step prediction. For timing, you don't need to know the exact path. You need to recognize patterns in the current state of things. Tabular models were pre-trained on enormous amounts of structured data, so they've already absorbed a lot of those statistical patterns. They don't need to relearn them from scratch.
Alex: So the tabular models are better at reading the room, while the sequence models are better at following the plot.
Sam: That's a useful way to put it. And the practical implication the authors raise is that a hybrid approach might be the most sensible design for future systems—use a sequence model to navigate the path, and a tabular model to estimate the timing.
Alex: Where did the LLMs land?
Sam: Somewhere in the middle, and with a specific weakness worth noting. They generally outperformed the tabular models on next-step prediction, but they were slower and more expensive to run. They also showed a consistent failure pattern: on several datasets, they would frequently predict that a process had ended when it actually hadn't—calling the finish line too early, much more often than the sequence models did.
Alex: So it's not that they're unreliable in a random way. They have a particular blind spot.
Sam: Correct. And that kind of systematic error matters a lot in operational settings, where a false "all done" signal could cause real problems downstream.
Alex: Are there limitations to the study we should keep in mind?
Sam: The authors are quite open about a few. The LLMs they tested were relatively small versions—it's possible that much larger models might perform better, though they would also be considerably more expensive to run, which is itself a practical constraint. The tabular models also struggled with the largest datasets because they can only process a limited amount of data at once. That's a common ceiling in current AI systems, and it matters when your event logs are very long.
Alex: So the findings are meaningful, but they're a snapshot of where these models are right now—not a permanent verdict.
Sam: That's the right framing. What the study does establish clearly is that specialized sequence models remain highly effective for structured prediction tasks. The most complex model isn't automatically the most useful one. A model built specifically to understand the structure of your data can outperform a general-purpose system, even a much larger one.
Alex: It's a useful reminder that in data science, picking the right tool for the specific job still matters more than picking the most powerful tool on the shelf.
Sam: Thanks for listening to ResearchPod.