Computing and Information Systems - Research Publications
Permanent URI for this collection
Search Results
1 - 7 of 7
-
ItemAPQL: A Process-Model Query Language(SPRINGER-VERLAG BERLIN, 2013-01-01)As business process management technology matures, organisations acquire more and more business process models. The management of the resulting collections of process models poses real challenges. One of these challenges concerns model retrieval where support should be provided for the formulation and efficient execution of business process model queries. As queries based on only structural information cannot deal with all querying requirements in practice, there should be support for queries that require knowledge of process model semantics. In this paper we formally define a process model query language that is based on semantic relationships between tasks in process models and is independent of any particular process modelling notation.
-
ItemAction logger: Enabling process mining for robotic process automation(CEUR Workshop Proceedings, 2019-01-01)This paper presents a tool, called Action Logger, for recording user interface (UI) logs, i.e., logs of user interactions with information systems. By generating output suitable for process mining, the tool aims to introduce process mining methods, techniques, and tools for supporting Robotic Process Automation (RPA) activities, e.g., robot discovery and implementation. Action Logger offers unique capabilities, including logging relevant user actions at a granularity level suitable for RPA, data-awareness, and context-independence.
-
ItemProcess querying in apromore(CEUR Workshop Proceedings, 2015-01-01)Process querying addresses the problem of automatically retrieving process models from collections thereof on the basis of user-defined queries. Process querying can be used to tackle problems of process compliance, reuse, redesign, and standardization [1].In this paper, we demonstrate a process querying environment that resulted from integrating Process Query Language (PQL) [2] into the Apromore process model reposi-tory [3]. PQL is a programming language based upon temporal logic with an intuitive SQL-like syntax for the specification of queries. The semantics of PQL queries is grounded in process model behavior. The intent of a PQL query is to retrieve process models from a collection of models based on the arrangements of activities and/or events in the process instances that these models describe. A screen cast that demonstrates the environment is available at https://youtu.be/S_U6frTWd3M. In the remainder of this paper, we provide an overview of PQL and its implementation,present the Apromore process model repository, discuss the integration of PQL into Apromore, and demonstrate the use of PQL in Apromore using a typical process querying scenario in the context of a process model collection taken from industry
-
ItemUntanglings: a novel approach to analyzing concurrent systems(SPRINGER, 2015-11-01)Substantial research efforts have been expended to deal with the complexity of concurrent systems that is inherent to their analysis, e.g., works that tackle the well-known state space explosion problem. Approaches differ in the classes of properties that they are able to suitably check and this is largely a result of the way they balance the trade-off between analysis time and space employed to describe a concurrent system. One interesting class of properties is concerned with behavioral characteristics. These properties are conveniently expressed in terms of computations, or runs, in concurrent systems. This article introduces the theory of untanglings that exploits a particular representation of a collection of runs in a concurrent system. It is shown that a representative untangling of a bounded concurrent system can be constructed that captures all and only the behavior of the system. Representative untanglings strike a unique balance between time and space, yet provide a single model for the convenient extraction of various behavioral properties. Performance measurements in terms of construction time and size of representative untanglings with respect to the original specifications of concurrent systems, conducted on a collection of models from practice, confirm the scalability of the approach. Finally, this article demonstrates practical benefits of using representative untanglings when checking various behavioral properties of concurrent systems.
-
ItemSplit Miner: Automated Discovery of Accurate and Simple Business Process Models from Event Logs(Springer Verlag, 2019-05)The problem of automated discovery of process models from event logs has been intensively researched in the past two decades. Despite a rich field of proposals, state-of-the-art automated process discovery methods suffer from two recurrent deficiencies when applied to real-life logs: (i) they produce large and spaghetti-like models; and (ii) they produce models that either poorly fit the event log (low fitness) or over-generalize it (low precision). Striking a trade-off between these quality dimensions in a robust and scalable manner has proved elusive. This paper presents an automated process discovery method, namely Split Miner, which produces simple process models with low branching complexity and consistently high and balanced fitness and precision, while achieving considerably faster execution times than state-of-the-art methods, measured on a benchmark covering twelve real-life event logs. Split Miner combines a novel approach to filter the directly-follows graph induced by an event log, with an approach to identify combinations of split gateways that accurately capture the concurrency, conflict and causal relations between neighbors in the directly-follows graph. Split Miner is also the first automated process discovery method that is guaranteed to produce deadlock-free process models with concurrency, while not being restricted to producing block-structured process models
-
ItemThe 4C spectrum of fundamental behavioral relations for concurrent systems(Springer International Publishing, 2014-01-01)The design of concurrent software systems, in particular process-aware information systems, involves behavioral modeling at various stages. Recently, approaches to behavioral analysis of such systems have been based on declarative abstractions defined as sets of behavioral relations. However, these relations are typically defined in an ad-hoc manner. In this paper, we address the lack of a systematic exploration of the fundamental relations that can be used to capture the behavior of concurrent systems, i.e., co-occurrence, conflict, causality, and concurrency. Besides the definition of the spectrum of behavioral relations, which we refer to as the 4C spectrum, we also show that our relations give rise to implication lattices. We further provide operationalizations of the proposed relations, starting by proposing techniques for computing relations in unlabeled systems, which are then lifted to become applicable in the context of labeled systems, i.e., systems in which state transitions have semantic annotations. Finally, we report on experimental results on efficiency of the proposed computations.
-
ItemIndexing and Efficient Instance-Based Retrieval of Process Models Using Untanglings(SPRINGER INT PUBLISHING AG, 2014-01-01)Process-Aware Information Systems (PAISs) support executions of operational processes that involve people, resources, and software applications on the basis of process models. Process models describe vast, often infinite, amounts of process instances, e.g., workflows supported by the systems. With the increasing adoption of PAISs, large process model repositories emerged in companies and public organizations. These repositories constitute significant information resources. Accurate and efficient retrieval of process models and/or process instances from such repositories is interesting for multiple reasons, e.g., searching for similar models/instances, filtering, reuse, standardization, process compliance checking, verification of formal properties, etc. This paper proposes a technique for indexing process models that relies on their alternative representations, called untanglings. We show the use of untanglings for retrieval of process models based on process instances that they specify via a solution to the total executability problem. Experiments with industrial process models testify that the proposed retrieval approach is up to three orders of magnitude faster than the state of the art.