Patrick Totzke
Has grant
Personal Chair
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
About
Patrick Totzke is a lecturer at the University of Liverpool, UK. His research interests include strategy complexity in stochastic games, reachability problems in vector addition systems, and satisfiability issues in hyperlogics. He has authored several recent articles that address key topics such as transience in countable Markov decision processes and resilient strategies in pushdown safety games.
Recent Grants
Grant: Open
Games for Good
Open Date: 2024-03-01
Close Date: 2027-02-28
Grant: Close
Below the Branches of Universal Trees
Open Date: 2023-03-01
Close Date: 2024-08-30
Grant: Close
COSTRA -- The Cost of Winning Strategies
Open Date: 2021-06-30
Close Date: 2024-06-29
Grant: Close
Unambiguity in Infinite-state Systems
Open Date: 2021-03-01
Close Date: 2023-02-01
Articles (17)
Year:
2026
Year:
2026
Year:
2026
Year:
2026
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace quantification. It is known that this expressiveness comes at a price, i.e. satisfiability is undecidable for both logics. In this paper we settle the exact complexity of these problems, showing that both are in fact highly undecidable: we prove that HyperLTL satisfiability is $\Sigma_1^1$-complete and HyperCTL* satisfiability is $\Sigma_1^2$-complete. These are significant increases over the previously known lower bounds and the first upper bounds. To prove $\Sigma_1^2$-membership for HyperCTL*, we prove that every satisfiable HyperCTL* sentence has a model that is equinumerous to the continuum, the first upper bound of this kind. We also prove this bound to be tight. Furthermore, we prove that both countable and finitely-branching satisfiability for HyperCTL* are as hard as truth in second-order arithmetic, i.e. still highly undecidable. Finally, we show that the membership problem for every level of the HyperLTL quantifier alternation hierarchy is $\Pi_1^1$-complete. Comment: arXiv admin note: substantial text overlap with arXiv:2105.04176
Year:
2025
We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of $$\varepsilon $$ ε -optimal (resp. optimal) strategies. These results depend on the size of the players’ action sets and on whether one requires strategies that are uniform (i.e., independent of the start state). Our main result is that $$\varepsilon $$ ε -optimal (resp. optimal) Maximizer strategies requires infinite memory if Minimizer is allowed infinite action sets. This lower bound holds even under very strong restrictions. Even in the special case of infinitely branching turn-based reachability games, even if all states allow an almost surely winning Maximizer strategy, strategies with a step counter plus finite private memory are still useless. Regarding uniformity , we show that for Maximizer there need not exist memoryless (i.e., positional) uniformly $$\varepsilon $$ ε -optimal strategies even in the special case of finite action sets or in finitely branching turn-based games. On the other hand, in games with finite action sets, there always exists a uniformly $$\varepsilon $$ ε -optimal Maximizer strategy that uses just one bit of public memory.
Year:
2025
Year:
2025
Year:
2025
Year:
2025
Year:
2023
Year:
2021
Year:
2021
Year:
2021
Year:
2020
Year:
2020
Year:
2020
Year:
2020
Collaborators (3)
Sougata Bose
University of Mons
Martin Zimmermann
Aalborg University
Louwe Kuijer
Lecturer
University of Liverpool
Make your next move.
Prepare your application
Review drafts before you send them.