Volgen
Patrick Totzke
Patrick Totzke
Geverifieerd e-mailadres voor liverpool.ac.uk - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
312016
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
292015
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
222016
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
202014
Multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 221-233, 2009
202009
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
172016
Properties of multiset language classes defined by multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 235-244, 2009
172009
What makes Petri nets harder to verify: stack or data?
R Lazić, P Totzke
Concurrency, Security, and Puzzles, 144-161, 2017
132017
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
International Workshop on Reachability Problems, 151-162, 2014
132014
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
132013
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
112017
Simulation problems over one-counter nets
P Totzke, R Mayr, S Lasota, P Hofman
Logical Methods in Computer Science 12, 2016
112016
B\" uchi Objectives in Countable MDPs
S Kiefer, R Mayr, M Shirmohammadi, P Totzke
arXiv preprint arXiv:1904.11573, 2019
92019
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
82017
On boundedness problems for pushdown vector addition systems
J Leroux, G Sutre, P Totzke
International Workshop on Reachability Problems, 101-113, 2015
82015
Simulation over one-counter nets is PSPACE-complete
P Hofman, S Lasota, R Mayr, P Totzke
arXiv preprint arXiv:1310.6303, 2013
82013
Strategy complexity of parity objectives in countable mdps
S Kiefer, R Mayr, M Shirmohammadi, P Totzke
arXiv preprint arXiv:2007.05065, 2020
62020
Trace inclusion for one-counter nets revisited
P Hofman, P Totzke
Theoretical Computer Science 735, 50-63, 2018
52018
Branching-time model checking gap-order constraint systems
R Mayr, P Totzke
Fundamenta Informaticae 143 (3-4), 339-353, 2016
52016
Timed Basic Parallel Processes
L Clemente, P Hofman, P Totzke
arXiv preprint arXiv:1907.01240, 2019
42019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20