no code implementations • 22 May 2024 • Raven Beutner, Bernd Finkbeiner
We show that for large fragments of HyperLTL, the resulting planning instance corresponds to a classical, FOND, or POND planning problem.
no code implementations • 15 Apr 2024 • Raven Beutner, Bernd Finkbeiner, Hadar Frenkel, Niklas Metzger
For the parallel model, we show that the monitoring of the second-order hyperproperties of Hyper$^2$LTL$_f$ can be reduced to monitoring first-order hyperproperties.
no code implementations • 20 Mar 2024 • Raven Beutner, Bernd Finkbeiner
In this paper, we present Hyper Strategy Logic (HyperSL), a strategy logic where the outcome of multiple strategy profiles can be compared w. r. t.
no code implementations • 19 Dec 2023 • Raven Beutner, Bernd Finkbeiner
However, while ATL$^*$ can reason about the strategic ability of agents (e. g., some coalition $A$ can ensure that a goal is reached eventually), we cannot compare multiple strategic interactions, nor can we require multiple agents to follow the same strategy.
no code implementations • 6 Apr 2022 • Raven Beutner, Luke Ong, Fabian Zaiser
We propose a new method to approximate the posterior distribution of probabilistic programs by means of computing guaranteed bounds.