goto contents

Ronny Tredup

Zur Komplexität der Synthese von Petri-Netzen

Universität Rostock, 2021

Abstract: Petri net synthesis asks, for a regular behavior given as a transition system A, whether there exists a Petri net (of a particular class) that implements A. This work investigates variants of this decision problem for different implementations and a variety of Petri net classes from the point of view of classical and parameterized complexity. Also investigated is the complexity of the modification techniques of relabeling and edge, event, and state deletion, which aim to make non-implementable transition systems implementable.

doctoral thesis   free access    


OPACGVKDataCite Commons


all rights reserved

This work may only be used under the terms of the German Copyright Law (Urheberrechtsgesetz).