1 citations · 1 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2025
PVASS Reachability is Decidable
Roland Guttenberg, Eren Keskin, Roland Meyer
Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decida…
cs.LO2023
Urgency Annotations for Alternating Choices
Eren Keskin, Roland Meyer, Sören van der Wall
We propose urgency programs, a new programming model with support for alternation, imperfect information, and recursion. The novelty are urgency annotations that decorate the (ange…