Christoph Peuser

Abstract

We consider correctness of graph grammars under adverse conditions. In contrast to existing approaches using temporal logic, the influence of an adverse environment is considered in addition to system behavior. To this end we construct a game, where rules represent the moves available to players and a temporal condition specifies the systems desired properties. In particular, the construction of parity pushdown games from ordered hyperedge replacement grammars results in a decidable class of games.