Patrick Totzke

Available identifiers

zbMath Open totzke.patrickMaRDI QIDQ1675153

List of research outcomes

Publication	Date of Publication	Type
History-deterministic timed automata	2024-11-12	Paper
Parity games on temporal graphs	2024-10-30	Paper
History-deterministic timed automata	2024-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q6134255	2023-08-21	Paper
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.	2023-08-08	Paper
History-deterministic timed automata are not determinizable	2023-07-21	Paper
Timed Basic Parallel Processes	2023-02-03	Paper
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5092320	2022-07-21	Paper
Optimally Resilient Strategies in Pushdown Safety Games	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5089306	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5089314	2022-07-18	Paper
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games	2022-03-22	Paper
Simple stochastic games with almost-sure energy-parity objectives are in NP and conp	2021-10-18	Paper
Universal safety for timed Petri nets is PSPACE-complete	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4986262	2021-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q5144611	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5144678	2021-01-19	Paper
B\"uchi Objectives in Countable MDPs	2019-04-25	Paper
Trace inclusion for one-counter nets revisited	2018-06-05	Paper
Infinite-state energy games	2018-04-23	Paper
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete	2018-04-23	Paper
What makes Petri nets harder to verify: stack or data?	2018-03-26	Paper
A polynomial-time algorithm for reachability in branching VASS in dimension one	2017-12-19	Paper
On boundedness problems for pushdown vector addition systems	2017-10-27	Paper
Decidability of Weak Simulation on One-Counter Nets	2017-07-03	Paper
Branching-Time Model Checking Gap-Order Constraint Systems	2017-03-16	Paper
Simulation Over One-counter Nets is PSPACE-Complete	2017-02-21	Paper
Coverability Trees for Petri Nets with Unordered Data	2016-06-10	Paper
Simulation problems over one-counter nets	2016-04-19	Paper
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension	2015-11-04	Paper
Trace Inclusion for One-Counter Nets Revisited	2015-10-28	Paper
Branching-Time Model Checking Gap-Order Constraint Systems	2014-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q5192935	2009-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q5192936	2009-08-10	Paper
Memoryless Strategies in Stochastic Reachability Games	N/A	Paper
"Strategy Complexity of B\""uchi Objectives in Concurrent Stochastic Games"	N/A	Paper

Research outcomes over time

This page was built for person: Patrick Totzke