7 citations · 8 across the 2 of their papers we have counts for
2 papers
math.LO2014★ 1 cited
Decomposition Theorems and Model-Checking for the Modal -Calculus
Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer
We prove a general decomposition theorem for the modal -calculus in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a struc…
cs.GT2012★ 7 cited
Graph Operations on Parity Games and Polynomial-Time Algorithms
Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu
Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph.…