Variants of the Language Based Synthesis Problem for Petri Nets

The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often not appropriate in realistic settings, because usually it is not asked for plain-vanilla Petri net synthesis, but specific additional requirements have to be considered. Having this in mind, we in this paper survey variants of the classical language based synthesis problems and develop respective solution algorithms. This yields a large repertoire of synthesis procedures presented in a uniform way.