Hugo Andres Lopez A.

Verified

Hugo Andres verified their affiliation via an institutional email.

Learn more

Verified

Hugo Andres verified their affiliation via an institutional email.

Learn more

• Ph.D. Computer Science
• Professor (Associate) at Technical University of Denmark

Clinical pathways are structured, multidisciplinary care plans utilized by healthcare providers to standardize the management of specific clinical problems. Designed to bridge the gap between evidence and practice, clinical pathways aim to enhance clinical outcomes and improve efficiency, often reducing hospital stays and lowering healthcare costs....

Business process models are essential for the representation, analysis, and execution of organizational processes, serving as orchestration blueprints while relying on (web) services to implement individual tasks. At the representation level, there are two dominant paradigms: procedural (imperative) notations that specify the sequential flows withi...

Digitalization efforts often face a key challenge: business processes must not only be efficient in achieving their goals but also adhere to legal regulations. Business process compliance refers to aligning processes with these regulations. Numerous frameworks have been developed to address this, with the earliest dating back to 1981. This study fo...

Declarative process models (DPMs) enable the description of business process models with a high level of flexibility by being able to describe the constraints that compliant traces must abide by. In this way, a well-formed declarative specification generates a family of compliant traces. However, little is known about the difference between differe...

Business Process Management is concerned with process-related artefacts such as informal specifications, formal models, and event logs. Often, these process-related artefacts may be affected by ambiguity, which may lead to misunderstandings, modelling errors, non-conformance, and incorrect interpretations. To date, a comprehensive and systematic an...

Process modeling notations are essential for analyzing, designing, improving, and digitalizing business processes in organizations. In particular, for knowledge-intensive processes, notations that allow flexible orchestration of activities are crucial for supporting discretionary work. Declarative Process Modeling notations allow describing the int...

Choreographic models express coordination between business roles, in contrast to standard process models that merge local control flow and communication between parties. A choreography is realizable, also known as endpoint projectable, if the independent behaviour of each role in composition with other roles, only behaves exactly in the same way as...

It may be tempting for researchers to stick to incremental extensions of their current work to plan future research activities. Yet there is also merit in realizing the grand challenges in one’s field. This paper presents an overview of the nine major research problems for the Business Process Management discipline. These challenges have been colle...

Process discovery is a family of techniques that helps to comprehend processes from their data footprints. Yet, as processes change over time so should their corresponding models, and failure to do so will lead to models that under- or over-approximate behaviour. We present a discovery algorithm that extracts declarative processes as Dynamic Condit...

Declarative process modelling notations are a family of approaches where events obey a set of constraints rather than specific flows. While declarative models can express in a few constructs a large set of process behaviours, there is little adoption of declarative approaches compared to their imperative counterparts. One possible reason is that wh...

We present ParTypes, a type discipline for parallel programs. The model we have in mind comprises a fixed number of processes running in parallel and communicating via collective operations or point-to-point synchronous message exchanges. A type describes a protocol to be followed by each processes in a given program. We present the type theory, a...

Process discovery is a family of techniques that helps to comprehend processes from their data footprints. Yet, as processes change over time so should their corresponding models, and failure to do so will lead to models that under- or over-approximate behavior. We present a discovery algorithm that extracts declarative processes as Dynamic Conditi...

Session-based concurrency is a type-based approach to the analysis of message-passing programs. These programs may be specified in an operational or declarative style: the former defines how interactions are properly structured; the latter defines governing conditions for correct interactions. In this paper, we study rigorous relationships between...

Business Process models are conceptual representations of work practices. However, a process is more than its model: key information about the rationale of the process is hidden in accompanying documents. We present a framework for business process discovery from process descriptions in texts. We use declarative process models as our target modelli...

In this paper, we take technical and practical steps towards the modularisation of compliant-by-design executable declarative process models. First, we demonstrate by example how the specific language of timed DCR graphs is capable of modelling complex legislation, with examples from laws regulating the functioning of local governments in Denmark....

Imperative process models have become immensely popular. However, their use is usually limited to rigid and repetitive processes. Considering the inherent flexibility in most processes in the real-world and the increased need for managing knowledge-intensive processes, the adoption of declarative languages becomes more pertinent than ever. While th...

Legal compliance is an important part of certifying the correct behaviour of a business process. To be compliant, organizations might hard-wire regulations into processes, limiting the discretion that workers have when choosing what activities should be executed in a case. Worse, hard-wired compliant processes are difficult to change when laws chan...

Process modeling aims at providing an external representation of a business process in the shape of a process model. The complexity of the modeling language, the usability of the modeling tool, and the expertise of the modeler are among the key factors defining the difficulty of a modeling task. Following a qualitative analysis approach, this work...

We provide the first formal model for declarative choreographies, which is able to express general omega-regular liveness properties. We use the Dynamic Condition Response (DCR) graphs notation for both choreographies and end-points. We define end-point projection as a restriction of DCR graphs and derive the condition for end-point projectability...

This paper reports preliminary experiences using the Dynamic Condition Response (DCR) graphs declarative process notation to specify dynamic evaluation forms, and using an execution engine for that notation to subsequently "run" the form. The DCR notation was able to express all the patterns of behaviour necessary for a real case: a post-hoc evalua...

Energy Systems are facing a significant change in the way their management and control is conceived. With the introduction of distributed and renewable energy based resources, a shift to a more distributed operation paradigm is emerging, overturning the conventional top-down design and operation principles. This shift creates a demand for distribut...

Choreographic programming is a programming-language design approach that drives error-safe protocol development in distributed systems. Starting from a global specification (choreography) one can generate distributed implementations. The advantages of this top-down approach lie in the correctness-by-design principle, where implementations (endpoint...

Choreographic programming is a programming-language design approach that drives error-safe protocol development in distributed systems. Motivated by challenging scenarios in Cyber-Physical Systems (CPS), we study how choreographic programming can cater for dynamic infrastructures where the availability of components may change at runtime. We introd...

We present ParTypes, a type-based methodology for the verification of Message Passing Interface (MPI) programs written in the C programming language. The aim is to statically verify programs against protocol specifications, enforcing properties such as fidelity and absence of deadlocks. We develop a protocol language based on a dependent type syste...

Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured; the latter defines governing conditions. In this paper, we investigate the relationship between operatio...

We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL), a modal logic describing possible interactions a...

The Conversation Calculus (CC) is a model of multiparty interactions which extends the π -calculus with the notion of conversation --a possibly distributed medium in which participants may communicate. Here we study the interplay of time and exceptional behavior for models of structured communications based on conversations. We propose C3, a timed...

We present a unified framework for the declarative analysis of structured communications. By relying on a (timed) concurrent constraint programming language, we show that in addition to the usual operational techniques from process calculi, the analysis of structured communications can elegantly exploit logic-based reasoning techniques. We introduc...

Service and process-oriented systems promise to provide more effective business and work processes and more flexible and adaptable enterprise IT systems. However, the technologies and standards are still young and unstable, making research in their theoretical foundations increasingly important. Our studies focus on two dichotomies: the global/loca...

The fundamental primitives of Concurrent Constraint Programming (CCP), \({\mathit{tell}}\) and \({\mathit {ask}}\), respectively adds knowledge to and infers knowledge from a shared constraint store. These features, and the elegant use of the constraint system to represent the abilities of attackers, make concurrent constraint programming and timed...

We present a unified framework for the declarative analysis of structured communications. By relying on a (timed) concurrent constraint programming language, we show that in addition to the usual operational techniques from process calculi, the analysis of structured communications can elegantly exploit logic-based reasoning techniques. We introduc...

The introduction of information technologies in health care systems often requires to re-engineer the business processes used to deliver care. Obvi- ously, the new and re-engineered processes are observationally different and thus we cannot use existing model-based techniques to argue that they are somehow "equivalent". In this paper we propose a m...

Due to technological advances such as the Internet and mobile computing, Security has become a serious challenge involving several disciplines of Computer Science. In recent years, there has been a growing interest in the analysis of security protocols and one promising approach is the development of formalisms that model communicating processes, i...

The notion of computation has significantly evolved in the last ten years or so. Modern computing systems (e.g., Internet) now exhibit infinite behavior, usually in the context of decentralized networks where interactions are inherently concurrent. The ubiqui-tous presence of this new kind of systems has led to the urgent need of counting with tech...

Recent advances in communication have made the use of dynamic and reconfigurable network topologies a mandatory requirement in scenarios where the participants must actively collaborate to each other to achieve a common, specific goal. A particular case of those scenarios are the Peer-to-Peer (P2P) systems. The wide applicability of P2P-based appli...

Peer-to-Peer (P2P) systems can be seen as highly dynamic distributed systems designed for very specific purposes, such as resources sharing in collaborative settings. Be-cause of their ubiquity, it is fundamental to provide techniques for formally proving prop-erties of the communication protocols underlying those systems. In this paper we present...

Peer-to-Peer (P2P) systems can be seen as highly dy-namic distributed systems designed for very specific pur-poses, such as resources sharing in collaborative settings. Because of their ubiquity, it is fundamental to provide tech-niques for formally proving properties of the communica-tion protocols underlying those systems. In this paper we presen...