1 citations · 1 across the 4 of their papers we have counts for
5 papers
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 c…
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 i…
Nominal Tree Automata With Name Allocation
Simon Prucker, Lutz Schröder
Data trees serve as an abstraction of structured data, such as XML documents. A number of specification formalisms for languages of data trees have been developed, many of them adh…
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
Daniel Hausmann, Merlin Humml, Simon Prucker +2
We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (nondeterministic, game-based, probabilistic etc.) and in the nex…
COOL 2 -- A Generic Reasoner for Modal Fixpoint Logics
Oliver Görlitz, Daniel Hausmann, Merlin Humml +3
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood st…