Patrick Totzke

Cited by

	All	Since 2020
Citations	481	295
h-index	14	9
i10-index	17	9

201220132014201520162017201820192020202120222023202420253 3 17 14 27 23 37 47 35 40 45 78 84 13

Public access

View all

17 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Piotrek HofmanUniversity of WarsawVerified email at mimuw.edu.pl
Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Stefan KieferProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Jerome LerouxCNRS researcher, LaBRI, FranceVerified email at labri.fr
Georg ZetzscheMPI-SWS, GermanyVerified email at mpi-sws.org
Sven ScheweProfessor of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
Sougata BoseUniversité de MonsVerified email at umons.ac.be
Parosh AbdullaProfessor of Computer Science, Uppsala UniversityVerified email at it.uu.se
Dominik WojtczakDepartment of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Matthias EnglertUniversity of WarwickVerified email at warwick.ac.uk
Martin ZimmermannAalborg UniversityVerified email at cs.aau.dk
Grégoire SutreResearch Fellow, CNRS, University of BordeauxVerified email at labri.fr
Mohamed Faouzi AtigUppsala UniversityVerified email at it.uu.se
Christoph HaaseUniversity of OxfordVerified email at cs.ox.ac.uk
Karoliina LehtinenCNRS, Aix-Marseille Université, LISVerified email at lis-lab.fr
Narayan KumarProfessor, Chennai Mathematical InstituteVerified email at cmi.ac.in
Thomas HenzingerIST AustriaVerified email at ist.ac.at
Louwe B. KuijerUniversity of LiverpoolVerified email at liv.ac.uk
Sylvain SchmitzUniversité Paris CitéVerified email at irif.fr

Patrick Totzke

University of Liverpool

Verified email at liverpool.ac.uk - Homepage

Verification Games Automata


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
On the coverability problem for pushdown vector addition systems in one dimension J Leroux, G Sutre, P Totzke International Colloquium on Automata, Languages, and Programming, 324-336, 2015	44	2015
Reachability in two-dimensional unary vector addition systems with states is NL-complete M Englert, R Lazić, P Totzke Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016	42	2016
Coverability trees for Petri nets with unordered data P Hofman, S Lasota, R Lazić, J Leroux, S Schmitz, P Totzke International Conference on Foundations of Software Science and Computation …, 2016	29	2016
Properties of multiset language classes defined by multiset pushdown automata M Kudlek, P Totzke, G Zetzsche Fundamenta Informaticae 93 (1-3), 235-244, 2009	27	2009
Multiset pushdown automata M Kudlek, P Totzke, G Zetzsche Fundamenta Informaticae 93 (1-3), 221-233, 2009	26	2009
Infinite-state energy games PA Abdulla, MF Atig, P Hofman, R Mayr, KN Kumar, P Totzke Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014	23	2014
The reachability problem for two-dimensional vector addition systems with states M Blondin, M Englert, A Finkel, S Göller, C Haase, R Lazić, P McKenzie, ... Journal of the ACM (JACM) 68 (5), 1-43, 2021	19	2021
MDPs with energy-parity objectives R Mayr, S Schewe, P Totzke, D Wojtczak 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017	18	2017
A polynomial-time algorithm for reachability in branching VASS in dimension one S Göller, C Haase, R Lazić, P Totzke arXiv preprint arXiv:1602.05547, 2016	18	2016
Decidability of weak simulation on one-counter nets P Hofman, R Mayr, P Totzke 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 203-212, 2013	18	2013
What makes Petri nets harder to verify: stack or data? R Lazić, P Totzke Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William …, 2017	15	2017
Simulation problems over one-counter nets P Hofman, S Lasota, R Mayr, P Totzke Logical Methods in Computer Science 12, 2016	15	2016
Trace inclusion for one-counter nets revisited P Hofman, P Totzke Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014	15	2014
Strategy complexity of parity objectives in countable MDPs S Kiefer, R Mayr, M Shirmohammadi, P Totzke arXiv preprint arXiv:2007.05065, 2020	14	2020
HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete M Fortin, LB Kuijer, P Totzke, M Zimmermann arXiv preprint arXiv:2105.04176, 2021	13	2021
B\" uchi Objectives in Countable MDPs S Kiefer, R Mayr, M Shirmohammadi, P Totzke arXiv preprint arXiv:1904.11573, 2019	13	2019
Linear combinations of unordered data vectors P Hofman, J Leroux, P Totzke 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2017	13	2017
History-deterministic timed automata TA Henzinger, K Lehtinen, P Totzke CONCUR 243, 2022	9	2022
How to play in infinite MDPs (invited talk) S Kiefer, R Mayr, M Shirmohammadi, P Totzke, D Wojtczak 47th International Colloquium on Automata, Languages and Programming, 1-18, 2020	9	2020
Trace inclusion for one-counter nets revisited P Hofman, P Totzke Theoretical Computer Science 735, 50-63, 2018	9	2018

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors