Multiset Pushdown Automata. - Manfred Kudlek; Patrick Totzke; Georg Zetzsche (Fundam. Informaticae, 2009)

Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. - Manfred Kudlek; Patrick Totzke; Georg Zetzsche (Fundam. Informaticae, 2009)

Approximating Weak Bisimilarity of Basic Parallel Processes - Piotr Hofman; Patrick Totzke (EXPRESS/SOS, 2012)

Simulation Over One-counter Nets is PSPACE-Complete. - Piotr Hofman; Slawomir Lasota 001; Richard Mayr; Patrick Totzke (FSTTCS, 2013)

Decidability of Weak Simulation on One-Counter Nets. - Piotr Hofman; Richard Mayr; Patrick Totzke (LICS, 2013)

Infinite-state energy games. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Piotr Hofman; Richard Mayr; K. Narayan Kumar; Patrick Totzke (CSL-LICS, 2014)

Inclusion problems for one-counter systems. - Patrick Totzke (2014)

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. - Jérôme Leroux; Grégoire Sutre; Patrick Totzke (ICALP (2), 2015)

On Boundedness Problems for Pushdown Vector Addition Systems. - Jérôme Leroux; Grégoire Sutre; Patrick Totzke (RP, 2015)

Coverability Trees for Petri Nets with Unordered Data. - Piotr Hofman; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Sylvain Schmitz; Patrick Totzke (FoSSaCS, 2016)

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. - Stefan Göller; Christoph Haase; Ranko Lazic 001; Patrick Totzke (ICALP, 2016)

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. - Matthias Englert; Ranko Lazic 001; Patrick Totzke (LICS, 2016)

Simulation Problems Over One-Counter Nets. - Piotr Hofman; Slawomir Lasota 001; Richard Mayr; Patrick Totzke (Log. Methods Comput. Sci., 2016)

Branching-Time Model Checking Gap-Order Constraint Systems. - Richard Mayr; Patrick Totzke (Fundam. Informaticae, 2016)

What Makes Petri Nets Harder to Verify: Stack or Data? - Ranko Lazic 001; Patrick Totzke (Concurrency, Security, and Puzzles, 2017)

Linear combinations of unordered data vectors. - Piotr Hofman; Jérôme Leroux; Patrick Totzke (LICS, 2017)

MDPs with energy-parity objectives. - Richard Mayr; Sven Schewe; Patrick Totzke; Dominik Wojtczak (LICS, 2017)

Universal Safety for Timed Petri Nets is PSPACE-complete. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Radu Ciobanu; Richard Mayr; Patrick Totzke (CONCUR, 2018)

Trace inclusion for one-counter nets revisited. - Piotr Hofman; Patrick Totzke (Theor. Comput. Sci., 2018)

Timed Basic Parallel Processes. - Lorenzo Clemente; Piotr Hofman; Patrick Totzke (CONCUR, 2019)

Büchi Objectives in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (ICALP, 2019)

Controlling a Random Population is EXPTIME-hard. - Corto Mascle; Mahsa Shirmohammadi; Patrick Totzke (CoRR, 2019)

Parametrized Universality Problems for One-Counter Nets. - Shaull Almagor; Udi Boker; Piotr Hofman; Patrick Totzke (CONCUR, 2020)

Strategy Complexity of Parity Objectives in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CONCUR, 2020)

How to Play in Infinite MDPs (Invited Talk). - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke; Dominik Wojtczak (ICALP, 2020)

Optimally Resilient Strategies in Pushdown Safety Games. - Daniel Neider; Patrick Totzke; Martin Zimmermann 002 (MFCS, 2020)

Transience in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CONCUR, 2021)

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. - Richard Mayr; Sven Schewe; Patrick Totzke; Dominik Wojtczak (FoSSaCS, 2021)

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (MFCS, 2021)

HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (CoRR, 2021)

Report on BCTCS 2021. - Patrick Totzke; Michele Zito 001 (Bull. EATCS, 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 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

History-Deterministic Timed Automata. - Thomas A. Henzinger; Karoliina Lehtinen; Patrick Totzke (CONCUR, 2022)

Making Sense of Heterogeneous Maritime Data. - Manolis Pitsikalis; Alexei Lisitsa 001; Patrick Totzke; Simon Lee (MDM, 2022)

History-Deterministic Timed Automata Are Not Determinizable. - Sougata Bose; Thomas A. Henzinger; Karoliina Lehtinen; Sven Schewe; Patrick Totzke (RP, 2022)

Preface. - Paul C. Bell; Igor Potapov; Sylvain Schmitz; Patrick Totzke (Fundam. Informaticae, 2022)

History-Deterministic Vector Addition Systems. - Sougata Bose; David Purser; Patrick Totzke (CONCUR, 2023)

Handling of Past and Future with Phenesthe+. - Manolis Pitsikalis; Alexei Lisitsa 001; Patrick Totzke (GandALF, 2023)

Memoryless Strategies in Stochastic Reachability Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (Taming the Infinities of Concurrency, 2024)

The Power of Counting Steps in Quantitative Games. - Sougata Bose; Rasmus Ibsen-Jensen; David Purser; Patrick Totzke; Pierre Vandenhove (CONCUR, 2024)

Parity Games on Temporal Graphs. - Pete Austin; Sougata Bose; Patrick Totzke (FoSSaCS (1), 2024)

Bounded-Memory Strategies in Partial-Information Games. - Sougata Bose; Rasmus Ibsen-Jensen; Patrick Totzke (LICS, 2024)

Strategy Complexity of B "uchi Objectives in Concurrent Stochastic Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CoRR, 2024)

History-deterministic Timed Automata. - Sougata Bose; Thomas A. Henzinger; Karoliina Lehtinen; Sven Schewe; Patrick Totzke (Log. Methods Comput. Sci., 2024)

Temporal Explorability Games. - Pete Austin; Sougata Bose; Nicolas Mazzocchi; Patrick Totzke (CONCUR, 2025)

Resolving Nondeterminism by Chance. - Soumyajit Paul; David Purser; Sven Schewe; Qiyi Tang 001; Patrick Totzke; Di-De Yen (CONCUR, 2025)

Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (EC, 2025)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2025)

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (Dyn. Games Appl., 2025)