Patrick Totzke

83 papers A* 9B 15Journal 45Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	History-Constrained Systems. CoRR Louwe B. Kuijer, David Purser, Henry Sinclair-Banks, Patrick Totzke
2025	J	`jnl`	HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^* is Even Harder. Log. Methods Comput. Sci. Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2025	J	`jnl`	Optimal Sequential Flows. CoRR Hugo Gimbert, Corto Mascle, Patrick Totzke
2025	B	`conf`	Resolving Nondeterminism by Chance. CONCUR Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen
2025	J	`jnl`	Resolving Nondeterminism by Chance. CoRR Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen
2025	A*	`conf`	Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games. EC Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2025	J	`jnl`	Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. Dyn. Games Appl. Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2025	B	`conf`	Temporal Explorability Games. CONCUR Pete Austin, Sougata Bose, Nicolas Mazzocchi, Patrick Totzke
2024	A*	`conf`	Bounded-Memory Strategies in Partial-Information Games. LICS Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
2024	J	`jnl`	Bounded-Memory Strategies in Partial-Information Games. CoRR Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
2024	J	`jnl`	History-deterministic Timed Automata. Log. Methods Comput. Sci. Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
2024	—	`conf`	Memoryless Strategies in Stochastic Reachability Games. Taming the Infinities of Concurrency Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024	J	`jnl`	Memoryless Strategies in Stochastic Reachability Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024	—	`conf`	Parity Games on Temporal Graphs. FoSSaCS (1) Pete Austin, Sougata Bose, Patrick Totzke
2024	J	`jnl`	Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024	J	`jnl`	Temporal Explorability Games. CoRR Pete Austin, Nicolas Mazzocchi, Sougata Bose, Patrick Totzke
2024	B	`conf`	The Power of Counting Steps in Quantitative Games. CONCUR Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove
2024	J	`jnl`	The Power of Counting Steps in Quantitative Games. CoRR Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove
2023	—	`conf`	Handling of Past and Future with Phenesthe+. GandALF Manolis Pitsikalis, Alexei Lisitsa, Patrick Totzke
2023	B	`conf`	History-Deterministic Vector Addition Systems. CONCUR Sougata Bose, David Purser, Patrick Totzke
2023	J	`jnl`	History-deterministic Timed Automata. CoRR Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
2023	J	`jnl`	History-deterministic Vector Addition Systems. CoRR Sougata Bose, David Purser, Patrick Totzke
2023	J	`jnl`	HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2023	J	`jnl`	Parity Games on Temporal Graphs. CoRR Pete Austin, Sougata Bose, Patrick Totzke
2022	—	`conf`	History-Deterministic Timed Automata Are Not Determinizable. RP Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
2022	B	`conf`	History-Deterministic Timed Automata. CONCUR Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke
2022	B	`conf`	Making Sense of Heterogeneous Maritime Data. MDM Manolis Pitsikalis, Alexei Lisitsa, Patrick Totzke, Simon Lee
2022	J	`jnl`	Preface. Fundam. Informaticae Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
2022	J	`jnl`	Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2021	B	`conf`	HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2021	J	`jnl`	HyperLTL Satisfiability is Σ CoRR Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2021	—	`ed.`	Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings RP Paul C. Bell, Patrick Totzke, Igor Potapov
2021	J	`jnl`	Report on BCTCS 2021. Bull. EATCS Patrick Totzke, Michele Zito
2021	B	`conf`	Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FoSSaCS Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2021	J	`jnl`	Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. CoRR Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2021	J	`jnl`	The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
2021	B	`conf`	Transience in Countable MDPs. CONCUR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020	A*	`conf`	How to Play in Infinite MDPs (Invited Talk). ICALP Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak
2020	B	`conf`	Optimally Resilient Strategies in Pushdown Safety Games. MFCS Daniel Neider, Patrick Totzke, Martin Zimmermann
2020	B	`conf`	Parametrized Universality Problems for One-Counter Nets. CONCUR Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
2020	J	`jnl`	Parametrized Universality Problems for One-Counter Nets. CoRR Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
2020	B	`conf`	Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020	J	`jnl`	Strategy Complexity of Parity Objectives in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020	J	`jnl`	Transience in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019	A*	`conf`	Büchi Objectives in Countable MDPs. ICALP Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019	J	`jnl`	Büchi Objectives in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019	J	`jnl`	Controlling a Random Population is EXPTIME-hard. CoRR Corto Mascle, Mahsa Shirmohammadi, Patrick Totzke
2019	J	`jnl`	Optimally Resilient Strategies in Pushdown Safety Games. CoRR Daniel Neider, Patrick Totzke, Martin Zimmermann
2019	B	`conf`	Timed Basic Parallel Processes. CONCUR Lorenzo Clemente, Piotr Hofman, Patrick Totzke
2019	J	`jnl`	Timed Basic Parallel Processes. CoRR Lorenzo Clemente, Piotr Hofman, Patrick Totzke
2018	J	`jnl`	Trace inclusion for one-counter nets revisited. Theor. Comput. Sci. Piotr Hofman, Patrick Totzke
2018	B	`conf`	Universal Safety for Timed Petri Nets is PSPACE-complete. CONCUR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
2018	J	`jnl`	Universal Safety for Timed Petri Nets is PSPACE-complete. CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
2017	A*	`conf`	Linear combinations of unordered data vectors. LICS Piotr Hofman, Jérôme Leroux, Patrick Totzke
2017	J	`jnl`	MDPs with Energy-Parity Objectives. CoRR Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017	A*	`conf`	MDPs with energy-parity objectives. LICS Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017	—	`conf`	What Makes Petri Nets Harder to Verify: Stack or Data? Concurrency, Security, and Puzzles Ranko Lazic, Patrick Totzke
2016	A*	`conf`	A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
2016	J	`jnl`	A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
2016	J	`jnl`	Branching-Time Model Checking Gap-Order Constraint Systems. Fundam. Informaticae Richard Mayr, Patrick Totzke
2016	B	`conf`	Coverability Trees for Petri Nets with Unordered Data. FoSSaCS Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
2016	J	`jnl`	Linear Combinations of Unordered Data Vectors. CoRR Piotr Hofman, Jérôme Leroux, Patrick Totzke
2016	A*	`conf`	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. LICS Matthias Englert, Ranko Lazic, Patrick Totzke
2016	J	`jnl`	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. CoRR Matthias Englert, Ranko Lazic, Patrick Totzke
2016	J	`jnl`	Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2015	—	`conf`	On Boundedness Problems for Pushdown Vector Addition Systems. RP Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015	J	`jnl`	On Boundedness Problems for Pushdown Vector Addition Systems. CoRR Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015	—	`conf`	On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ICALP (2) Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015	J	`jnl`	On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. CoRR Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2014	—	`—`	Inclusion problems for one-counter systems. Patrick Totzke
2014	J	`jnl`	Infinite-State Energy Games. CoRR Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014	—	`conf`	Infinite-state energy games. CSL-LICS Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014	—	`conf`	Trace Inclusion for One-Counter Nets Revisited. RP Piotr Hofman, Patrick Totzke
2014	J	`jnl`	Trace Inclusion for One-Counter Nets Revisited. CoRR Piotr Hofman, Patrick Totzke
2013	—	`conf`	Branching-Time Model Checking Gap-Order Constraint Systems. RP Richard Mayr, Patrick Totzke
2013	J	`jnl`	Branching-Time Model Checking Gap-Order Constraint Systems. CoRR Richard Mayr, Patrick Totzke
2013	A*	`conf`	Decidability of Weak Simulation on One-Counter Nets. LICS Piotr Hofman, Richard Mayr, Patrick Totzke
2013	J	`jnl`	Decidability of Weak Simulation on One-counter Nets CoRR Piotr Hofman, Richard Mayr, Patrick Totzke
2013	—	`conf`	Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2013	J	`jnl`	Simulation Over One-counter Nets is PSPACE-Complete. CoRR Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2012	—	`conf`	Approximating Weak Bisimilarity of Basic Parallel Processes EXPRESS/SOS Piotr Hofman, Patrick Totzke
2009	J	`jnl`	Multiset Pushdown Automata. Fundam. Informaticae Manfred Kudlek, Patrick Totzke, Georg Zetzsche
2009	J	`jnl`	Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. Fundam. Informaticae Manfred Kudlek, Patrick Totzke, Georg Zetzsche