Search

Organizations can benefit from the use of practices, techniques, and tools from the area of business process management. Through the focus on processes, they create process models that require management, including support for versioning, refactoring and querying. Querying thus far has primarily focused on structural properties of models rather than on exploiting behavioral properties capturing aspects of model execution. While the latter is more challenging, it is also more effective, especially when models are used for auditing or process automation. The focus of this paper is to overcome the challenges associated with behavioral querying of process models in order to unlock its benefits. The first challenge concerns determining decidability of the building blocks of the query language, which are the possible behavioral relations between process tasks. The second challenge concerns achieving acceptable performance of query evaluation. The evaluation of a query may require expensive checks in all process models, of which there may be thousands. In light of these challenges, this paper proposes a special-purpose programming language, namely Process Query Language (PQL) for behavioral querying of process model collections. The language relies on a set of behavioral predicates between process tasks, whose usefulness has been empirically evaluated with a pool of process model stakeholders. This study resulted in a selection of the predicates to be implemented in PQL, whose decidability has also been formally proven. The computational performance of the language has been extensively evaluated through a set of experiments against two large process model collections. [ABSTRACT FROM AUTHOR]

Process-oriented data analysis techniques allow organizations to understand how their processes operate, where modifications are needed and where enhancements are possible. A recurrent task in any process analysis technique is querying. Process data querying allows analysts to easily explore the data with the intent of getting insights about the execution of business processes. The current generation of process query languages targets data scientists. However, there is a need to a query language to support domain analysts who may be inexperienced with database technologies. This paper addresses this challenge by proposing a natural language interface that assists the end-users in querying the stored event data. The interface takes a natural language query from the user, automatically constructs a corresponding structured query to be executed over the stored event data. We use graph based storage techniques, namely labeled property graphs, which allow to explicitly model event data relationships. As an executable query language, we use the Cypher language which is widely used for querying property graphs. The approach has been implemented and evaluated using two publicly available event logs. • We proposed a natural language interface for querying process execution data from natural language. • We presents a Labeled Graph metamodel for stroing process data. • We proposed a hybrid pipline to automatically constructing Cypher queries from natural language. • Our NLI system is hybrid and combines machine learning and rule-based approaches. • We defined a set of general intent patterns that are domain-independent. • We evaluated the proposed system with more than 530 natural language queries. [ABSTRACT FROM AUTHOR]

Process models constitute valuable artifacts for organizations. A process model formally captures the way an organization works internally and interacts with its customers and partners. Over time, more models may be created as business practices evolve (leading to different versions of models) or an organization expands, e.g., through mergers or acquisitions. It is not uncommon for large organizations to have to manage thousands of process models. Retrieval of process models with desired properties then poses a significant challenge, particularly when one is concerned with finding models that describe certain process scenarios, i.e., sequences of tasks captured in models. This paper proposes a method for automated process model retrieval based on scenario compatibility. A process model is retrieved if it has the potential to perform the specified process scenario. To allow for scenarios to be underspecified, wildcards may be used in their description. The paper reports on a formal language for scenario-based process querying, its implementation, and evaluation in the context of industrial and synthetic process models. The results show that the technique works in (close to) real time. • Definition of the scenario-based process querying problem is given. • Solution to the scenario-based process querying problem is presented. • The solution allows retrieving process models based on scenarios that they describe. • Publicly available implementation of the proposed querying approach is presented. • Discussed evaluation justifies close to real time performance of our implementation. [ABSTRACT FROM AUTHOR]