Patrick Totzke

Patrick Totzke is a theoretical computer scientist at the University of Liverpool's Department of Computer Science. His research focuses on mathematical models of computation, formal verification, and the complexity of strategies in stochastic and temporal games.

• University of Liverpool (2018–present)
• Postdoctoral positions: LFCS Edinburgh (2016–2018), University of Warwick (2015), LaBRI Bordeaux (2014)

Research Interests include automata theory, game theory, computational logic, and computer-aided verification. Recent work emphasizes history-deterministic systems, timed automata, and decision problems in infinite-state games.

Key Publications (2024–2025) explore temporal graph explorability (PSPACE-complete), stochastic nondeterminism resolution (undecidability in NFAs), and bounded-memory strategies in partial-information games. Earlier works address energy-parity objectives (NP∩coNP) and the reachability problem in 2D vector addition systems (NL-complete).

Awards

• Shortlisted for Teacher of the Year (2021)
• PI on EPSRC-funded project (2021)
• Co-PI on Royal Society grant (2021)

Collaborations include Richard Mayr, Stefan Kiefer, Mahsa Shirmohammadi, and Sougata Bose (postdoc, 2021). He co-chaired Reachability Problems (RP'21) and contributes to open-source tools like alot and LaTeX beamer themes.