1 citations · 1 across the 2 of their papers we have counts for
7 papers
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
Matthew Hague, Roland Meyer, Sebastian Muskalla +1
We give a direct polynomial-time reduction from parity games played over the configuration graphs of collapsible pushdown systems to safety games played over the same class of grap…
Bounded Context Switching for Valence Systems
Roland Meyer, Sebastian Muskalla, Georg Zetzsche
We study valence systems, finite-control programs over infinite-state memories modeled in terms of graph monoids. Our contribution is a notion of bounded context switching (BCS). V…
Domains for Higher-Order Games
Matthew Hague, Roland Meyer, Sebastian Muskalla
We study two-player inclusion games played over word-generating higher-order recursion schemes. While inclusion checks are known to capture verification problems, two-player games…
Liveness Verification and Synthesis: New Algorithms for Recursive Programs
Roland Meyer, Sebastian Muskalla, Elisabeth Neumann
We consider the problems of liveness verification and liveness synthesis for recursive programs. The liveness verification problem (LVP) is to decide whether a given omega-context-…
On the Upward/Downward Closures of Petri Nets
Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla +1
We study the size and the complexity of computing finite state automata (FSA) representing and approximating the downward and the upward closure of Petri net languages with coverab…
Munchausen Iteration
Roland Meyer, Sebastian Muskalla
We present a method for solving polynomial equations over idempotent omega-continuous semirings. The idea is to iterate over the semiring of functions rather than the semiring of i…
Summaries for Context-Free Games
Lukáš Holík, Roland Meyer, Sebastian Muskalla
We study two-player games played on the infinite graph of sentential forms induced by a context-free grammar (that comes with an ownership partitioning of the non-terminals). The w…