Patrick Totzke

According to our database, Patrick Totzke authored at least 49 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

Dyn. Games Appl., July, 2025

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

Log. Methods Comput. Sci., 2025

Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Resolving Nondeterminism by Chance.

Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen

Proceedings of the 36th International Conference on Concurrency Theory, 2025

Temporal Explorability Games.

Pete Austin, Sougata Bose, Nicolas Mazzocchi, Patrick Totzke

Proceedings of the 36th International Conference on Concurrency Theory, 2025

2024

History-deterministic Timed Automata.

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke

Log. Methods Comput. Sci., 2024

Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

CoRR, 2024

Bounded-Memory Strategies in Partial-Information Games.

Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Parity Games on Temporal Graphs.

Pete Austin, Sougata Bose, Patrick Totzke

Proceedings of the Foundations of Software Science and Computation Structures, 2024

The Power of Counting Steps in Quantitative Games.

Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove

Proceedings of the 35th International Conference on Concurrency Theory, 2024

Memoryless Strategies in Stochastic Reachability Games.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Handling of Past and Future with Phenesthe+.

Manolis Pitsikalis, Alexei Lisitsa, Patrick Totzke

Proceedings of the Fourteenth International Symposium on Games, 2023

History-Deterministic Vector Addition Systems.

Sougata Bose, David Purser, Patrick Totzke

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Preface.

Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke

Fundam. Informaticae, 2022

History-Deterministic Timed Automata Are Not Determinizable.

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke

Proceedings of the Reachability Problems - 16th International Conference, 2022

Making Sense of Heterogeneous Maritime Data.

Manolis Pitsikalis, Alexei Lisitsa, Patrick Totzke, Simon Lee

Proceedings of the 23rd IEEE International Conference on Mobile Data Management, 2022

History-Deterministic Timed Automata.

Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

The Reachability Problem for Two-Dimensional Vector Addition Systems with States.

Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke

J. ACM, 2021

Report on BCTCS 2021.

Patrick Totzke, Michele Zito

Bull. EATCS, 2021

HyperLTL Satisfiability is Σ₁¹-complete, HyperCTL* Satisfiability is Σ₁²-complete.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

CoRR, 2021

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP.

Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak

Proceedings of the Foundations of Software Science and Computation Structures, 2021

Transience in Countable MDPs.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Optimally Resilient Strategies in Pushdown Safety Games.

Daniel Neider, Patrick Totzke, Martin Zimmermann

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

How to Play in Infinite MDPs (Invited Talk).

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Strategy Complexity of Parity Objectives in Countable MDPs.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Parametrized Universality Problems for One-Counter Nets.

Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Controlling a Random Population is EXPTIME-hard.

Corto Mascle, Mahsa Shirmohammadi, Patrick Totzke

CoRR, 2019

Büchi Objectives in Countable MDPs.

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Timed Basic Parallel Processes.

Lorenzo Clemente, Piotr Hofman, Patrick Totzke

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Universal Safety for Timed Petri Nets is PSPACE-complete.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

MDPs with energy-parity objectives.

Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Linear combinations of unordered data vectors.

Piotr Hofman, Jérôme Leroux, Patrick Totzke

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

What Makes Petri Nets Harder to Verify: Stack or Data?

Ranko Lazic, Patrick Totzke

Proceedings of the Concurrency, Security, and Puzzles, 2017

2016

Simulation Problems Over One-Counter Nets.

Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke

Log. Methods Comput. Sci., 2016

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.

Matthias Englert, Ranko Lazic, Patrick Totzke

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.

Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Coverability Trees for Petri Nets with Unordered Data.

Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

On Boundedness Problems for Pushdown Vector Addition Systems.

Jérôme Leroux, Grégoire Sutre, Patrick Totzke

Proceedings of the Reachability Problems - 9th International Workshop, 2015

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.

Jérôme Leroux, Grégoire Sutre, Patrick Totzke

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Inclusion problems for one-counter systems.

Patrick Totzke

PhD thesis, 2014

Trace Inclusion for One-Counter Nets Revisited.

Piotr Hofman, Patrick Totzke

Proceedings of the Reachability Problems - 8th International Workshop, 2014

Infinite-state energy games.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Branching-Time Model Checking Gap-Order Constraint Systems.

Richard Mayr, Patrick Totzke

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Decidability of Weak Simulation on One-Counter Nets.

Piotr Hofman, Richard Mayr, Patrick Totzke

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Simulation Over One-counter Nets is PSPACE-Complete.

Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Approximating Weak Bisimilarity of Basic Parallel Processes

Piotr Hofman, Patrick Totzke

Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

2009

Properties of Multiset Language Classes Defined by Multiset Pushdown Automata.

Manfred Kudlek, Patrick Totzke, Georg Zetzsche

Fundam. Informaticae, 2009

Multiset Pushdown Automata.

Manfred Kudlek, Patrick Totzke, Georg Zetzsche

Fundam. Informaticae, 2009