Showing cs.FLShow all
2 papers · 1 filter
cs.FL2021
Nominal Büchi Automata with Name Allocation
Henning Urbat, Daniel Hausmann, Stefan Milius +1
Infinite words over infinite alphabets serve as models of the temporal development of the allocation and (re-)use of resources over linear time. We approach omega-languages over in…
cs.FL2020
A Linear-Time Nominal -Calculus with Name Allocation
Daniel Hausmann, Stefan Milius, Lutz Schröder
Logics and automata models for languages over infinite alphabets, such as Freeze LTL and register automata, serve the verification of processes or documents with data. They relate…