activity
20052023
most citedStochastic Timed Automata

52 citations · 217 across the 36 of their papers we have counts for

collaborators
Showing 2021Show all

9 papers · 1 filter

cs.LO2021★ 1 cited

Witnessing Subsystems for Probabilistic Systems with Low Tree Width

Simon Jantsch, Jakob Piribauer, Christel Baier

A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. Computi…

cs.LO2021

Witnessing subsystems for probabilistic systems with low tree width

Simon Jantsch, Jakob Piribauer, Christel Baier

A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. Computi…

cs.FL2021

Determinization and Limit-determinization of Emerson-Lei automata

Tobias John, Simon Jantsch, Christel Baier +1

We study the problem of determinizing -automata whose acceptance condition is defined on the transitions using Boolean formulas, also known as transition-based Emerson-Lei autom…

cs.LO2021

Causality-Based Game Solving

Christel Baier, Norine Coenen, Bernd Finkbeiner +3

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 pro…

cs.LO2021★ 4 cited

From Verification to Causality-based Explications

Christel Baier, Clemens Dubslaff, Florian Funke +4

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 verifyin…

cs.GT2021

A Game-Theoretic Account of Responsibility Allocation

Christel Baier, Florian Funke, Rupak Majumdar

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 behavior…