Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Fabrizio Maria Maggi is active.

Publication


Featured researches published by Fabrizio Maria Maggi.


business process management | 2012

Process Mining Manifesto

Wil M. P. van der Aalst; A Arya Adriansyah; Ana Karla Alves de Medeiros; Franco Arcieri; Thomas Baier; Tobias Blickle; R. P. Jagadeesh Chandra Bose; Peter van den Brand; Ronald Brandtjen; Joos C. A. M. Buijs; Andrea Burattin; Josep Carmona; Malu Castellanos; Jan Claes; Jonathan E. Cook; Nicola Costantini; Francisco Curbera; Ernesto Damiani; Massimiliano de Leoni; Pavlos Delias; Boudewijn F. van Dongen; Marlon Dumas; Schahram Dustdar; Dirk Fahland; Diogo R. Ferreira; Walid Gaaloul; Frank van Geffen; Sukriti Goel; Cw Christian Günther; Antonella Guzzo

Process mining techniques are able to extract knowledge from event logs commonly available in today’s information systems. These techniques provide new means to discover, monitor, and improve processes in a variety of application domains. There are two main drivers for the growing interest in process mining. On the one hand, more and more events are being recorded, thus, providing detailed information about the history of processes. On the other hand, there is a need to improve and support business processes in competitive and rapidly changing environments. This manifesto is created by the IEEE Task Force on Process Mining and aims to promote the topic of process mining. Moreover, by defining a set of guiding principles and listing important challenges, this manifesto hopes to serve as a guide for software developers, scientists, consultants, business managers, and end-users. The goal is to increase the maturity of process mining as a new tool to improve the (re)design, control, and support of operational business processes.


business process management | 2011

Monitoring business constraints with linear temporal logic: an approach based on colored automata

Fabrizio Maria Maggi; Marco Montali; Michael Westergaard; Wil M. P. van der Aalst

Todays information systems record real-time information about business processes. This enables the monitoring of business constraints at runtime. In this paper, we present a novel runtime verification framework based on linear temporal logic and colored automata. The framework continuously verifies compliance with respect to a predefined constraint model. Our approach is able to provide meaningful diagnostics even after a constraint is violated. This is important as in reality people and organizations will deviate and in many situations it is not desirable or even impossible to circumvent constraint violations. As demonstrated in this paper, there are several approaches to recover after the first constraint violation. Traditional approaches that simply check constraints are unable to recover after the first violation and still foresee (inevitable) future violations. The framework has been implemented in the process mining tool ProM.


conference on advanced information systems engineering | 2014

Predictive Monitoring of Business Processes

Fabrizio Maria Maggi; Chiara Di Francescomarino; Marlon Dumas; Chiara Ghidini

Modern information systems that support complex business processes generally maintain significant amounts of process execution data, particularly records of events corresponding to the execution of activities (event logs). In this paper, we present an approach to analyze such event logs in order to predictively monitor business constraints during business process execution. At any point during an execution of a process, the user can define business constraints in the form of linear temporal logic rules. When an activity is being executed, the framework identifies input data values that are more (or less) likely to lead to the achievement of each business constraint. Unlike reactive compliance monitoring approaches that detect violations only after they have occurred, our predictive monitoring approach provides early advice so that users can steer ongoing process executions towards the achievement of business constraints. In other words, violations are predicted (and potentially prevented) rather than merely detected. The approach has been implemented in the ProM process mining toolset and validated on a real-life log pertaining to the treatment of cancer patients in a large hospital.


ACM Transactions on Intelligent Systems and Technology | 2013

Monitoring business constraints with the event calculus

Marco Montali; Fabrizio Maria Maggi; Federico Chesani; Paola Mello; Wil M. P. van der Aalst

Today, large business processes are composed of smaller, autonomous, interconnected subsystems, achieving modularity and robustness. Quite often, these large processes comprise software components as well as human actors, they face highly dynamic environments and their subsystems are updated and evolve independently of each other. Due to their dynamic nature and complexity, it might be difficult, if not impossible, to ensure at design-time that such systems will always exhibit the desired/expected behaviors. This, in turn, triggers the need for runtime verification and monitoring facilities. These are needed to check whether the actual behavior complies with expected business constraints, internal/external regulations and desired best practices. In this work, we present Mobucon EC, a novel monitoring framework that tracks streams of events and continuously determines the state of business constraints. In Mobucon EC, business constraints are defined using the declarative language Declare. For the purpose of this work, Declare has been suitably extended to support quantitative time constraints and non-atomic, durative activities. The logic-based language Event Calculus (EC) has been adopted to provide a formal specification and semantics to Declare constraints, while a light-weight, logic programming-based EC tool supports dynamically reasoning about partial, evolving execution traces. To demonstrate the applicability of our approach, we describe a case study about maritime safety and security and provide a synthetic benchmark to evaluate its scalability.


computational intelligence and data mining | 2011

User-guided discovery of declarative process models

Fabrizio Maria Maggi; Arjan J. Mooij; Wil M. P. van der Aalst

Process mining techniques can be used to effectively discover process models from logs with example behaviour. Cross-correlating a discovered model with information in the log can be used to improve the underlying process. However, existing process discovery techniques have two important drawbacks. The produced models tend to be large and complex, especially in flexible environments where process executions involve multiple alternatives. This “overload” of information is caused by the fact that traditional discovery techniques construct procedural models explicitly showing all possible behaviours. Moreover, existing techniques offer limited possibilities to guide the mining process towards specific properties of interest. These problems can be solved by discovering declarative models. Using a declarative model, the discovered process behaviour is described as a (compact) set of rules. Moreover, the discovery of such models can easily be guided in terms of rule templates. This paper uses DECLARE, a declarative language that provides more flexibility than conventional procedural notations such as BPMN, Petri nets, UML ADs, EPCs and BPEL. We present an approach to automatically discover DECLARE models. This has been implemented in the process mining tool ProM. Our approach and toolset have been applied to a case study provided by the company Thales in the domain of maritime safety and security.


conference on advanced information systems engineering | 2012

Efficient discovery of understandable declarative process models from event logs

Fabrizio Maria Maggi; R. P. Jagadeesh Chandra Bose; Wil M. P. van der Aalst

Process mining techniques often reveal that real-life processes are more variable than anticipated. Although declarative process models are more suitable for less structured processes, most discovery techniques generate conventional procedural models. In this paper, we focus on discovering Declare models based on event logs. A Declare model is composed of temporal constraints. Despite the suitability of declarative process models for less structured processes, their discovery is far from trivial. Even for smaller processes there are many potential constraints. Moreover, there may be many constraints that are trivially true and that do not characterize the process well. Naively checking all possible constraints is computationally intractable and may lead to models with an excessive number of constraints. Therefore, we have developed an Apriori algorithm to reduce the search space. Moreover, we use new metrics to prune the model. As a result, we can quickly generate understandable Declare models for real-life event logs.


computer based medical systems | 2013

Smart technologies for long-term stress monitoring at work

Rafal Kocielnik; Natalia Sidorova; Fabrizio Maria Maggi; Martin Ouwerkerk; Joyce H. D. M. Westerink

Due to the growing pace of life, stress became one of the major factors causing health problems. We have developed a framework for measuring stress in real-life conditions continuously and unobtrusively. In order to provide meaningful, useful and actionable information, we present stress information, derived from sensor measurements, in the context of persons activities. In this paper, we describe our framework, discuss how we address arising challenges and evaluate our approach on basis of the field studies we have conducted. The main results of the evaluation are that the results of long-term measurements of stress reveal people information about their behavioral patterns that they perceive as meaningful and useful, and trigger their ideas about behavioral changes necessary to achieve a better stress balance.


Information Systems | 2015

Compliance monitoring in business processes

Linh Thao Ly; Fabrizio Maria Maggi; Marco Montali; Stefanie Rinderle-Ma; Wil M. P. van der Aalst

In recent years, monitoring the compliance of business processes with relevant regulations, constraints, and rules during runtime has evolved as major concern in literature and practice. Monitoring not only refers to continuously observing possible compliance violations, but also includes the ability to provide fine-grained feedback and to predict possible compliance violations in the future. The body of literature on business process compliance is large and approaches specifically addressing process monitoring are hard to identify. Moreover, proper means for the systematic comparison of these approaches are missing. Hence, it is unclear which approaches are suitable for particular scenarios. The goal of this paper is to define a framework for Compliance Monitoring Functionalities (CMF) that enables the systematic comparison of existing and new approaches for monitoring compliance rules over business processes during runtime. To define the scope of the framework, at first, related areas are identified and discussed. The CMFs are harvested based on a systematic literature review and five selected case studies. The appropriateness of the selection of CMFs is demonstrated in two ways: (a) a systematic comparison with pattern-based compliance approaches and (b) a classification of existing compliance monitoring approaches using the CMFs. Moreover, the application of the CMFs is showcased using three existing tools that are applied to two realistic data sets. Overall, the CMF framework provides powerful means to position existing and future compliance monitoring approaches.


runtime verification | 2011

Runtime verification of LTL-Based declarative process models

Fabrizio Maria Maggi; Michael Westergaard; Marco Montali; Wil M. P. van der Aalst

Linear Temporal Logic (LTL) on finite traces has proven to be a good basis for the analysis and enactment of flexible constraint-based business processes. The Declare language and system benefit from this basis. Moreover, LTL-based languages like Declare can also be used for runtime verification. As there are often many interacting constraints, it is important to keep track of individual constraints and combinations of potentially conflicting constraints . In this paper, we operationalize the notion of conflicting constraints and demonstrate how innovative automata-based techniques can be applied to monitor running process instances. Conflicting constraints are detected immediately and our toolset (realized using Declare and ProM) provides meaningful diagnostics.


business process management | 2013

Discovering data-aware declarative process models from event logs

Fabrizio Maria Maggi; Marlon Dumas; Luciano García-Bañuelos; Marco Montali

A wealth of techniques are available to automatically discover business process models from event logs. However, the bulk of these techniques yield procedural process models that may be useful for detailed analysis, but do not necessarily provide a comprehensible picture of the process. Additionally, barring few exceptions, these techniques do not take into account data attributes associated to events in the log, which can otherwise provide valuable insights into the rules that govern the process. This paper contributes to filling these gaps by proposing a technique to automatically discover declarative process models that incorporate both control-flow dependencies and data conditions. The discovered models are conjunctions of first-order temporal logic expressions with an associated graphical representation (Declare notation). Importantly, the proposed technique discovers underspecified models capturing recurrent rules relating pairs of activities, as opposed to full specifications of process behavior --- thus providing a summarized view of key rules governing the process. The proposed technique is validated on a real-life log of a cancer treatment process.

Collaboration


Dive into the Fabrizio Maria Maggi's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Marco Montali

Free University of Bozen-Bolzano

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Marta Cimitile

Sapienza University of Rome

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Michael Westergaard

Eindhoven University of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Claudio Di Ciccio

Vienna University of Economics and Business

View shared research outputs
Researchain Logo
Decentralizing Knowledge