Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Funke, Florian"'
By combining two of the central paradigms of causality, namely counterfactual reasoning and probability-raising,we introduce a probabilistic notion of cause in Markov chains. Such a cause consists of finite executions of the probabilistic system afte
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A89234
https://tud.qucosa.de/api/qucosa%3A89234/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A89234/attachment/ATT-0/
The purpose of this paper is to introduce a notion of causality in Markov decision processes based on the probability-raising principle and to analyze its algorithmic properties. The latter includes algorithms for checking cause-effect relationships
Externí odkaz:
http://arxiv.org/abs/2201.08768
Autor:
Baier, Christel, Coenen, Norine, Finkbeiner, Bernd, Funke, Florian, Jantsch, Simon, Siber, Julian
We present a causality-based algorithm for solving two-player reachability games represented by logical constraints. These games are a useful formalism to model a wide array of problems arising, e.g., in program synthesis. Our technique for solving t
Externí odkaz:
http://arxiv.org/abs/2105.14247
Autor:
Baier, Christel, Dubslaff, Clemens, Funke, Florian, Jantsch, Simon, Majumdar, Rupak, Piribauer, Jakob, Ziemek, Robin
In view of the growing complexity of modern software architectures, formal models are increasingly used to understand why a system works the way it does, opposed to simply verifying that it behaves as intended. This paper surveys approaches to formal
Externí odkaz:
http://arxiv.org/abs/2105.09533
When designing or analyzing multi-agent systems, a fundamental problem is responsibility ascription: to specify which agents are responsible for the joint outcome of their behaviors and to which extent. We model strategic multi-agent interaction as a
Externí odkaz:
http://arxiv.org/abs/2105.09129
The paper studies a probabilistic notion of causes in Markov chains that relies on the counterfactuality principle and the probability-raising property. This notion is motivated by the use of causes for monitoring purposes where the aim is to detect
Externí odkaz:
http://arxiv.org/abs/2104.13604
Autor:
Baier, Christel, Funke, Florian, Jantsch, Simon, Karimov, Toghrul, Lefaucheux, Engel, Luca, Florian, Ouaknine, Joël, Purser, David, Whiteland, Markus A., Worrell, James
We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical systems. We show decidability in the case of one parameter and Skolem-hardness with two or more parameters. More precisely, consider a $d$-dimensional square matrix
Externí odkaz:
http://arxiv.org/abs/2104.10634
We aim at measuring the influence of the nondeterministic choices of a part of a system on its ability to satisfy a specification. For this purpose, we apply the concept of Shapley values to verification as a means to evaluate how important a part of
Externí odkaz:
http://arxiv.org/abs/2102.06655
Autor:
Baier, Christel, Funke, Florian, Jantsch, Simon, Karimov, Toghrul, Lefaucheux, Engel, Ouaknine, Joël, Pouly, Amaury, Purser, David, Whiteland, Markus A.
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a matrix $M \in \mathbb{Q}^{d \times d}$, an initial vector $x\in\mathb
Externí odkaz:
http://arxiv.org/abs/2009.13353
Witnessing subsystems for probabilistic reachability thresholds in discrete Markovian models are an important concept both as diagnostic information on why a property holds, and as input to refinement algorithms. We present SWITSS, a tool for the com
Externí odkaz:
http://arxiv.org/abs/2008.04049