Browse by People

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

Karpenkov, Oleg ORCID: 0000-0002-3358-6998 (2021) Continued Fraction approach to Gauss Reduction Theory. .

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

Hofman, Piotr, Mayr, Richard and Totzke, Patrick ORCID: 0000-0001-5274-8190 (2013) Decidability of Weak Simulation on One-counter Nets. In: 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013), 2013-6-25 - 2013-6-28, New Orleans, LA, USA.

Pitsikalis, Manolis, Lisitsa, Alexei and Totzke, Patrick ORCID: 0000-0001-5274-8190 (2023) Handling of Past and Future with Phenesthe+. .

Bose, Sougata, Henzinger, Thomas A, Lehtinen, Karoliina, Schewe, Sven ORCID: 0000-0002-9093-9518 and Totzke, Patrick ORCID: 0000-0001-5274-8190 (2022) History-Deterministic Timed Automata Are Not Determinizable. .

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). .

Fortin, Marie, Kuijer, Louwe B, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin (2021) HyperLTL Satisfiability is $Σ_1^1$-complete, HyperCTL* Satisfiability is $Σ_1^2$-complete. Leibniz International Proceedings in Informatics, LIPIcs, 202.

Fortin, Marie, Kuijer, Louwe ORCID: 0000-0001-6696-9023, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin ORCID: 0000-0002-8038-2453 (2021) HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ21-complete. In: Mathematical Foundations of Computer Science, 2021-8-23 - 2021-8-27, Tallinn.

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-6-20 - 2018-6-23, Reykjavik, Iceland.

Pitsikalis, Manolis, Lisitsa, Alexei, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Lee, Simon (2022) Making Sense of Heterogeneous Maritime Data. In: 2022 23rd IEEE International Conference on Mobile Data Management (MDM), 2022-6-6 - 2022-6-9.

Livesey, Joseph and Wojtczak, Dominik ORCID: 0000-0001-5560-0546 (2021) Minimal Number of Calls in Propositional Protocols. .

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

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

Blondin, Michael, Englert, Matthias, Finkel, Alain, Goeller, Stefan, Haase, Christoph, Lazic, Ranko, Mckenzie, Pierre and Totzke, Patrick ORCID: 0000-0001-5274-8190 (2021) The Reachability Problem for Two-Dimensional Vector Addition Systems with States. JOURNAL OF THE ACM, 68 (5). pp. 1-43.

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, 2016-7-5 - 2016-7-8, ’16, New York, NY, USA, July 5-8, 2016.

Totzke, Patrick ORCID: 0000-0001-5274-8190, Schewe, Sven ORCID: 0000-0002-9093-9518 and Wojtczak, Dominik ORCID: 0000-0001-5560-0546 (2021) Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. In: Foundations of Software Science and Computation Structures, 2021-3-27 - 2021-4-1, Luxembourg.

Mayr, Richard, Schewe, Sven ORCID: 0000-0002-9093-9518, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Wojtczak, Dominik ORCID: 0000-0001-5560-0546 (2021) Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 12650. pp. 427-447.

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 (1). p. 1.

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. In: CONCUR, 2019-8-26 - 2019-8-31, Amsterdam.

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

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

Abdulla, Parosh Aziz, Atig, Mohamed Faouzi, Ciobanu, Radu, Mayr, Richard and Totzke, Patrick ORCID: 0000-0001-5274-8190 (2018) Universal Safety for Timed Petri Nets is PSPACE-complete. In: CONCUR 2018, 2018-9-4 - ?, Beijing, China.

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