Fixed-dimensional energy games are in pseudo-polynomial time
We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from
multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the …
multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the …
Nonelementary complexities for branching VASS, MELL, and extensions
We study the complexity of reachability problems on branching extensions of vector addition
systems, which allows us to derive new non-elementary complexity bounds for fragments …
systems, which allows us to derive new non-elementary complexity bounds for fragments …
State of the art in logics for verification of resource-bounded multi-agent systems
Approaches to the verification of multi-agent systems are typically based on games or
transition systems defined in terms of states and actions. However such approaches often …
transition systems defined in terms of states and actions. However such approaches often …
Alternating vector addition systems with states
JB Courtois, S Schmitz - International Symposium on Mathematical …, 2014 - Springer
Alternating vector addition systems are obtained by equip** vector addition systems with
states (VASS) with 'fork'rules, and provide a natural setting for infinite-arena games played …
states (VASS) with 'fork'rules, and provide a natural setting for infinite-arena games played …
Trade-off analysis meets probabilistic model checking
Probabilistic model checking (PMC) is a well-established and powerful method for the
automated quantitative analysis of parallel distributed systems. Classical PMC-approaches …
automated quantitative analysis of parallel distributed systems. Classical PMC-approaches …
[HTML][HTML] On the complexity of resource-bounded logics
We revisit decidability results for resource-bounded logics and use decision problems on
vector addition systems with states (VASS) in order to establish complexity characterisations …
vector addition systems with states (VASS) in order to establish complexity characterisations …
Weight monitoring with linear temporal logic: complexity and decidability
Many important performance and reliability measures can be formalized as the accumulated
values of weight functions. In this paper, we introduce an extension of linear time logic …
values of weight functions. In this paper, we introduce an extension of linear time logic …
Optimizing the expected mean payoff in energy Markov decision processes
Abstract Energy Markov Decision Processes (EMDPs) are finite-state Markov decision
processes where each transition is assigned an integer counter update and a rational …
processes where each transition is assigned an integer counter update and a rational …
Perfect half space games
We introduce perfect half space games, in which the goal of Player 2 is to make the sums of
encountered multi-dimensional weights diverge in a direction which is consistent with a …
encountered multi-dimensional weights diverge in a direction which is consistent with a …
Monotonic graphs for parity and mean-payoff games
P Ohlmann - 2021 - theses.hal.science
In a parity game, Eve and Adam take turns in moving a token along the edges of a directed
graph, which are labelled by integers called priorities. This interaction results in an infinite …
graph, which are labelled by integers called priorities. This interaction results in an infinite …