In this paper, we study synthesis from logical specifications over finite traces expressed in
LTLf and its extension LDLf. Specifically, in this form of synthesis, propositions are …

The declarative specification of business processes is based upon the elicitation of
behavioural rules that constrain the legal executions of the process. The carry-out of the …

Abstract In Markov Decision Processes (MDPs), the reward obtained in a state is Markovian,
ie, depends on the last state and action. This dependency makes it difficult to reward more …

Temporally extended goals are critical to the specification of a diversity of real-world
planning problems. Here we examine the problem of non-deterministic planning with …

Declarative process models define the behaviour of business processes as a set of
constraints. Declarative process discovery aims at inferring such constraints from event logs …

Abstract This paper studies Linear Temporal Logic over Finite Traces (LTLf) where
proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in …

In a variety of application domains,(business) processes are intrinsically uncertain.
Surprisingly, only very few languages and techniques in BPM consider uncertainty as a first …

We address the problem of model checking first-order dynamic systems where new objects
can be injected in the active domain during execution. Notable examples are systems …

Traditional business process modeling notations, including the standard Business Process
Model and Notation (BPMN), rely on an imperative paradigm wherein the process model …

Within the process mining field, Deterministic Finite State Automata (DFAs) are largely
employed as foundation mechanisms to perform formal reasoning tasks over the information …