Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Humam Kourani

dblp:335/9391 · DBLP profile ↗
← Back
9ranked-venue papers
8as first author
9since 2021 · last 2026
0000-0003-2375-2152ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Requirements engineering and software design · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design › software process
process modeling
1.522024
POWL: Partially Ordered Workflow Language (Extended Abstract) · IJCAI 2024
ProMoAI: Process Modeling with Generative AI · IJCAI 2024

Methods — techniques the papers use, named apart from their topics

large language model · 0.8generative AI · 0.8
YearPublicationVenuePosition
2026 Leveraging large language models for enhanced process model comprehension
abstract
In Business Process Management (BPM), effectively comprehending process models is crucial yet poses significant challenges, particularly as organizations scale and processes become more complex. This paper introduces a novel framework utilizing the advanced capabilities of Large Language Models (LLMs) to enhance the comprehension of complex process models. We present different methods for abstracting business process models into a format accessible to LLMs, and we implement advanced prompting strategies specifically designed to optimize LLM performance within our framework. Additionally, we present a tool, AIPA, that implements our proposed framework and allows for conversational process querying. We evaluate our framework and tool through: i) an automatic evaluation comparing different LLMs, model abstractions, and prompting strategies; ii) a qualitative analysis assessing the ability to identify critical quality issues in process models; and iii) a user study designed to assess AIPA’s effectiveness comprehensively. Results demonstrate our framework’s ability to improve the comprehension and understanding of process models, pioneering new pathways for integrating AI technologies into the BPM field. • Cutting-edge LLMs can effectively interpret abstractions of business process models. • Prompting techniques enhance the LLMs’ comprehension of process models. • Recent open-source LLMs demonstrate comparable effectiveness to commercial solutions. • Advanced LLMs can identify critical quality issues in process models, such as deadlocks and soundness violations. • A case study shows promising results with suggestions for more concise responses.
Humam Kourani, Alessandro Berti 0001, Jasmin Hennrich, Wolfgang Kratsch, Robin Weidlich, Chiao-Yun Li, Ahmad Arslan, Wil M. P. van der Aalst, Daniel Schuster 0001
Decis. Support Syst.1
2025 Translating Workflow Nets into the Partially Ordered Workflow Language
Humam Kourani, Gyunam Park, Wil M. P. van der Aalst
Petri Nets1
2025 Unlocking Non-Block-Structured Decisions: Inductive Mining with Choice Graphs
Humam Kourani, Gyunam Park, Wil M. P. van der Aalst
BPM1
2025 Discovering partially ordered workflow models
abstract
In many real-world scenarios, processes naturally define partial orders over their constituent tasks. Partially ordered representations can be exploited in process discovery as they facilitate modeling such processes. The Partially Ordered Workflow Language (POWL) extends partially ordered representations with control-flow operators to support modeling common process constructs such as choice and loop structures. POWL integrates the hierarchical nature of process trees with the flexibility of partially ordered representations, opening up significant opportunities in process discovery. This paper presents and compares various approaches for the automated discovery of POWL models. We investigate the effects of applying varying validity criteria to partial orders, and we propose methods for incorporating frequency information to improve the quality of the discovered models. Additionally, we propose alternative visualizations for POWL models, offering different approaches that may be useful in various contexts. The discovery approaches are evaluated using various real-life data sets, demonstrating the ability of POWL models to capture complex process structures. • Employing different validity requirements in the discovery of POWL models. • Incorporating frequency-based filtering in the discovery of POWL models. • Enhancing the visualization of the discovered models. • Proving the soundness of the discovered models.
Humam Kourani, Sebastiaan J. van Zelst, Daniel Schuster 0001, Wil M. P. van der Aalst
Inf. Syst.1
2024 ProMoAI: Process Modeling with Generative AI
Humam Kourani, Alessandro Berti 0001, Daniel Schuster 0001, Wil M. P. van der Aalst
IJCAI1
2024 POWL: Partially Ordered Workflow Language (Extended Abstract)
Humam Kourani, Sebastiaan J. van Zelst
IJCAI1
2023 POWL: Partially Ordered Workflow Language
Humam Kourani, Sebastiaan J. van Zelst
BPM1
2023 Scalable Discovery of Partially Ordered Workflow Models with Formal Guarantees
abstract
Many real-life processes naturally define partial orders over the activities they are composed of. Partial orders can be used as a graph-like representation of process behavior, allowing us to model concurrent and sequential dependencies. The Partially Ordered Workflow Language (POWL) combines block-structured modeling notations with partially-ordered graph representations. A POWL model is a hierarchical model where sub-models can be combined into a new model either using a control-flow operator or as a partial order. The application of POWL models in process mining remains a challenge due to a lack of scalable approaches for the discovery of POWL models. In this paper, we address this gap by proposing an approach for the discovery of POWL models that leverages large data sets and ensures high conformity with the input data. Our approach provides formal guarantees on the uniqueness, existence, and quality of discovered partial orders. The evaluation of our approach underscores its scalability with large data sets and its ability to generate high-quality models.
Humam Kourani, Daniel Schuster 0001, Wil M. P. van der Aalst
ICPM1
2023 Discovering hybrid process models with bounds on time and complexity: When to be formal and when not?
Wil M. P. van der Aalst, Riccardo De Masellis, Chiara Di Francescomarino, Chiara Ghidini, Humam Kourani
Inf. Syst.5