Parallele Systeme

Veröffentlichungen seit 2015

[EW17]

Evgeny Erofeev, Harro Wimmel: Reachability Graphs of Two-Transition Petri Nets, ATAED 2017 (Algorithms & Theories for the Analysis of Event Data), Zaragoza, Spain, June 26–27, 2017, W. van der Aalst, R. Bergenthum, J. Carmona (eds.), CEUR workshop proceedings Vol. 1847, ISSN 1613-0073.

[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).

[AB17]

Wil M. P. van der Aalst, Eike Best (eds): Application and Theory of Petri Nets and Concurrency – 38th International Conference, PETRI NETS 2017, Zaragoza, Spain, June 25–30, 2017, Proceedings. Lecture Notes in Computer Science 10258, Springer 2017, ISBN 978-3-319-57860-6.

[SW17]

Uli Schlachter, Harro Wimmel: k-Bounded Petri Net Synthesis from Modal Transition Systems. To appear in CONCUR 2017.

[SS17]

Uli Schlachter, Valentin Spreckels: Synthesis of Labelled Transition Systems into Equal-Conflict Petri Nets, ATAED 2017 (Algorithms & Theories for the Analysis of Event Data), Zaragoza, Spain, June 26–27, 2017, 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. To appear in Fundamenta Informaticae.

[BBSS17]

Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels: Properties of Plain, Pure, and Safe Petri Nets. To appear in ToPNoC.

[HD17]

Thomas Hujsa and Raymond Devillers: On liveness and deadlockability in subclasses of weighted Petri nets. Petri Nets 2017 (ICATPN) Zaragoza, Spain, June 25–30, 2017, Proceedings. Lecture Notes in Computer Science 10258, Springer 2017, 20 pages.

[BD17b]

Eike Best, Raymond Devillers: Pre-synthesis of Petri Nets Based on Prime Cycles and Distance Paths. To appear in Science of Computer Programming.

[BD17a]

Eike Best and Raymond Devillers: Characterisation of the State Spaces of Marked Graph Petri Nets. Information and Computation 253 (2017), 399–410. Selected extended papers of LATA'2014, doi: 10.1016/j.ic.2016.06.006.

[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.

[BGV17]

Eike Best, Nataliya Gribovskaya, Irina Virbitskaite: Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict. In: 43th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, Limerick, Ireland, January 16-20, 2017, 132-146, DOI: 10.1007/978-3-319-51963-0_11.

[BMPKE16]

Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski, Maciej Koutny, and Evgeny Erofeev: Reversing Transitions in Bounded Petri Nets, in Bernd-Holger Schlingloff (ed.): Proceedings of the 25th International Workshop on Concurrency, Specification and Programming, Rostock, Germany, September 28–30, 2016, CEUR Workshop Proceedings, vol. 1698, pp. 74–85.

[EBMP16]

Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, and Marcin Piatkowski: Generating All Minimal Petri Net Unsolvable Binary Words, in Jan Holub and Jan Zdárek (eds.): Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29–31, 2015, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 2016, pp. 33–46.

[BD16b]

Eike Best, Raymond Devillers: The Power of Prime Cycles and Distance Paths. Number 03/16 in Berichte aus dem Department für Informatik, 25 pages (November 2016).

[BD16a]

Eike Best and Raymond Devillers: The Power of Prime Cycles, 20 pages. 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, 59-78, DOI: 10.1007/978-3-319-39086-4_5.

[BW16]

Eike Best, Harro Wimmel: Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs. In: Proceedings of the 10th International Workshop on Reachability Problems, 19-21 Sept. 2016, Aalborg, Denmark, pp. 51-62, DOI: 10.1007/978-3-319-45994-3_4.

[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.

[VBB16]

Irina Virbitskaite, Dmitriy Bushin, Eike Best: True Concurrent Equivalences in Time Petri Nets. Fundam. Inform. 149(4)(2016), 401–418.

[HDM16]

Thomas Hujsa, Jean-Marc Delosme and Alix Munier-Kordon: On the Liveness and Reversibility of Equal-Conflict Petri Nets. Fundamenta Informaticae 146 (2016), pp 83-119, doi: 10.3233/FI-2016-1376.

[BB16]

Kamila Barylska, Eike Best: Properties of Plain, Pure, and Safe Petri Nets – with some Applications to Petri Net Synthesis. Proc. ATAED'2016 (Algorithms and Theories for the Analysis of Event Data), Toruń (June 2016), 111–125, (PDF).

[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.

[BESW16b]

Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel: 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.

[Sch16a]

Uli Schlachter, Energie- und Paritätsgewinnbedingungen auf Spielstrukturen. BestMasters, Springer Vieweg, 2016, 87 Seiten.

[BBEMP16]

Kamila Barylska, Eike Best, Evgeny Erofeev, Łukasz Mikulski, and Marcin Piątkowski: Conditions for Petri Net Solvable Binary Words. In ToPNoC (Transactions on Petri Nets and other Models of Concurrency), Jetty Kleijn, Jörg Desel (eds), Springer-Verlag, 11 (2016), pp. 137-159, DOI: 10.1007/978-3-662-53401-4_7.

[BE16]

Eike Best, Javier Esparza: Existence of Home States in Petri Nets is Decidable. Inf. Proc. Letters 116 (2016), 423-427, DOI: 10.1016/j.ipl.2016.01.011.

[BD15d]

E. Best und R. Devillers, Synthesis of Bounded Choice-Free Petri Nets. In: Proc. 26th International Conference on Concurrency Theory (CONCUR 2015), Luca Aceto and David de Frutos Escrig (eds.), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2015, pp. 128-141, DOI: 10.4230/LIPIcs.CONCUR.2015.128, [.pdf].

[VBE15]

Irina Virbitskaite, Elena N. Bozhenkova, Evgeny Erofeev: Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures. In Proceedings of the 24th International Workshop on Concurrency, Specification and Programming, Rzeszow, Poland, September 28-30, 2015, pp. 222-233. [pdf]

[BBEMP15]

Kamila Barylska, Eike Best, Evgeny Erofeev, Łukasz Mikulski, and Marcin Piątkowski. On binary words being Petri net solvable. In: ATAED'2015, Josep Carmona, Robin Bergenthum, Wil van der Aalst (eds), pp. 1-15, http://ceur-ws.org/Vol-1371.

[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, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICE2015.6, DOI:10.4204/EPTCS.189.

[BD15c]

Eike Best and Raymond Devillers. Synthesis of Live and Bounded Persistent Systems. Fundamenta Informaticae Vol. 140 (2015) pp. 1–21, DOI: 10.3233/FI-2015-1243.

[BD15b]

Eike Best and Raymond Devillers. State Space Axioms for T-Systems. Acta Informatica Vol. 52, No 2-3, pp. 133-152 (April 2015), DOI: 10.1007/s00236-015-0219-0.

[BD15a]

Eike Best and Raymond Devillers. Synthesis and Reengineering of Persistent Systems. Acta Informatica, February 2015, Volume 52, Issue 1, pp. 35-60, DOI: 10.1007/s00236-014-0209-7.