An adaptive penalty function with meta-modeling for constrained problems. - Oliver Kramer 001; Uli Schlachter; Valentin Spreckels (IEEE Congress on Evolutionary Computation, 2013)

Analysis of Petri Nets and Transition Systems. - Eike Best; Uli Schlachter (ICE, 2015)

Characterising Petri Net Solvable Binary Words. - Eike Best; Evgeny Erofeev; Uli Schlachter; Harro Wimmel (Petri Nets, 2016)

Petri Net Synthesis for Restricted Classes of Nets. - Uli Schlachter (Petri Nets, 2016)

Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable. - Uli Schlachter (CONCUR, 2016)

Synthesis of Labelled Transition Systems into Equal-Conflict Petri Nets. - Uli Schlachter; Valentin Spreckels (ATAED@Petri Nets/ACSD, 2017)

k-Bounded Petri Net Synthesis from Modal Transition Systems. - Uli Schlachter; Harro Wimmel (CONCUR, 2017)

A Graph-Theoretical Characterisation of State Separation. - Eike Best; Raymond Devillers; Uli Schlachter (SOFSEM, 2017)

Incremental Process Discovery using Petri Net Synthesis. - Éric Badouel; Uli Schlachter (Fundam. Informaticae, 2017)

Properties of Plain, Pure, and Safe Petri Nets. - Kamila Barylska; Eike Best; Uli Schlachter; Valentin Spreckels (Trans. Petri Nets Other Model. Concurr., 2017)

Factorisation of Petri Net Solvable Transition Systems. - Raymond Devillers; Uli Schlachter (Petri Nets, 2018)

A Geometric Characterisation of Event/State Separation. - Uli Schlachter; Harro Wimmel (Petri Nets, 2018)

Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets. - Uli Schlachter (LATA, 2018)

Bounded choice-free Petri net synthesis: algorithmic issues. - Eike Best; Raymond Devillers; Uli Schlachter (Acta Informatica, 2018)

Simultaneous Petri Net Synthesis. - Eike Best; Raymond Devillers; Uli Schlachter; Harro Wimmel (Sci. Ann. Comput. Sci., 2018)

Petri net synthesis and modal specifications. - Uli Schlachter (2018)

Relabelling LTS for Petri Net Synthesis via Solving Separation Problems. - Uli Schlachter; Harro Wimmel (Trans. Petri Nets Other Model. Concurr., 2019)

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete. - Uli Schlachter; Harro Wimmel (CoRR, 2020)