12 citations · 27 across the 6 of their papers we have counts for
6 papers
Multi-Buffer Simulations for Trace Language Inclusion
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske +2
We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers befor…
A Canonical Model Construction for Iteration-Free PDL with Intersection
Florian Bruse, Daniel Kernberger, Martin Lange
We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and te…
Two-Buffer Simulation Games
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske +2
We consider simulation games played between Spoiler and Duplicator on two Buchi automata in which the choices made by Spoiler can be buffered by Duplicator in two different buffers…
The Fixpoint-Iteration Algorithm for Parity Games
Florian Bruse, Michael Falk, Martin Lange
It is known that the model checking problem for the modal mu-calculus reduces to the problem of solving a parity game and vice-versa. The latter is realised by the Walukiewicz form…
Buffered Simulation Games for Büchi Automata
Milka Hutagalung, Martin Lange, Etienne Lozes
Simulation relations are an important tool in automata theory because they provide efficiently computable approximations to language inclusion. In recent years, extensions of ordin…
Model-Checking the Higher-Dimensional Modal mu-Calculus
Martin Lange, Etienne Lozes
The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property tha…