Patrick Totzke

Patrick Totzke

University of Liverpool

H-index: 13

Europe-United Kingdom

About Patrick Totzke

Patrick Totzke, With an exceptional h-index of 13 and a recent h-index of 10 (since 2020), a distinguished researcher at University of Liverpool, specializes in the field of Verification, Games, Automata.

His recent articles reflect a diverse array of research interests and contributions to the field:

Parity Games on Temporal Graphs

Memoryless Strategies in Stochastic Reachability Games

14th and 15th International Conferences on Reachability Problems

Handling of Past and Future with Phenesthe+

Bounded-Memory Strategies in Partial-Information Games

History-deterministic vector addition systems

History-deterministic Timed Automata

HyperLTL Is Highly Undecidable, HyperCTL* is Even Harder

Patrick Totzke Information

University

Position

___

Citations(all)

408

Citations(since 2020)

268

Cited By

238

hIndex(all)

13

hIndex(since 2020)

10

i10Index(all)

16

i10Index(since 2020)

10

Email

University Profile Page

Google Scholar

Patrick Totzke Skills & Research Interests

Verification

Games

Automata

Top articles of Patrick Totzke

Parity Games on Temporal Graphs

2024/4/5

Sougata Bose
Sougata Bose

H-Index: 2

Patrick Totzke
Patrick Totzke

H-Index: 9

Memoryless Strategies in Stochastic Reachability Games

2024/3/20

14th and 15th International Conferences on Reachability Problems

Fundamenta Informaticae

2023/10/26

Igor Potapov
Igor Potapov

H-Index: 13

Patrick Totzke
Patrick Totzke

H-Index: 9

Handling of Past and Future with Phenesthe+

arXiv preprint arXiv:2310.00997

2023/10/2

Bounded-Memory Strategies in Partial-Information Games

2023/5/4

History-deterministic vector addition systems

arXiv preprint arXiv:2305.01981

2023/5/3

Sougata Bose
Sougata Bose

H-Index: 2

Patrick Totzke
Patrick Totzke

H-Index: 9

History-deterministic Timed Automata

arXiv preprint arXiv:2304.03183

2023/4/6

HyperLTL Is Highly Undecidable, HyperCTL* is Even Harder

arXiv preprint arXiv:2303.16699

2023/3/29

Patrick Totzke
Patrick Totzke

H-Index: 9

Martin Zimmermann
Martin Zimmermann

H-Index: 11

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

arXiv e-prints

2023/3

Patrick Totzke
Patrick Totzke

H-Index: 9

Martin Zimmermann
Martin Zimmermann

H-Index: 11

History-deterministic timed automata are not determinizable

2022/10/12

Making Sense of Heterogeneous Maritime Data

2022/6/6

Strategy complexity of reachability in countable stochastic 2-player games

arXiv preprint arXiv:2203.12024

2022/3/22

Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings

2021/10/25

Patrick Totzke
Patrick Totzke

H-Index: 9

Igor Potapov
Igor Potapov

H-Index: 13

The reachability problem for two-dimensional vector addition systems with states

Journal of the ACM (JACM)

2021/8/12

HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete

arXiv preprint arXiv:2105.04176

2021/5/10

Patrick Totzke
Patrick Totzke

H-Index: 9

Martin Zimmermann
Martin Zimmermann

H-Index: 11

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

2021/3/23

Transience in countable MDPs

arXiv preprint arXiv:2012.13739

2020/12/26

How to Play in Infinite MDPs

2020/7/8

Strategy complexity of parity objectives in countable mdps

arXiv preprint arXiv:2007.05065

2020/7/7

How to play in infinite MDPs (invited talk)

2020/6/29

See List of Professors in Patrick Totzke University(University of Liverpool)

Co-Authors

academic-engine