No. Title Author Year
1 HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete Fortin, Marie et al. 2021
2 Transience in Countable MDPs Kiefer, Stefan et al. 2021
3 How to Play in Infinite MDPs (Invited Talk) Kiefer, Stefan et al. 2020
4 Optimally Resilient Strategies in Pushdown Safety Games Neider, Daniel et al. 2020
5 Parametrized Universality Problems for One-Counter Nets Almagor, Shaull et al. 2020
6 Strategy Complexity of Parity Objectives in Countable MDPs Kiefer, Stefan et al. 2020
7 Büchi Objectives in Countable MDPs Kiefer, Stefan et al. 2019
8 Timed Basic Parallel Processes Clemente, Lorenzo et al. 2019
9 Universal Safety for Timed Petri Nets is PSPACE-complete Abdulla, Parosh Aziz et al. 2018
10 A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One Göller, Stefan et al. 2016
11 Simulation Over One-counter Nets is PSPACE-Complete Hofman, Piotr et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI