Navigation

Skiplinks

Latest Publications

[DEH18]

Raymond R. Devillers, Evgeny Erofeev, and Thomas Hujsa: Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems, in: Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018, Satellite event of the conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design (ACSD) 2018, Bratislava, Slovakia, June 25, 2018, pp. 75–90, http://ceur-ws.org/Vol-2115/ATAED2018-75-90.pdf.

[BEKMP18]

Kamila Barylska, Evgeny Erofeev, Maciej Koutny, Lukasz Mikulski, and Marcin Piatkowski: Reversing Transitions in Bounded Petri Nets, Fundam. Inform. 157 (4), 2018, pp. 341–357, DOI: 10.3233/FI-2018-1631.

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

[BESW16b]

Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel: Characterising Petri Net Solvable Binary Words. 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, 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.

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

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

Webmaster (Changed: 2018-09-10)