Parallel Systems Group

Selected Publications

[BDS17b]

Eike Best, Raymond Devillers, Uli Schlachter: Bounded Choice-Free Petri Net Synthesis: Algorithmic Issues. Extended version of [BD15d], accepted for publication in Acta Informatica (2017).

[SW17]

Uli Schlachter, Harro Wimmel: k-Bounded Petri Net Synthesis from Modal Transition Systems. In 28th International Conference on Concurrency Theory, CONCUR 2017, Berlin, Germany, September 5-8, 2017, Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, DOI: 10.4230/LIPIcs.CONCUR.2017.6.

[SS17]

Uli Schlachter, Valentin Spreckels: Synthesis of Labelled Transition Systems into Equal-Conflict Petri Nets. In Algorithms & Theories for the Analysis of Event Data, ATAED 2017, Zaragoza, Spain, June 26-27, 2017, pp. 122-130, W. van der Aalst, R. Bergenthum, J. Carmona (eds.), CEUR workshop proceedings Vol. 1847, ISSN 1613-0073.

[BS17]

Eric Badouel, Uli Schlachter: Incremental Process Discovery using Petri Net Synthesis. In Fundamenta Informaticae Vol. 154, pp. 1-13, DOI: 10.3233/FI-2017-1548.

[BBSS17]

Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels: Properties of Plain, Pure, and Safe Petri Nets. In ToPNoC (Transactions on Petri Nets and other Models of Concurrency), Maciej Koutny, Jetty Kleijn, and Wojciech Penczek (eds), Springer-Verlag, 12 (2017), pp. 1-18, DOI: 10.1007/978-3-662-55862-1_1.

[BDS17a]

Eike Best, Raymond Devillers, Uli Schlachter: A Graph-theoretical Characterisation of State Separation. In: 43th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, Limerick, Ireland, January 16-20, 2017, 163-175, DOI: 10.1007/978-3-319-51963-0_13.

[Sch16c]

Uli Schlachter, Bounded Petri Net Synthesis From Modal Transition Systems is Undecidable. In: 27th International Conference on Concurrency Theory, CONCUR 2016, Québec City, Canada, August 23-26, 2016, Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, DOI: 10.4230/LIPIcs.CONCUR.2016.15.

[Sch16b]

Uli Schlachter, Petri Net Synthesis for Restricted Classes of Nets. In: Application and Theory of Petri Nets and Concurrency - 37th International Conference, Petri Nets 2016, Toruń, Poland, June 19-24, 2016, Proceedings, Lecture Notes in Computer Science, Springer, 2016, 79-97, DOI: 10.1007/978-3-319-39086-4_6.

[Sch16a]

Uli Schlachter, Energie- und Paritätsgewinnbedingungen auf Spielstrukturen. BestMasters, Springer Vieweg, 2016, 87 Seiten, DOI: 10.1007/978-3-658-12537-0.

[BESW16b]

Eike Best, Evgeny Erofeev, Uli Schlachter, HarroWimmel: Characterising Petri Net Solvable Binary Words. In:Application and Theory of Petri Nets and Concurrency - 37thInternational Conference, Petri Nets 2016, Toruń, Poland, June 19-24,2016, Proceedings. Lecture Notes in Computer Science, Springer, 2016,39-58, DOI: 10.1007/978-3-319-39086-4_4.

[BESW16a]

Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel: Characterising Petri Net Solvable Binary Words. Number 01/16 in Berichte aus dem Department für Informatik, pp. 1-20. Universität Oldenburg, January 2016, ISSN 1867-9218.

[BS15]

Eike Best and Uli Schlachter. Analysis of Petri Nets and Transition Systems. In: Proc. 8th Interaction and Concurrency Experience (ICE), Knight, Sophia, Ivan Lanese, Alberto Lluch Lafuente und Hugo Torres Vieira (eds.), Grenoble, France, 4-5th June 2015, volume 189 of Electronic Proceedings in Theoretical Computer Science, pp. 53-67, DOI: 10.4204/EPTCS.189.

[KSS13]

Oliver Kramer, Uli Schlachter, Valentin Spreckels: An adaptive penalty function with meta-modeling for constrained problems, 4 pages. In: IEEE Congress on Evolutionary Computation 2013, Cancun, Mexico, June 20-23, 2013, Proceedings. IEEE 2013, DOI: 10.1109/CEC.2013.6557721.