Seuraa
Patrick Totzke
Patrick Totzke
University of Liverpool
Vahvistettu sähköpostiosoite verkkotunnuksessa liverpool.ac.uk - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
442015
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
422016
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
292016
Properties of multiset language classes defined by multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 235-244, 2009
272009
Multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 221-233, 2009
262009
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
232014
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
192021
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
182017
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
182016
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
182013
Simulation problems over one-counter nets
P Hofman, S Lasota, R Mayr, P Totzke
Logical Methods in Computer Science 12, 2016
162016
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014
162014
What makes Petri nets harder to verify: stack or data?
R Lazić, P Totzke
Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William …, 2017
152017
Strategy complexity of parity objectives in countable MDPs
S Kiefer, R Mayr, M Shirmohammadi, P Totzke
arXiv preprint arXiv:2007.05065, 2020
142020
HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete
M Fortin, LB Kuijer, P Totzke, M Zimmermann
arXiv preprint arXiv:2105.04176, 2021
132021
B\" uchi Objectives in Countable MDPs
S Kiefer, R Mayr, M Shirmohammadi, P Totzke
arXiv preprint arXiv:1904.11573, 2019
132019
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
132017
History-deterministic timed automata
TA Henzinger, K Lehtinen, P Totzke
CONCUR 243, 2022
92022
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
92020
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
Theoretical Computer Science 735, 50-63, 2018
92018
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20