21,058 research outputs found
Two-Buffer Simulation Games
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 two different buffers before she executes them on her structure. Previous work on such games using a single buffer has shown that they are useful to approximate language inclusion problems. We study the decidability and complexity and show that games with two buffers can be used to approximate corresponding problems on finite transducers, i.e. the inclusion problem for rational relations over infinite words
Buffered Simulation Games for B\"uchi Automata
Simulation relations are an important tool in automata theory because they
provide efficiently computable approximations to language inclusion. In recent
years, extensions of ordinary simulations have been studied, for instance
multi-pebble and multi-letter simulations which yield better approximations and
are still polynomial-time computable.
In this paper we study the limitations of approximating language inclusion in
this way: we introduce a natural extension of multi-letter simulations called
buffered simulations. They are based on a simulation game in which the two
players share a FIFO buffer of unbounded size. We consider two variants of
these buffered games called continuous and look-ahead simulation which differ
in how elements can be removed from the FIFO buffer. We show that look-ahead
simulation, the simpler one, is already PSPACE-hard, i.e. computationally as
hard as language inclusion itself. Continuous simulation is even EXPTIME-hard.
We also provide matching upper bounds for solving these games with infinite
state spaces.Comment: In Proceedings AFL 2014, arXiv:1405.527
Smoke and Shadows: Rendering and Light Interaction of Smoke in Real-Time Rendered Virtual Environments
Realism in computer graphics depends upon digitally representing what we see in the world with careful attention to detail, which usually requires a high degree of complexity in modelling the scene. The inevitable trade-off between realism and performance means that new techniques that aim to improve the visual fidelity of a scene must do so without compromising the real-time rendering performance. We describe and discuss a simple method for realistically casting shadows from an opaque solid object through a GPU (graphics processing unit) based particle system representing natural phenomena, such as smoke
- …