search result

Cover von Strategy Complexity of Parity Objectives in Countable MDPs

Strategy Complexity of Parity Objectives in Countable MDPs

Year: 2020
Media group: LIPIcs
Cover von Optimally Resilient Strategies in Pushdown Safety Games

Optimally Resilient Strategies in Pushdown Safety Games

Year: 2020
Media group: LIPIcs
Cover von Timed Basic Parallel Processes

Timed Basic Parallel Processes

Year: 2019
Media group: LIPIcs
Cover von Büchi Objectives in Countable MDPs

Büchi Objectives in Countable MDPs

Year: 2019
Media group: LIPIcs
Cover von History-Deterministic Timed Automata

History-Deterministic Timed Automata

Year: 2022
Media group: LIPIcs
Cover von HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete

Year: 2021
Media group: LIPIcs
Cover von Parametrized Universality Problems for One-Counter Nets

Parametrized Universality Problems for One-Counter Nets

Year: 2020
Media group: LIPIcs
Cover von How to Play in Infinite MDPs (Invited Talk)

How to Play in Infinite MDPs (Invited Talk)

Year: 2020
Media group: LIPIcs
Cover von Universal Safety for Timed Petri Nets is PSPACE-complete

Universal Safety for Timed Petri Nets is PSPACE-complete

Year: 2018
Media group: LIPIcs
Cover von A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One

Year: 2016
Media group: LIPIcs
OPEN V 11.1.0.0