


default search action
Patrick Totzke
Person information
- affiliation: University of Liverpool, UK
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder. Log. Methods Comput. Sci. 21(1): 3 (2025) - 2024
- [j9]Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke:
History-deterministic Timed Automata. Log. Methods Comput. Sci. 20(4) (2024) - [c33]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Memoryless Strategies in Stochastic Reachability Games. Taming the Infinities of Concurrency 2024: 225-242 - [c32]Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke
, Pierre Vandenhove
:
The Power of Counting Steps in Quantitative Games. CONCUR 2024: 13:1-13:18 - [c31]Pete Austin
, Sougata Bose
, Patrick Totzke
:
Parity Games on Temporal Graphs. FoSSaCS (1) 2024: 79-98 - [c30]Sougata Bose
, Rasmus Ibsen-Jensen
, Patrick Totzke
:
Bounded-Memory Strategies in Partial-Information Games. LICS 2024: 17:1-17:14 - [i31]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Memoryless Strategies in Stochastic Reachability Games. CoRR abs/2401.13390 (2024) - [i30]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games. CoRR abs/2404.15483 (2024) - [i29]Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
:
Bounded-Memory Strategies in Partial-Information Games. CoRR abs/2405.09406 (2024) - [i28]Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke
, Pierre Vandenhove:
The Power of Counting Steps in Quantitative Games. CoRR abs/2406.17482 (2024) - [i27]Pete Austin, Nicolas Mazzocchi, Sougata Bose, Patrick Totzke:
Temporal Explorability Games. CoRR abs/2412.16328 (2024) - 2023
- [c29]Sougata Bose, David Purser, Patrick Totzke
:
History-Deterministic Vector Addition Systems. CONCUR 2023: 18:1-18:17 - [c28]Manolis Pitsikalis
, Alexei Lisitsa, Patrick Totzke
:
Handling of Past and Future with Phenesthe+. GandALF 2023: 33-49 - [i26]Marie Fortin, Louwe B. Kuijer, Patrick Totzke
, Martin Zimmermann:
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR abs/2303.16699 (2023) - [i25]Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
:
History-deterministic Timed Automata. CoRR abs/2304.03183 (2023) - [i24]Sougata Bose, David Purser, Patrick Totzke
:
History-deterministic Vector Addition Systems. CoRR abs/2305.01981 (2023) - [i23]Pete Austin, Sougata Bose, Patrick Totzke
:
Parity Games on Temporal Graphs. CoRR abs/2310.12701 (2023) - 2022
- [j8]Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
:
Preface. Fundam. Informaticae 189(3-4) (2022) - [c27]Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke
:
History-Deterministic Timed Automata. CONCUR 2022: 14:1-14:21 - [c26]Manolis Pitsikalis
, Alexei Lisitsa, Patrick Totzke
, Simon Lee:
Making Sense of Heterogeneous Maritime Data. MDM 2022: 401-406 - [c25]Sougata Bose
, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
:
History-Deterministic Timed Automata Are Not Determinizable. RP 2022: 67-76 - [i22]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR abs/2203.12024 (2022) - 2021
- [j7]Patrick Totzke, Michele Zito:
Report on BCTCS 2021. Bull. EATCS 134 (2021) - [j6]Michael Blondin
, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
:
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68(5): 34:1-34:43 (2021) - [c24]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Transience in Countable MDPs. CONCUR 2021: 11:1-11:15 - [c23]Richard Mayr, Sven Schewe
, Patrick Totzke
, Dominik Wojtczak
:
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FoSSaCS 2021: 427-447 - [c22]Marie Fortin, Louwe B. Kuijer, Patrick Totzke
, Martin Zimmermann
:
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS 2021: 47:1-47:19 - [e1]Paul C. Bell
, Patrick Totzke
, Igor Potapov
:
Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings. Lecture Notes in Computer Science 13035, Springer 2021, ISBN 978-3-030-89715-4 [contents] - [i21]Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. CoRR abs/2101.06989 (2021) - [i20]Marie Fortin, Louwe B. Kuijer, Patrick Totzke
, Martin Zimmermann:
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. CoRR abs/2105.04176 (2021) - 2020
- [c21]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR 2020: 39:1-39:17 - [c20]Shaull Almagor
, Udi Boker, Piotr Hofman
, Patrick Totzke
:
Parametrized Universality Problems for One-Counter Nets. CONCUR 2020: 47:1-47:16 - [c19]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
, Dominik Wojtczak
:
How to Play in Infinite MDPs (Invited Talk). ICALP 2020: 3:1-3:18 - [c18]Daniel Neider
, Patrick Totzke
, Martin Zimmermann
:
Optimally Resilient Strategies in Pushdown Safety Games. MFCS 2020: 74:1-74:15 - [i19]Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CoRR abs/2005.03435 (2020) - [i18]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CoRR abs/2007.05065 (2020) - [i17]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. CoRR abs/2012.13739 (2020)
2010 – 2019
- 2019
- [c17]Lorenzo Clemente
, Piotr Hofman
, Patrick Totzke
:
Timed Basic Parallel Processes. CONCUR 2019: 15:1-15:16 - [c16]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Büchi Objectives in Countable MDPs. ICALP 2019: 119:1-119:14 - [i16]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. CoRR abs/1904.11573 (2019) - [i15]Lorenzo Clemente, Piotr Hofman, Patrick Totzke:
Timed Basic Parallel Processes. CoRR abs/1907.01240 (2019) - [i14]Corto Mascle, Mahsa Shirmohammadi, Patrick Totzke:
Controlling a Random Population is EXPTIME-hard. CoRR abs/1909.06420 (2019) - [i13]Daniel Neider, Patrick Totzke, Martin Zimmermann:
Optimally Resilient Strategies in Pushdown Safety Games. CoRR abs/1912.04771 (2019) - 2018
- [j5]Piotr Hofman
, Patrick Totzke
:
Trace inclusion for one-counter nets revisited. Theor. Comput. Sci. 735: 50-63 (2018) - [c15]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
:
Universal Safety for Timed Petri Nets is PSPACE-complete. CONCUR 2018: 6:1-6:15 - [i12]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke:
Universal Safety for Timed Petri Nets is PSPACE-complete. CoRR abs/1806.08170 (2018) - 2017
- [c14]Ranko Lazic, Patrick Totzke
:
What Makes Petri Nets Harder to Verify: Stack or Data? Concurrency, Security, and Puzzles 2017: 144-161 - [c13]Piotr Hofman
, Jérôme Leroux, Patrick Totzke
:
Linear combinations of unordered data vectors. LICS 2017: 1-11 - [c12]Richard Mayr, Sven Schewe
, Patrick Totzke
, Dominik Wojtczak
:
MDPs with energy-parity objectives. LICS 2017: 1-12 - [i11]Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
:
MDPs with Energy-Parity Objectives. CoRR abs/1701.02546 (2017) - 2016
- [j4]Piotr Hofman, Slawomir Lasota
, Richard Mayr, Patrick Totzke
:
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12(1) (2016) - [j3]Richard Mayr, Patrick Totzke
:
Branching-Time Model Checking Gap-Order Constraint Systems. Fundam. Informaticae 143(3-4): 339-353 (2016) - [c11]Piotr Hofman
, Slawomir Lasota
, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz
, Patrick Totzke
:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - [c10]Stefan Göller, Christoph Haase
, Ranko Lazic, Patrick Totzke
:
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP 2016: 105:1-105:13 - [c9]Matthias Englert, Ranko Lazic, Patrick Totzke
:
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. LICS 2016: 477-484 - [i10]Matthias Englert, Ranko Lazic, Patrick Totzke:
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. CoRR abs/1602.00477 (2016) - [i9]Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke:
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR abs/1602.05547 (2016) - [i8]Piotr Hofman, Jérôme Leroux, Patrick Totzke:
Linear Combinations of Unordered Data Vectors. CoRR abs/1610.01470 (2016) - 2015
- [c8]Jérôme Leroux, Grégoire Sutre, Patrick Totzke
:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ICALP (2) 2015: 324-336 - [c7]Jérôme Leroux, Grégoire Sutre, Patrick Totzke
:
On Boundedness Problems for Pushdown Vector Addition Systems. RP 2015: 101-113 - [i7]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. CoRR abs/1503.04018 (2015) - [i6]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On Boundedness Problems for Pushdown Vector Addition Systems. CoRR abs/1507.07362 (2015) - 2014
- [b1]Patrick Totzke:
Inclusion problems for one-counter systems. University of Edinburgh, UK, 2014 - [c6]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman
, Richard Mayr, K. Narayan Kumar, Patrick Totzke
:
Infinite-state energy games. CSL-LICS 2014: 7:1-7:10 - [c5]Piotr Hofman
, Patrick Totzke
:
Trace Inclusion for One-Counter Nets Revisited. RP 2014: 151-162 - [i5]Piotr Hofman, Patrick Totzke:
Trace Inclusion for One-Counter Nets Revisited. CoRR abs/1404.5157 (2014) - [i4]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-State Energy Games. CoRR abs/1405.0628 (2014) - 2013
- [c4]Piotr Hofman, Slawomir Lasota
, Richard Mayr, Patrick Totzke
:
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS 2013: 515-526 - [c3]Piotr Hofman
, Richard Mayr, Patrick Totzke
:
Decidability of Weak Simulation on One-Counter Nets. LICS 2013: 203-212 - [c2]Richard Mayr, Patrick Totzke
:
Branching-Time Model Checking Gap-Order Constraint Systems. RP 2013: 171-182 - [i3]Piotr Hofman, Richard Mayr, Patrick Totzke:
Decidability of Weak Simulation on One-counter Nets. CoRR abs/1304.4104 (2013) - [i2]Richard Mayr, Patrick Totzke:
Branching-Time Model Checking Gap-Order Constraint Systems. CoRR abs/1307.4207 (2013) - [i1]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. CoRR abs/1310.6303 (2013) - 2012
- [c1]Piotr Hofman
, Patrick Totzke
:
Approximating Weak Bisimilarity of Basic Parallel Processes. EXPRESS/SOS 2012: 99-113
2000 – 2009
- 2009
- [j2]Manfred Kudlek, Patrick Totzke
, Georg Zetzsche
:
Multiset Pushdown Automata. Fundam. Informaticae 93(1-3): 221-233 (2009) - [j1]Manfred Kudlek, Patrick Totzke
, Georg Zetzsche
:
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. Fundam. Informaticae 93(1-3): 235-244 (2009)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint