Search Results

Predictive monitoring is a subfield of process mining which focuses on forecasting the evolution of an ongoing process case. A related main challenge is activity suffix prediction, the problem of predicting the sequence of future activities until ...

Declarative process specifications, such as Declare, provide a natural framework to capture flexible business processes. However, the specification may be more, or less flexible, depending on how much freedom it provides – for example, a ...

Devising a strategy to make a system mimic behaviors from another system is a problem that naturally arises in many areas of Computer Science. In this work, we interpret this problem in the context of intelligent agents, from the perspective of LTLf, a ...

So far, approaches for business process modeling, enactment and monitoring have mainly been based on process specifications consisting of a single process model. This setting aptly captures monolithic scenarios from domains in which all possible ...

• A new model for data-aware, hybrid multi-process specifications (HMPS).
• HMPS enable modular business processes with procedural and declarative components.
• Synchronous and asynchronous semantics for both activities and variables in ...

Process Mining is a family of techniques for analyzing business process execution data recorded in event logs. Process models can be obtained as output of automated process discovery techniques or can be used as input of techniques for conformance ...

Complexity of medical treatments can vary from prescribing medicine for a specific ailment to managing a complex set of simultaneous medical issues. In the latter case, doctors are assisted by clinical guidelines which outline standard ...

• Hybrid models with imperative (processes) and declarative (constraints) components.

We present a formalization of multi-agent planning problems in which agents are explicitly represented. In contrast with previous formalisations, we discuss the advantages of representing agents explicitly and show the implementation in the Unified ...

Within the process mining field, Deterministic Finite State Automata (DFAs) are largely employed as foundation mechanisms to perform formal reasoning tasks over the information contained in the event logs, such as conformance checking, ...

• Deterministic Finite State Automata (DFAs) are employed to perform formal reasoning tasks in Process Mining.

One major limitation to the applicability of Reinforcement Learning (RL) to many practical domains is the large number of samples required to learn an optimal policy. To address this problem and improve learning efficiency, we consider a linear hierarchy ...

We study the monitoring of linear-time arithmetic properties against finite traces generated by an unknown dynamic system. The monitoring state is determined by considering at once the trace prefix seen so far, and all its possible finite-length, future ...

So far, business process monitoring approaches have mainly focused on monitoring executions with respect to a single process model. This setting aptly captures monolithic scenarios from domains in which all possible behaviors can be folded into a ...

Manufacturing is transitioning from a mass production model to a service model in which facilities ‘bid’ to produce products. To decide whether to bid for a complex, previously unseen product, a facility must be able to synthesize, on ...

It is known that the engineering of information systems usually requires a huge effort in integrating master data and business processes. Existing approaches, both from academia and the industry, typically come with ad-hoc abstractions to ...

In Markov Decision Processes (MDPs), the reward obtained in a state is Markovian, i.e., depends on the last state and action. This dependency makes it difficult to reward more interesting long-term behaviors, such as always closing a door after it has ...

One major task in business process management is that of aligning real process execution traces to a process model by (minimally) introducing and eliminating steps. Here, we look at declarative process specifications expressed in Linear Temporal Logic ...

In this paper,1 we investigate bounded action theories in the situation calculus. A bounded action theory is one which entails that, in every situation, the number of object tuples in the extension of fluents is bounded by a given constant, although ...

We investigate agents that have incomplete information and make decisions based on their beliefs expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at ...

We study plan synthesis for a variant of Knowledge and Action Bases (KABs), a rich, dynamic framework, where states are description logic (DL) knowledge bases (KBs) whose extensional part is manipulated by actions that possibly introduce new objects ...

In this paper we study verification of situation calculus action theories against first-order μ-calculus with quantification across situations. Specifically, we consider μL_a and μL_p, the two variants of μ-calculus introduced in the literature for ...