• 2015–2018
• 2011–2014

[VFD10] Irina Virbitskaite, Hans Fleischhack, and Anna Dedova. Real arithmetic based verification of prioritized time Petri nets with parameters. In Bulletin of the Novosibirsk Computing Center, volume 31 of Computer Science, Special Issue, pages 179-193. NNC publisher, 2010.

[BDG10] Eike Best, Philippe Darondeau, and Roberto Gorrieri. On the Decidability of Non Interference over Unbounded Petri Nets. In Konstantinos Chatzikokolakis and Véronique Cortier, editors, Proceedings 8th International Workshop on Security Issues in Concurrency, SecCo, volume 51 of EPTCS, pages 16-33, 2010. doi: 10.4204/EPTCS.51.2.

[BGK10] S. Boll, S. Gronewold, and L. Krekeler. Informatik für Migrantinnen und Migranten - Einführung eines neuen Studienprogramms an der Universität Oldenburg. Paderborn, Germany, December 9-10, 2010. 4. Fachtagung Hochschuldidaktik Informatik, HDI. (6 Seiten).

[BMGK10] S. Boll, R. Meinhardt, S. Gronewold, and L. Krekeler. Mit Information über Integration zur Informatik - Studienprogramm "Informatik für Migrantinnen und Migranten". Number 4/2010, pages 56-61. Forum InformatikerInnen für Frieden und gesellschaftliche Verantwortung e. V. (FIfF Kommunikation), 2010.

[VGB10] Irina Virbitskaite, Natalya Gribovskaya, and Eike Best. A Categorical View of Timed Behaviours. Fundamenta Informaticae, 102(1), 2010. 129-143.

[BD10] Eike Best and Philippe Darondeau. Separability in Persistent Petri Nets. In J. Lilius and W. Penczek, editors, Petri Nets 2010, volume 6128 of LNCS, pages 246-266, Berlin, Heidelberg, 2010. Springer-Verlag.

[BD09c] Eike Best and Jörg Desel. On the Reducibility of Persistent Petri Nets. In Kamal Lodaya, Madhavan Mukund, and R. Ramanujam, editors, Perspectives in Concurrency Theory (Festschrift for P. S. Thiagarajan), pages 22-34. Universities Press, Indian Association for Research in Computer Science, 2009.

[BD09b] Eike Best and Philippe Darondeau. Separability in Persistent Petri Nets. Number 03/09 in Berichte aus dem Department für Informatik, pages 1-25. Universität Oldenburg, November 2009. [ .pdf ]

[BD09a] Eike Best and Philippe Darondeau. A Decomposition Theorem for Finite Persistent Transition Systems. Acta Informatica, 46(3):237-254, May 2009.

[BS09] Eike Best and Kerstin Strecker. Relational Semantics Revisited. Electronic Notes in Theoretical Computer Science, 229:27-47, 2009.

[Die08d] Malte Diehl. Steganography as a Serious Alternative to Cryptography. In Proceedings des gemeinsamen Workshops der Graduiertenkollegs 2008, Trustworthy Software Systems, pages 21-22. GITO-Verlag, 2008.

[Die08c] Malte Diehl. Secure Covert Channels in Multiplayer Games. In MM&Sec '08: Proceedings of the 10th ACM Workshop on Multimedia and Security, pages 117-122, New York, NY, USA, 2008. ACM.

[Die08b] Malte Diehl. Kryptographiegesetzgebung im Wandel. Von begrenzten Schlüssellängen zur Schlüsselherausgabe. In Datenschutz und Datensicherheit, volume 04, pages 243-247, 2008.

[Die08a] Malte Diehl. Geographic Data and Steganography. In Proceedings of SECRYPT 2008, International Conference on Security and Cryptography, pages 381-387, Porto, Portugal, 2008.

[DLMS08] Malte Diehl, Henrik Lipskoch, Roland Meyer, and Christian Storm, editors. Proceedings des gemeinsamen Workshops der Graduiertenkollegs 2008: 19.-21. Mai 2008, Dagstuhl, Trustworthy Software Systems, Berlin, 2008. GITO-Verlag.

[Bes08] Eike Best. A Note on Persistent Petri Nets. In P. Degano et al., editor, Montanari Festschrift, volume 5065 of LNCS, pages 427-438, Berlin, Heidelberg, 2008. Springer.

[BD08] Eike Best and Philippe Darondeau. Decomposition Theorems for Bounded Persistent Petri Nets. In K.M. van Hee and R. Valk, editors, PETRI NETS 2008, volume 5062 of LNCS, pages 33-51, Berlin, Heidelberg, 2008. Springer.

[BR08] Eike Best and Astrid Rakow. A Slicing Technique for Business Processes. In Kaschek, Kop, Steinberger, and Fliedl, editors, UNISCON 2008, LNBIP 5, pages 45-51. Springer-Verlag, 2008.

[Wim08] Harro Wimmel. Entscheidbarkeitsfragen bei Petri-Netzen. Habilitationsschrift, Carl von Ossietzky Universität Oldenburg, 2008.

[BDW07] Eike Best, Philippe Darondeau, and Harro Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80:75-90, 2007.

[Rak07] Astrid Rakow. Slicing Petri Nets. Technical report, Carl von Ossietzky Universität Oldenburg, 2007. [ .pdf ]

[SS06] Tim Strazny and Christian Stehno. Ein Simulator für mehrfach erweiterte höhere Petrinetze. In Matthias Becker and Helena Szczerbicka, editors, 19. Symposium Simulationstechnik (ASIM 2006), Frontiers in Simulation, pages 171-176. SCS Publishing House e.V., September 2006.

[BEWW06] Eike Best, Javier Esparza, Harro Wimmel, and Karsten Wolf. Separability in Conflict-free Petri Nets. In I. Virbitskaite und A. Voronkov, editor, Perspectives of Systems Informatics, volume 4378 of Lecture Notes in Computer Science, pages 1-18. Springer-Verlag, 2006.

[Ste05d] Christian Stehno. Recycling Model Checking Tools for New Application Domains. In Christian Stahl Karsten Schmidt, editor, AWPN 2005, Informatik-Berichte, pages 43-48. Humboldt-Universität zu Berlin, September 2005.

[Ste05c] Christian Stehno. Interchangeable High-Level Time Petri Nets. PNML Workshop Helsinki, May 2005.

[Ste05b] Christian Stehno. Interchangeable High-Level Time Petri Nets. Petri Net Newsletter, 69:8-21, October 2005. This is a revised version of [Ste05c] .

[Ste05a] Christian Stehno. A Multi Purpose 3D Simulation Tool Based on Discrete Event Systems. In Karsten Schmidt and Christian Stahl, editors, AWPN 2005, Informatik-Berichte, pages 13-18. Humboldt-Universität zu Berlin, September 2005.

[EFM⁺05]

Christoph Eichner, Hans Fleischhack, Roland Meyer, Ulrik Schrimpf, and Christian Stehno. Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets. In Andreas Prinz, Rick Reed, and Jeanne Reed, editors, SDL 2005: Model Driven, volume 3530 of Lecture Notes in Computer Science, pages 133-148. Springer-Verlag, 2005.

• 2000–2004
• 1987–1999