Ltlf synthesis as AND-OR graph search: Knowledge compilation at work
Synthesis techniques for temporal logic specifications are typically based on exploiting
symbolic techniques, as done in model checking. These symbolic techniques typically use …
symbolic techniques, as done in model checking. These symbolic techniques typically use …
LTLf synthesis on probabilistic systems
Many systems are naturally modeled as Markov Decision Processes (MDPs), combining
probabilities and strategic actions. Given a model of a system as an MDP and some logical …
probabilities and strategic actions. Given a model of a system as an MDP and some logical …
LTLƒ Synthesis with Fairness and Stability Assumptions
In synthesis, assumptions are constraints on the environment that rule out certain
environment behaviors. A key observation here is that even if we consider systems with LTL …
environment behaviors. A key observation here is that even if we consider systems with LTL …
Aligning data-aware declarative process models and event logs
Alignments are a conformance checking strategy quantifying the amount of deviations of a
trace with respect to a process model, as well as providing optimal repairs for making the …
trace with respect to a process model, as well as providing optimal repairs for making the …
A cerebellar operant conditioning-inspired constraint satisfaction approach for product design concept generation
Conceptual design is a pivotal stage of new product development. The function-behaviour-
structure framework is adopted in this stage to help designers search design space and …
structure framework is adopted in this stage to help designers search design space and …
[HTML][HTML] Quickening data-aware conformance checking through temporal algebras
A temporal model describes processes as a sequence of observable events characterised
by distinguishable actions in time. Conformance checking allows these models to determine …
by distinguishable actions in time. Conformance checking allows these models to determine …
On-the-fly synthesis for LTL over finite traces
We present a new synthesis framework based on the on-the-fly DFA construction for LTL
over finite traces (LTLf). Extant approaches rely heavily on the construction of the complete …
over finite traces (LTLf). Extant approaches rely heavily on the construction of the complete …
Model-checking legal contracts with symboleopc
Legal contracts specify requirements for business transactions. As any other requirements
specification, contracts may contain errors and violate properties expected by contracting …
specification, contracts may contain errors and violate properties expected by contracting …
Decidable Fragments of LTLf Modulo Theories
Abstract We study Linear Temporal Logic Modulo Theories over Finite Traces (LTL MT f), a
recently introduced extension of LTL over finite traces (LTL f) where propositions are …
recently introduced extension of LTL over finite traces (LTL f) where propositions are …
Forward LTLf synthesis: DPLL at work
M Favorito - arXiv preprint arXiv:2302.13825, 2023 - arxiv.org
This paper proposes a new AND-OR graph search framework for synthesis of Linear
Temporal Logic on finite traces (\LTLf), that overcomes some limitations of previous …
Temporal Logic on finite traces (\LTLf), that overcomes some limitations of previous …