2 papers
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…
cs.FL2025
Alternating Nominal Automata with Name Allocation
Florian Frank, Daniel Hausmann, Stefan Milius +2
Formal languages over infinite alphabets serve as abstractions of structures and processes carrying data. Automata models over infinite alphabets, such as classical register automa…