A. K. Alves de Medeiros
Eindhoven University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by A. K. Alves de Medeiros.
Information Systems | 2007
W.M.P. van der Aalst; Hajo A. Reijers; A.J.M.M. Weijters; B.F. van Dongen; A. K. Alves de Medeiros; Minseok Song; H. M. W. Verbeek
Contemporary information systems (e.g., WfM, ERP, CRM, SCM, and B2B systems) record business events in so-called event logs. Business process mining takes these logs to discover process, control, data, organizational, and social structures. Although many researchers are developing new and more powerful process mining techniques and software vendors are incorporating these in their software, few of the more advanced process mining techniques have been tested on real-life processes. This paper describes the application of process mining in one of the provincial offices of the Dutch National Public Works Department, responsible for the construction and maintenance of the road and water infrastructure. Using a variety of process mining techniques, we analyzed the processing of invoices sent by the various subcontractors and suppliers from three different perspectives: (1) the process perspective, (2) the organizational perspective, and (3) the case perspective. For this purpose, we used some of the tools developed in the context of the ProM framework. The goal of this paper is to demonstrate the applicability of process mining in general and our algorithms and tools in particular.
applications and theory of petri nets | 2005
W.M.P. van der Aalst; A. K. Alves de Medeiros; A.J.M.M. Weijters
The topic of process mining has attracted the attention of both researchers and tool vendors in the Business Process Management (BPM) space. The goal of process mining is to discover process models from event logs, i.e., events logged by some information system are used to extract information about activities and their causal relations. Several algorithms have been proposed for process mining. Many of these algorithms cannot deal with concurrency. Other typical problems are the presence of duplicate activities, hidden activities, non-free-choice constructs, etc. In addition, real-life logs contain noise (e.g., exceptions or incorrectly logged events) and are typically incomplete (i.e., the event logs contain only a fragment of all possible behaviors). To tackle these problems we propose a completely new approach based on genetic algorithms. As can be expected, a genetic approach is able to deal with noise and incompleteness. However, it is not easy to represent processes properly in a genetic setting. In this paper, we show a genetic process mining approach using the so-called causal matrix as a representation for individuals. We elaborate on the relation between Petri nets and this representation and show that genetic algorithms can be used to discover Petri net models from event logs.
business process management | 2006
W.M.P. van der Aalst; A. K. Alves de Medeiros; A.J.M.M. Weijters
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matching some desired service description, or to compare some normative process model with a process model discovered using process mining techniques. Although many researchers have worked on different notions of equivalence (e.g., trace equivalence, bisimulation, branching bisimulation, etc.), most of the existing notions are not very useful in this context. First of all, most equivalence notions result in a binary answer (i.e., two processes are equivalent or not). This is not very helpful, because, in real-life applications, one needs to differentiate between slightly different models and completely different models. Second, not all parts of a process model are equally important. There may be parts of the process model that are rarely activated while other parts are executed for most process instances. Clearly, these should be considered differently. To address these problems, this paper proposes a completely new way of comparing process models. Rather than directly comparing two models, the process models are compared with respect to some typical behavior. This way we are able to avoid the two problems. Although the results are presented in the context of Petri nets, the approach can be applied to any process modeling language with executable semantics.
international conference on move to meaningful internet systems | 2007
A. K. Alves de Medeiros; Carlos Pedrinaci; W.M.P. van der Aalst; John Domingue; Minseok Song; A Anne Rozinat; Barry Norton; Liliana Cabral
Semantic Business Process Management (SBPM) has been proposed as an extension of BPM with Semantic Web and Semantic Web Services (SWS) technologies in order to increase and enhance the level of automation that can be achieved within the BPM life-cycle. In a nutshell, SBPM is based on the extensive and exhaustive conceptualization of the BPM domain so as to support reasoning during business processes modelling, composition, execution, and analysis, leading to important enhancements throughout the life-cycle of business processes. An important step of the BPM life-cycle is the analysis of the processes deployed in companies. This analysis provides feedback about how these processes are actually being executed (like common control-flow paths, performance measures, detection of bottlenecks, alert to approaching deadlines, auditing, etc). The use of semantic information can lead to dramatic enhancements in the state-of-the-art in analysis techniques. In this paper we present an outlook on the opportunities and challenges on semantic business process mining and monitoring, thus paving the way for the implementation of the next generation of BPM analysis tools.
business process management | 2005
A. K. Alves de Medeiros; A.J.M.M. Weijters; W.M.P. van der Aalst
One of the aims of process mining is to retrieve a process model from a given event log. However, current techniques have problems when mining processes that contain non-trivial constructs and/or when dealing with the presence of noise in the logs. To overcome these problems, we try to use genetic algorithms to mine process models. The non-trivial constructs are tackled by choosing an internal representation that supports them. The noise problem is naturally tackled by the genetic algorithm because, per definition, these algorithms are robust to noise. The definition of a good fitness measure is the most critical challenge in a genetic approach. This paper presents the current status of our research and the pros and cons of the fitness measure that we used so far. Experiments show that the fitness measure leads to the mining of process models that can reproduce all the behavior in the log, but these mined models may also allow for extra behavior. In short, the current version of the genetic algorithm can already be used to mine process models, but future research is necessary to always ensure that the mined models do not allow for extra behavior. Thus, this paper also discusses some ideas for future research that could ensure that the mined models will always only reflect the behavior in the log.
applications and theory of petri nets | 2007
W.M.P. van der Aalst; B.F. van Dongen; C. W. Güunther; Rs Ronny Mans; A. K. Alves de Medeiros; A Anne Rozinat; Vladimir A. Rubin; Minseok Song; H. M. W. Verbeek; A.J.M.M. Weijters
data and knowledge engineering | 2008
A. K. Alves de Medeiros; W.M.P. van der Aalst; A.J.M.M. Weijters
Archive | 2007
A.J.M.M. Weijters; W.M.P. van der Aalst; B.F. van Dongen; Cw Christian Günther; Rs Ronny Mans; A. K. Alves de Medeiros; A Anne Rozinat; Song; H. M. W. Verbeek; Mehdi Dastani; E. de Jong
business process management | 2007
A Anne Rozinat; A. K. Alves de Medeiros; Cw Christian Günther; A.J.M.M. Weijters; W.M.P. van der Aalst
IEEE Transactions on Software Engineering | 2009
Malu Castellanos; A. K. Alves de Medeiros; Jan Mendling; Barbara Weber; A.J.M.M. Weijters; Jorge Cardoso; W.M.P. van der Aalst