| 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 | 43 | 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 | 39 | 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 | 28 | 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 | 25 | 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 | 22 | 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 |
| 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 |
| 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 | 16 | 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 |
| 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 | 14 | 2021 |
| Trace inclusion for one-counter nets revisited P Hofman, P Totzke Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014 | 14 | 2014 |
| B\" uchi Objectives in Countable MDPs S Kiefer, R Mayr, M Shirmohammadi, P Totzke arXiv preprint arXiv:1904.11573, 2019 | 13 | 2019 |
| Simulation problems over one-counter nets P Hofman, S Lasota, R Mayr, P Totzke Logical Methods in Computer Science 12, 2016 | 13 | 2016 |
| Strategy complexity of parity objectives in countable mdps S Kiefer, R Mayr, M Shirmohammadi, P Totzke arXiv preprint arXiv:2007.05065, 2020 | 12 | 2020 |
| 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 |
| History-deterministic timed automata TA Henzinger, K Lehtinen, P Totzke CONCUR 243, 2022 | 9 | 2022 |
| HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete M Fortin, LB Kuijer, P Totzke, M Zimmermann arXiv preprint arXiv:2105.04176, 2021 | 9 | 2021 |
| On boundedness problems for pushdown vector addition systems J Leroux, G Sutre, P Totzke International Workshop on Reachability Problems, 101-113, 2015 | 9 | 2015 |
| Trace inclusion for one-counter nets revisited P Hofman, P Totzke Theoretical Computer Science 735, 50-63, 2018 | 8 | 2018 |
Piotrek HofmanUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
