Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 15.


Kiefer, Stefan, Mayr, Richard, Shirmohammadi, Mahsa and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2019) Büchi Objectives in Countable MDPs. .


Mascle, Corto, Shirmohammadi, Mahsa and Totzke, Patrick ORCID: 0000-0001-5274-8190
Controlling a Random Population is EXPTIME-hard. [Internet Publication]


Hofman, Piotr, Mayr, Richard, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Soc, IEEE Comp
(2013) Decidability of Weak Simulation on One-counter Nets. .


Kiefer, Stefan, Mayr, Richard, Shirmohammadi, Mahsa, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Wojtczak, Dominik ORCID: 0000-0001-5560-0546
(2020) How to Play in Infinite MDPs (Invited Talk). .


Mayr, Richard, Schewe, Sven ORCID: 0000-0002-9093-9518, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Wojtczak, Dominik ORCID: 0000-0001-5560-0546
(2017) MDPs with energy-parity objectives. In: LICS, 2018-06-20 - 2018-06-23, Reykjavik, Iceland.


Neider, Daniel, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2020) Optimally Resilient Strategies in Pushdown Safety Games. .


Almagor, Shaull, Boker, Udi, Hofman, Piotr and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2020) Parametrized Universality Problems for One-Counter Nets. .


Englert, Matthias, Lazic, Ranko S and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2016) Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. In: 31st Annual ACM/IEEE Symposium on Logic in Computer Science.


Hofman, Piotr, Lasota, Slawomir, Mayr, Richard and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2013) Simulation Over One-counter Nets is PSPACE-Complete. .


Hofman, Piotr, Lasota, Slawomir, Mayr, Richard and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2016) Simulation Problems Over One-Counter Nets. Logical Methods in Computer Science, 12 (2).


Kiefer, Stefan, Mayr, Richard, Shirmohammadi, Mahsa and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2020) Strategy Complexity of Parity Objectives in Countable MDPs. .


Clemente, Lorenzo, Hofman, Piotr and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2019) Timed Basic Parallel Processes. .


Hofman, Piotr and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2018) Trace inclusion for one-counter nets revisited. Theoretical Computer Science, 735. 50 - 63.


Abdulla, Parosh Aziz, Atig, Mohamed Faouzi, Ciobanu, Radu, Mayr, Richard and Totzke, Patrick ORCID: 0000-0001-5274-8190
Universal Safety for Timed Petri Nets is PSPACE-complete. .


Lazić, Ranko and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2017) What Makes Petri Nets Harder to Verify: Stack or Data? .

This list was generated on Sat Oct 24 06:54:19 2020 BST.