# Temporal Logics Over Finite Traces with Uncertainty (Technical Report)

arXiv: https://arxiv.org/abs/1903.04940 · HTML: https://mlsanity.com/paper/1903.04940/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Mar 2019.

## Built on by (most cited first, 3 of 3)

- [Enjoy the Silence: Analysis of Stochastic Petri Nets with Silent Transitions](https://mlsanity.com/paper/2306.06376/) (2023)
- [Measuring Rule-based LTLf Process Specifications: A Probabilistic Data-driven Approach](https://mlsanity.com/paper/2305.05418/) (2023)
- [Enumerating Minimal Unsatisfiable Cores of LTLf formulas](https://mlsanity.com/paper/2409.09485/) (2024)

## Abstract (arXiv)

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of uncertainty which cannot be handled with classical logics. We thus propose a new probabilistic temporal logic over finite traces using superposition semantics, where all possible evolutions are possible, until observed. We study the properties of the logic and provide automata-based mechanisms for deriving probabilistic inferences from its formulas. We then study a fragment of the logic with better computational properties. Notably, formulas in this fragment can be discovered from event log data using off-the-shelf existing declarative process discovery techniques.