Analysis of Petri nets and transition systems E Best, U Schlachter arXiv preprint arXiv:1508.04851, 2015 | 43 | 2015 |
Bounded choice-free Petri net synthesis: algorithmic issues E Best, R Devillers, U Schlachter Acta Informatica 55, 575-611, 2018 | 31 | 2018 |
Optimised capacity and operating strategy for providing frequency containment reserve with batteries and power-to-heat U Schlachter, A Worschech, T Diekmann, B Hanke, K von Maydell Journal of Energy Storage 32, 101964, 2020 | 22 | 2020 |
Characterising Petri net solvable binary words E Best, E Erofeev, U Schlachter, H Wimmel International Conference on Applications and Theory of Petri Nets and …, 2016 | 20 | 2016 |
Business case analysis of hybrid systems consisting of battery storage and power-to-heat on the German energy market P Draheim, U Schlachter, H Wigger, A Worschech, U Brand, T Diekmann, ... Utilities Policy 67, 101110, 2020 | 15 | 2020 |
Petri net synthesis for restricted classes of nets U Schlachter International Conference on Applications and Theory of Petri Nets and …, 2016 | 15 | 2016 |
Over-approximative Petri net synthesis for restricted subclasses of nets U Schlachter Language and Automata Theory and Applications: 12th International Conference …, 2018 | 12 | 2018 |
An adaptive penalty function with meta-modeling for constrained problems O Kramer, U Schlachter, V Spreckels 2013 IEEE Congress on Evolutionary Computation, 1350-1354, 2013 | 12 | 2013 |
A geometric characterisation of event/state separation U Schlachter, H Wimmel International Conference on Applications and Theory of Petri Nets and …, 2018 | 10 | 2018 |
Factorisation of Petri net solvable transition systems R Devillers, U Schlachter International Conference on Applications and Theory of Petri Nets and …, 2018 | 10 | 2018 |
A graph-theoretical characterisation of state separation E Best, R Devillers, U Schlachter SOFSEM 2017: Theory and Practice of Computer Science: 43rd International …, 2017 | 10 | 2017 |
Bounded Petri net synthesis from modal transition systems is undecidable U Schlachter 27th International Conference on Concurrency Theory (CONCUR 2016), 2016 | 10 | 2016 |
Relabelling LTS for petri net synthesis via solving separation problems U Schlachter, H Wimmel Transactions on Petri Nets and Other Models of Concurrency XIV, 222-254, 2019 | 9 | 2019 |
Petri net synthesis and modal specifications UC Schlachter Universität Oldenburg, 2018 | 8 | 2018 |
Analysis of taxation and framework conditions for hybrid power plants consisting of battery storage and power-to-heat providing frequency containment reserve in selected … A Worschech, U Schlachter, H Wigger, B Hanke, P Draheim, F Schuldt, ... Energy Strategy Reviews 38, 100744, 2021 | 7 | 2021 |
Simultaneous Petri net synthesis E Best, R Devillers, U Schlachter, H Wimmel Scientific Annals of Computer Science 28 (2), 199-236, 2018 | 6 | 2018 |
k-bounded Petri net synthesis from modal transition systems U Schlachter, H Wimmel 28th International Conference on Concurrency Theory (CONCUR 2017), 2017 | 6 | 2017 |
Incremental process discovery using petri net synthesis E Badouel, U Schlachter Fundamenta Informaticae 154 (1-4), 1-13, 2017 | 5 | 2017 |
Optimal label splitting for embedding an LTS into an arbitrary Petri net reachability graph is NP-complete. CoRR abs/2002.04841 (2020) U Schlachter, H Wimmel | 5 | 2002 |
Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete U Schlachter, H Wimmel arXiv preprint arXiv:2002.04841, 2020 | 4 | 2020 |