Patrick Totzke

Cited by

	All	Since 2019
Citations	465	317
h-index	14	11
i10-index	18	13

20122013201420152016201720182019202020212022202320243 3 16 15 30 34 32 46 36 40 46 79 70

Public access

View all

16 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
Mahsa ShirmohammadiUniversity of OxfordVerified email at cs.ox.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 BoseUniversity of LiverpoolVerified email at liverpool.ac.uk
Dominik WojtczakDepartment of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Parosh AbdullaProfessor of Computer Science, Uppsala UniversityVerified email at it.uu.se
Matthias EnglertUniversity of WarwickVerified email at warwick.ac.uk
Grégoire SutreResearch Fellow, CNRS, University of BordeauxVerified email at labri.fr
Martin ZimmermannAalborg UniversityVerified email at cs.aau.dk
Christoph HaaseUniversity of OxfordVerified email at cs.ox.ac.uk
Karoliina LehtinenCNRS, Aix-Marseille Université, LISVerified email at lis-lab.fr
Mohamed Faouzi AtigUppsala UniversityVerified email at it.uu.se
Narayan KumarProfessor, Chennai Mathematical InstituteVerified email at cmi.ac.in
Thomas HenzingerIST AustriaVerified email at ist.ac.at
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	46	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	41	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	26	2009
Multiset pushdown automata M Kudlek, P Totzke, G Zetzsche Fundamenta Informaticae 93 (1-3), 221-233, 2009	24	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
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	20	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	17	2013
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	16	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	16	2017
What makes Petri nets harder to verify: stack or data? R Lazić, P Totzke Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William …, 2017	16	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
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	12	2017
HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete M Fortin, LB Kuijer, P Totzke, M Zimmermann arXiv preprint arXiv:2105.04176, 2021	10	2021
On boundedness problems for pushdown vector addition systems J Leroux, G Sutre, P Totzke International Workshop on Reachability Problems, 101-113, 2015	10	2015
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	8	2020

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