1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
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…