Transformation of Petri Nets into Context-Dependent Fusion Grammars

Abstract

In this paper, we introduce context-dependent fusion grammars as a new type of hypergraph grammars where the application of fusion rules is restricted by positive and negative context conditions. Our main result is that Petri nets can be transformed into these grammars such that the reachable markings are in one-to-one correspondence to the members of the generated language. As a corollary, we get that the membership problem for context-dependent fusion grammars is at least as hard as the reachability problem of Petri nets.