Parallele Systeme

Veröffentlichungen seit 2011

[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, Springer LNCS, 20 pages.

[BDS17]

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.

[BD16c]

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

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

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

[BD16b]

Eike Best and Raymond Devillers: Characterisation of the State Spaces of Marked Graph Petri Nets. Information and Computation,

Available online 6 June 2016, ISSN 0890-5401, 20 pages. Selected extended papers of LATA'2014, doi: 10.1016/j.ic.2016.06.006.

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

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

[BD14e]

Eike Best and Raymond Devillers. Characterisation of the State Spaces of Marked Graph Petri Nets. Number 03/14 in Berichte aus dem Department für Informatik, pp. 1-21. Universität Oldenburg, December 2014.

[BD14d]

Eike Best and Raymond Devillers. Petri net reengineering may be hard! Petri Net Newsletter Vol. 83, ISDN 0391-1804, Cover Picture, pp. 3-4 (April 2014).

[BD14c]

Eike Best and Raymond Devillers. Synthesis of Persistent Systems. In: Proc. 35rd International Conference on Application and Theory of Petri Nets and Concurrency (Tunis, August 2014), G. Ciardo, E. Kindler (eds.), Springer-Verlag, LNCS 8489, 111-129 (2014).

[BD14b]

Eike Best and Raymond Devillers. Persistent Systems with Unique Minimal Cyclic Parikh Vectors. Technical Report 02/14, Dep. Informatik, Carl von Ossietzky Universität Oldenburg, 80 pages (February 2014).

[BD14a]

Eike Best and Raymond Devillers. Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. In A.-H. Dediu et al. (eds.), Proc. LATA'14 (8th International Conference on Language and Automata Theory and Applications, Madrid, March 2014), LNCS 8370, Springer-Verlag, pp. 161–172.

[Bes13]

Eike Best. Petri Nets at the University of Oldenburg in Germany. In Petri Net Newsletter Vol. 82, ISSN 0391-1804, Gesellschaft für Informatik, 21-23 (April 2013).

[BW13]

Eike Best and Harro Wimmel. Structure Theory of Petri Nets. In: Proc. of the Fifth Advanced Course on Petri Nets, Rostock, 2010, K. Jensen et al. (eds.), ToPNoC VII, volume 7480 of LNCS, pp. 162-224, Berlin, Heidelberg 2013. Springer-Verlag.

[VGB12b]

Irina Virbitskaite, Nataliya Gribovskaya, Eike Best. Some evidence of the consistency of categorical semantics for timed interleaving behaviors. Oldenburg: Univ., Dep. für Informatik, 2012, 34 Seiten, Reihe: Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften, 2012,1.

[VGB12a]

Irina Virbitskaite, Natalya Gribovskaya, and Eike Best. Unifying Equivalences for Timed Transition Systems. In Andrei Voronkov, editor, Turing-100, volume 10 of EPiC Series, pages 386-404. EasyChair, 2012. Proc. The Alan Turing Centenary Conference, Manchester (U.K.), June 22-25.

[BD12]

Eike Best and Philippe Darondeau. Deciding Selective Declassification of Petri Nets. In: Principles of Security and Trust, Pierpaolo Degano and Joshua D. Guttman (eds.), First International Conference, POST 2012 (held as part of ETAPS 2012, Tallinn), volume 7215 of ARCoSS/LNCS, pages 290-308. Springer, 2012. ISBN 978-3-642-28640-7, DOI:10.1007/978-3-642-28641-4_16.

[OVB11b]

Elena Oshevskaya, Irina Virbitskaite, and Eike Best. Relating Categorical Semantics for Higher Dimensional Automata. In: Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P'2011), Marcin Szczuka, Ludwik Czaja, Andrzej Skowron, and Magdalena Kacprzak (eds.),  pages 385-396, Pultusk, 28-30 September 2011. Technical Report, Bialystok University of Technology.

[OVB11a]

Elena Oshevskaya, Irina Virbitskaite, and Eike Best. A Categorical View of Bisimulation for Higher Dimensional Automata. In: Proceedings of the 23rd Nordic Workshop on Programming Theory, Paul Pettersson and Cristina Seceleanu (eds.), pages 102-104, Västeras, Sweden, October 26-28 2011. Technical Report 254/2011, Mälalardalen University.

[BD11c]

Eike Best and Philippe Darondeau. Separability in Persistent Petri Nets. Fundamenta Informaticae, 113:3-4, 2011, pp. 179-203, DOI: 10.3233/FI-2011-606.

[BD11b]

Eike Best and Philippe Darondeau. A Puzzle on Parikh and Language Equivalences. Petri Net Newsletter, Oct. 2011. 3 pages.

[BD11a]

Eike Best and Philippe Darondeau. Petri Net Distributability. In: Proc. PSI'11 (Ershov Informatics Conference), Irina Virbitskaite and Andrei Voronkov (eds.), Novosibirsk, volume 7162 of LNCS, pages 1-18, Berlin, Heidelberg, 2011. Springer-Verlag.