The following pages link to Patrick Totzke (Q1675153):
Displaying 36 items.
- On boundedness problems for pushdown vector addition systems (Q1675154) (← links)
- What makes Petri nets harder to verify: stack or data? (Q1708715) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Trace inclusion for one-counter nets revisited (Q2636512) (← links)
- Simulation Problems Over One-Counter Nets (Q2800968) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Simulation Over One-counter Nets is PSPACE-Complete (Q2963939) (← links)
- Branching-Time Model Checking Gap-Order Constraint Systems (Q2968527) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- A polynomial-time algorithm for reachability in branching VASS in dimension one (Q4598246) (← links)
- Infinite-state energy games (Q4635588) (← links)
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete (Q4635905) (← links)
- (Q4986262) (← links)
- Universal safety for timed Petri nets is PSPACE-complete (Q5009418) (← links)
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States (Q5056423) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- (Q5089306) (← links)
- (Q5089314) (← links)
- (Q5092320) (← links)
- (Q5144611) (← links)
- (Q5144678) (← links)
- Branching-Time Model Checking Gap-Order Constraint Systems (Q5168523) (← links)
- (Q5192935) (← links)
- (Q5192936) (← links)
- Decidability of Weak Simulation on One-Counter Nets (Q5271057) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
- (Q6134255) (← links)
- HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. (Q6168463) (← links)
- B\"uchi Objectives in Countable MDPs (Q6317779) (← links)
- Memoryless Strategies in Stochastic Reachability Games (Q6518709) (← links)
- "Strategy Complexity of B\""uchi Objectives in Concurrent Stochastic Games" (Q6531836) (← links)
- History-deterministic timed automata (Q6587120) (← links)
- Parity games on temporal graphs (Q6629452) (← links)
- History-deterministic timed automata (Q6635511) (← links)
- Optimally Controlling a Random Population (Q6754704) (← links)
