Analysis of Petri Nets with Context-Free Structure Changes

Nils Erik Flick, Björn Engelmann


Structure-changing Petri nets are Petri nets with transition replacement rules. In this paper, we investigate the restricted class of structure-changing workflow nets and show that two different reachability properties (concrete and abstract reachability) and word membership in the language of labelled firing sequences are decidable, while a language-based notion of correctness (containment of the language of labelled firing sequences in a regular language) is undecidable.

Full Text:




Hosted By Universitätsbibliothek TU Berlin.