2 papers
cs.FL2026
Nominal Automata with Name Deallocation
Simon Prucker, Stefan Milius, Lutz Schröder
Data words with binders formalize concurrently allocated memory. Most name-binding mechanisms in formal languages, such as the -calculus, adhere to properly nested scoping. In…
cs.LO2025
Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames
Daniel Hausmann, Merlin Humml, Simon Prucker +1
The semantics of alternating-time temporal logic (ATL) and the more expressive alternating-time μ-calculus (AMC) is standardly given in terms of concurrent game frames (CGF). The…