Patrick Totzke
Patrick Totzke
Verified email at liverpool.ac.uk - Homepage
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
212015
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
202016
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete*
M Englert, R Lazić, P Totzke
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-8, 2016
192016
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
192014
Multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 221-233, 2009
172009
Properties of multiset language classes defined by multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 235-244, 2009
132009
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
122016
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
122013
Simulation problems over one-counter nets
P Hofman, S Lasota, R Mayr, P Totzke
arXiv preprint arXiv:1602.00476, 2016
112016
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
International Workshop on Reachability Problems, 151-162, 2014
102014
What Makes Petri Nets Harder to Verify: Stack or Data?
R Lazić, P Totzke
Concurrency, Security, and Puzzles, 144-161, 2017
92017
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
82017
Simulation over one-counter nets is PSPACE-complete
P Hofman, S Lasota, R Mayr, P Totzke
arXiv preprint arXiv:1310.6303, 2013
82013
On boundedness problems for pushdown vector addition systems
J Leroux, G Sutre, P Totzke
International Workshop on Reachability Problems, 101-113, 2015
62015
B\" uchi Objectives in Countable MDPs
S Kiefer, R Mayr, M Shirmohammadi, P Totzke
arXiv preprint arXiv:1904.11573, 2019
52019
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
52017
Universal safety for timed Petri nets is PSPACE-complete
PA Abdulla, MF Atig, R Ciobanu, R Mayr, P Totzke
arXiv preprint arXiv:1806.08170, 2018
42018
Inclusion problems for one-counter systems
P Totzke
The University of Edinburgh, 2014
42014
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
Theoretical Computer Science 735, 50-63, 2018
32018
Controlling a Random Population is EXPTIME-hard
C Mascle, M Shirmohammadi, P Totzke
arXiv preprint arXiv:1909.06420, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20