Skip to main content
Patrick Totzke

Professor Patrick Totzke


Computer Science
Part of
School of Electrical Engineering, Electronics and Computer Science
Faculty of Science and Engineering

Contact

totzke@liverpool.ac.uk

https://cgi.csc.liv.ac.uk/~patrick/

+44 (0)151 795 4256

Publications

Selected publications

  1. Büchi Objectives in Countable MDPs (Conference Paper - 2019)
  2. Linear combinations of unordered data vectors (Conference Paper - 2017)
  3. MDPs with energy-parity objectives (Conference Paper - 2017)
  4. Simulation Problems Over One-Counter Nets (Journal article - 2016)
  5. Bounded-Memory Strategies in Partial-Information Games (Conference Paper - 2024)
  6. Memoryless Strategies in Stochastic Reachability Games (Chapter - 2024)
  7. Parity Games on Temporal Graphs (Chapter - 2024)
  8. The Reachability Problem for Two-Dimensional Vector Addition Systems with States (Journal article - 2021)
  9. HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ21-complete (Conference Paper - 2021)
What type of publication do you want to show?

2024

Memoryless Strategies in Stochastic Reachability Games

Kiefer, S., Mayr, R., Shirmohammadi, M., & Totzke, P. (2024). Memoryless Strategies in Stochastic Reachability Games. In Lecture Notes in Computer Science (pp. 225-242). Springer Nature Switzerland. doi:10.1007/978-3-031-56222-8_13

DOI
10.1007/978-3-031-56222-8_13
Chapter

2023

Preface

Bell, P. C., Potapov, I., Schmitz, S., & Totzke, P. (2023). Preface. Fundamenta Informaticae, 189(3-4), i-iii. doi:10.3233/fi-222158

DOI
10.3233/fi-222158
Journal article

Handling of Past and Future with Phenesthe+

Pitsikalis, M., Lisitsa, A., & Totzke, P. (n.d.). Handling of Past and Future with Phenesthe+. In Electronic Proceedings in Theoretical Computer Science Vol. 390 (pp. 33-49). Open Publishing Association. doi:10.4204/eptcs.390.3

DOI
10.4204/eptcs.390.3
Conference Paper

2022

Preface.

Bell, P. C., Potapov, I., Schmitz, S., & Totzke, P. (2022). Preface.. Fundam. Informaticae, 189.

Journal article

2021

HyperLTL Satisfiability is $\Sigma_1^1$-complete, HyperCTL* Satisfiability is $\Sigma_1^2$-complete

DOI
10.48550/arxiv.2105.04176
Preprint

Preface

Bell, P. C., Totzke, P., & Potapov, I. (2021). Preface (Vol. 13035 LNCS).

Book

2020

Transience in Countable MDPs

Kiefer, S., Mayr, R., Shirmohammadi, M., & Totzke, P. (2020). Transience in Countable MDPs. Retrieved from http://arxiv.org/abs/2012.13739v3

Journal article

Strategy Complexity of Parity Objectives in Countable MDPs

Kiefer, S., Mayr, R., Shirmohammadi, M., & Totzke, P. (2020). Strategy Complexity of Parity Objectives in Countable MDPs. In I. Konnov, & L. Kovács (Eds.), 31st International Conference on Concurrency Theory (CONCUR 2020) Vol. 171 (pp. 39:1-39:17). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.CONCUR.2020.39

DOI
10.4230/LIPIcs.CONCUR.2020.39
Conference Paper

How to Play in Infinite MDPs (Invited Talk)

Kiefer, S., Mayr, R., Shirmohammadi, M., Totzke, P., & Wojtczak, D. (2020). How to Play in Infinite MDPs (Invited Talk). In A. Czumaj, A. Dawar, & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) Vol. 168 (pp. 3:1-3:18). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.ICALP.2020.3

DOI
10.4230/LIPIcs.ICALP.2020.3
Conference Paper

2019

2018

Universal Safety for Timed Petri Nets is PSPACE-complete

Abdulla, P. A., Atig, M. F., Ciobanu, R., Mayr, R., & Totzke, P. (2018). Universal Safety for Timed Petri Nets is PSPACE-complete. CoRR, abs/1806.08170. Retrieved from http://arxiv.org/abs/1806.08170

Journal article

2017

MDPs with energy-parity objectives

Mayr, R., Schewe, S., Totzke, P., & Wojtczak, D. (2017). MDPs with energy-parity objectives. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 (pp. 1-12). Reykjavik, Iceland. doi:10.1109/LICS.2017.8005131

DOI
10.1109/LICS.2017.8005131
Conference Paper

MDPs with Energy-Parity Objectives

Mayr, R., Schewe, S., Totzke, P., & Wojtczak, D. (2017). MDPs with Energy-Parity Objectives. CoRR, abs/1701.02546. Retrieved from http://arxiv.org/abs/1701.02546

Journal article

2016

Branching-Time Model Checking Gap-Order Constraint Systems

Mayr, R., & Totzke, P. (2016). Branching-Time Model Checking Gap-Order Constraint Systems. FUNDAMENTA INFORMATICAE, 143(3-4), 339-353. doi:10.3233/FI-2016-1317

DOI
10.3233/FI-2016-1317
Journal article

43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy

Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., & Sangiorgi, D. (Eds.) (2016). 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. In Unknown Conference Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Retrieved from http://www.dagstuhl.de/dagpub/978-3-95977-013-2

Conference Paper

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

Göller, S., Haase, C., Lazic, R., & Totzke, P. (2016). A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR, abs/1602.05547. Retrieved from http://arxiv.org/abs/1602.05547

Journal article

Coverability Trees for Petri Nets with Unordered Data

Hofman, P., Lasota, S., Lazic, R., Leroux, J., Schmitz, S., & Totzke, P. (2016). Coverability Trees for Petri Nets with Unordered Data. In FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2016) Vol. 9634 (pp. 445-461). doi:10.1007/978-3-662-49630-5_26

DOI
10.1007/978-3-662-49630-5_26
Conference Paper

Foundations of Software Science and Computation Structures

Jacobs, B., & Löding, C. (Eds.) (2016). Foundations of Software Science and Computation Structures. In . Springer Berlin Heidelberg. doi:10.1007/978-3-662-49630-5

DOI
10.1007/978-3-662-49630-5
Conference Paper

Linear Combinations of Unordered Data Vectors

Hofman, P., Leroux, J., & Totzke, P. (2016). Linear Combinations of Unordered Data Vectors. CoRR, abs/1610.01470. Retrieved from http://arxiv.org/abs/1610.01470

Journal article

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

Englert, M., Lazic, R., & Totzke, P. (2016). Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. CoRR, abs/1602.00477. Retrieved from http://arxiv.org/abs/1602.00477

Journal article

2015

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

Leroux, J., Sutre, G., & Totzke, P. (2015). On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 9135, 324-336. doi:10.1007/978-3-662-47666-6_26

DOI
10.1007/978-3-662-47666-6_26
Journal article

Automata, Languages, and Programming

Halldórsson, M. M., Iwama, K., Kobayashi, N., & Speckmann, B. (Eds.) (2015). Automata, Languages, and Programming. In . Springer Berlin Heidelberg. doi:10.1007/978-3-662-47666-6

DOI
10.1007/978-3-662-47666-6
Conference Paper

On Boundedness Problems for Pushdown Vector Addition Systems

Leroux, J., Sutre, G., & Totzke, P. (2015). On Boundedness Problems for Pushdown Vector Addition Systems. CoRR, abs/1507.07362. Retrieved from http://arxiv.org/abs/1507.07362

Journal article

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

Leroux, J., Sutre, G., & Totzke, P. (2015). On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. CoRR, abs/1503.04018. Retrieved from http://arxiv.org/abs/1503.04018

Journal article

2014

Infinite-State Energy Games

Abdulla, P. A., Atig, M. F., Hofman, P., Mayr, R., Kumar, K. N., & Totzke, P. (2014). Infinite-State Energy Games. In 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). doi:10.1145/2603088.2603100

DOI
10.1145/2603088.2603100
Conference Paper

Inclusion problems for one-counter systems

Totzke, P. (2014). Inclusion problems for one-counter systems. (PhD Thesis, University of Edinburgh, UK). Retrieved from http://hdl.handle.net/1842/9646

Thesis / Dissertation

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), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014

Henzinger, T. A., & Miller, D. (Eds.) (2014). 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), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014. In . ACM. Retrieved from http://dl.acm.org/citation.cfm?id=2603088

Conference Paper

Trace Inclusion for One-Counter Nets Revisited

Hofman, P., & Totzke, P. (2014). Trace Inclusion for One-Counter Nets Revisited. CoRR, abs/1404.5157. Retrieved from http://arxiv.org/abs/1404.5157

Journal article

2013

28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013

28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013 (2013). IEEE Computer Society. Retrieved from http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6570844

Conference Paper

Branching-Time Model Checking Gap-Order Constraint Systems

Mayr, R., & Totzke, P. (2013). Branching-Time Model Checking Gap-Order Constraint Systems. In REACHABILITY PROBLEMS Vol. 8169 (pp. 171-182). Retrieved from https://www.webofscience.com/

Conference Paper

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India

Seth, A., & Vishnoi, N. K. (Eds.) (2013). IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India. In Unknown Conference Vol. 24. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. Retrieved from http://drops.dagstuhl.de/portals/extern/index.php?semnr=13018

Conference Paper

2012

Approximating Weak Bisimilarity of Basic Parallel Processes

Hofman, P., & Totzke, P. (n.d.). Approximating Weak Bisimilarity of Basic Parallel Processes. In Electronic Proceedings in Theoretical Computer Science Vol. 89 (pp. 99-113). Open Publishing Association. doi:10.4204/eptcs.89.8

DOI
10.4204/eptcs.89.8
Conference Paper

2009

Multiset Pushdown Automata

Kudlek, M., Totzke, P., & Zetzsche, G. (2009). Multiset Pushdown Automata. Fundamenta Informaticae, 93(1-3), 221-233. doi:10.3233/fi-2009-0098

DOI
10.3233/fi-2009-0098
Journal article

Properties of Multiset Language Classes Defined by Multiset Pushdown Automata

Kudlek, M., Totzke, P., & Zetzsche, G. (2009). Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. Fundamenta Informaticae, 93(1-3), 235-244. doi:10.3233/fi-2009-0099

DOI
10.3233/fi-2009-0099
Journal article

Multiset Pushdown Automata

Kudlek, M., Totzke, P., & Zetzsche, G. (2009). Multiset Pushdown Automata. FUNDAMENTA INFORMATICAE, 93(1-3), 221-233. doi:10.3233/FI-2009-98

DOI
10.3233/FI-2009-98
Journal article