Prof. Dr. Eike Best

Selected Publications:

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

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

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

[BDW07]

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

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

[BFG⁺04]

Eike Best, Hans Fleischhack, Sabine Gronewold, Thomas Scheidsteger, and Ulrike Scheidsteger. Beiträge zur Entwicklung eines Leistungspunktsystems in Fachbereichen Elektrotechnik und Informatik. Technical report, Hochschule Bremen, 2004.

[BK04]

Eike Best and Maciej Koutny. Process Algebra: A Petri-Net-Oriented Tutorial. In Jörg Desel, Wolgang Reisig, and Grzegorz Rozenberg, editors, Lectures on Concurrency and Petri Nets, volume 3098 of Lecture Notes in Computer Science, pages 180-209, 2004.

[BvdA03]

Eike Best and Wil van der Aalst, editors. Applications and Theory of Petri Nets 2003, volume 2679 of Lecture Notes in Computer Science, Eindhoven, The Netherlands, 2003. Springer-Verlag.

[BDK02]

Eike Best, Raymond Devillers, and Maciej Koutny. The Box Algebra = Petri Nets + Process Expressions. Information and Computation, 178:44-110, 2002.

[BS02]

Eike Best and Christian Stehno. Überprüfung vom Steuersystemen mit PEP. Niedersächsiches Ministerium für Wissenschaft und Kultur (Hrsg.): Informationstechnologie an niedersächsischen Hochschulen, März 2002. Seiten 40-41.
[ .pdf ]

[BDK01a]

Eike Best, Raymond Devillers, and Maciej Koutny. Petri Net Algebra. Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2001. 378 pages.

[BDK01c]

Eike Best, Raymond R. Devillers, and Maciej Koutny. Recursion and Petri Nets. Acta Informatica, 37(11-12):781-829, 2001.
[ .ps.gz ]

[BDK01b]

Eike Best, Raymond Devillers, and Maciej Koutny. A Unified Model for Nets and Process Algebras. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, chapter 14, pages 873-944. Elsevier Science, Amsterdam, The Netherlands, 2001.
[ .ps.gz ]

[BW00]

Eike Best and Harro Wimmel. Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. In Mogens Nielsen and Dan Simpson, editors, Application and Theory of Petri Nets, volume 1825 of Lecture Notes in Computer Science, pages 63-82. Springer-Verlag, 2000.
[ .ps.gz ]

[BBF⁺00]

Eike Best, Heiko Burchard, Hans Fleischhack, Andrè Hackmann, Ernst Kretschmann, Stefan Kühnapfel, and Astrid Rakow. Simulation of DNA-Computing. In Anne Condon and Gregorz Rozenberg, editors, Proceedings of DNA6, volume 2054 of Lecture Notes in Computer Science, page 249, 2000.
[ .ps ]

[BR99]

Eike Best and Kerstin M. Richter. Relational semantics revisited. Berichte aus dem Fachbereich Informatik 2/99, Universität Oldenburg, February 1999.
[ .ps.gz ]

[BDK99a]

Eike Best, Raymond Devillers, and Maciej Koutny. The Box Algebra - a Model of Nets and Process Expressions. In Susanna Donatelli and H.C.J.M. (Jetty) Kleijn, editors, Application and Theory of Petri Nets '99, volume 1630 of Lecture Notes in Computer Science, pages 344-363, 1999.

[BDK99b]

Eike Best, Raymond Devillers, and Maciej Koutny. The Box Algebra = Petri Nets + Process Expressions. Berichte aus dem Fachbereich Informatik 14/99, Universität Oldenburg, 1999. 45 pages.
[ .ps.gz ]

[BK99]

Eike Best and Maciej Koutny. Fundamental Study: Operational and Denotational Semantics for the Box Algebra. Theoretical Computer Science, 211:1-83, 1999.

[BL99a]

Eike Best and Alexander Lavrov. Generalised Composition Operations for High-level Petri Nets. Fundamenta Informaticae, 40(2-3):125-163, 1999.
[ .ps ]

[BL99b]

Eike Best and Alexander Lavrov. Generalised Composition Operations for High-Level Petri Nets. Berichte aus dem Fachbereich Informatik 10/99, Universität Oldenburg, 1999. 78 pages.

[BDK99c]

Eike Best, Raymond Devillers, and Maciej Koutny. Recursion in the box algebra. Berichte aus dem fachbereich informatik, Universität Oldenburg, 1999. 38 pages.

[BL99c]

Eike Best and Alexander Lavrov. Weak and Strong Composition of High-Level Petri Nets. In Jos C.M. Baeten and Sjouke Mauw, editors, International Conference on Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pages 194-209. Springer-Verlag, 1999.

[KB99]

Maciej Koutny and Eike Best. Operational and Denotational Semantics for the Box Algebra. Theoretical Computer Science, 211(1-2):1-83, 1999.
[ .ps.gz ]

[BFH⁺98]

Eike Best, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, and Elisabeth Pelz. M-nets: an Algebra of High-level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. Acta Informatica, 35(10):813-857, 1998.
[ .ps.gz ]

[BG98]

Eike Best and Bernd Grahlmann. PEP Documentation and User Guide, Version 1.8. Universität Oldenburg, 1998.
[ .ps.gz ]

[BDK98]

Eike Best, Raymond Devillers, and Maciej Koutny. Petri Nets, Process Algebras and Concurrent Programming Languages. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets II: Applications, volume 1492 of Lecture Notes in Computer Science, pages 1-84. Springer-Verlag, 1998.
[ .ps.gz ]

[BT97a]

Eike Best and Thomas Thielke. Orthogonal Transformations for Coloured Petri Nets. In G. Balbo and P. Azéma, editors, Application and Theory of Petri Nets, volume 1248 of Lecture Notes in Computer Science, pages 447-466, Berlin, Germany, 1997. Springer-Verlag.
[ .ps.gz ]

[BdBP97]

Eike Best, Frank S. de Boer, and Catuscia Palamidessi. Partial Order and SOS Semantics for Linear Constraint Programs. In David Garlan and Daniel Le Métayer, editors, Coordination Languages and Models, volume 1282 of Lecture Notes in Computer Science, pages 256-273. Springer-Verlag, 1997.
[ .ps.gz ]

[BEG⁺97]

Eike Best, Javier Esparza, Bernd Grahlmann, Stephan Melzer, Stefan Römer, and Frank Wallner. The PEP verification system. In FEmSys, 1997.

[BT97b]

Eike Best and Thomas Thielke. Refinement of Coloured Petri Nets. In Bogdan S. Chlebus and Ludwik Czaja, editors, Fundamentals of Computation Theory, volume 1279 of Lecture Notes in Computer Science, pages 105-116, Berlin, Germany, 1997. Springer-Verlag.
[ .ps.gz ]

[BP96]

Eike Best and Catuscia Palamidessi. Linear Constraint Systems as High-Level Nets. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR, volume 1119 of Lecture Notes in Computer Science, pages 498-513. Springer-Verlag, 1996.
[ .ps.gz ]

[Bes96a]

Eike Best. A Memory Module Specification Using Composable High-Level Petri Nets. In Manfred Broy, Stephan Merz, and Katharina Spies, editors, Formal Systems Specification, volume 1169 of Lecture Notes in Computer Science, pages 109-159. Springer-Verlag, 1996.
[ .ps.gz ]

[Bes96b]

Eike Best. Partial Order Verification with PEP. In G. Holzmann, D. Peled, and V. Pratt, editors, Partial Order Methods in Verification, pages 305-328, Princeton, 1996. American Mathematical Society.
[ .ps.gz ]

[Bes96c]

Eike Best. Semantics of Sequential and Parallel Programs. International Series in Computer Science. Prentice Hall, 1996. Verbesserte und erweiterte Übersetzung von: Semantik. Theorie sequentieller und paralleler Programmierung, Vieweg-Verlag, 1995.

[GB96]

Bernd Grahlmann and Eike Best. PEP - More than a Petri Net Tool. In Tiziana Margaria and Bernhard Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 397-401. Springer-Verlag, 1996.
[ .ps.gz ]

[BFF⁺95a]

Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, and Elisabeth Pelz. A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)². In Giorgio De Michelis and Michel Diaz, editors, Application and Theory of Petri Nets, volume 935 of Lecture Notes in Computer Science, pages 103-120. Springer-Verlag, 1995.
[ .ps.gz ]

[BFF⁺95b]

Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, and Elisabeth Pelz. An M-net Semantics of B(PN)². In Jörg Desel, editor, Structures in Concurrency Theory, pages 85-100. Springer-Verlag, 1995.
[ .ps.gz ]

[BF95]

Eike Best and Hans Fleischhack. PEP: Programming Environment Based on Petri Nets, Workshop, October 11-12, 1994, HU Berlin. Technical Report 14/95, Universität Hildesheim, 1995.
[ .ps.gz ]

[BG95]

Eike Best and Bernd Grahlmann. PEP Documentation and User Guide Version 1.4. Universität Hildesheim, 1995.
[ .ps.gz ]

[BK95a]

Eike Best and Maciej Koutny. A Refined View of the Box Algebra. In Giorgio De Michelis and Michel Diaz, editors, Application and Theory of Petri Nets, volume 935 of Lecture Notes in Computer Science, pages 1-20. Springer-Verlag, 1995.
[ .ps.gz ]

[BK95b]

Eike Best and Maciej Koutny. Solving recursive net equations. In Zoltán Fülöp and Ferenc Gécseg, editors, Automata, Languages and Programming, volume 944 of Lecture Notes in Computer Science, pages 605-623. Springer-Verlag, 1995.
[ .ps.gz ]

[BH93]

Eike Best and Richard P. Hopkins. B(PN)² - a Basic Petri Net Programming Notation. In Arndt Bode, Mike Reeve, and Gottfried Wolf, editors, PARLE, volume 694 of Lecture Notes in Computer Science, pages 379-390. Springer-Verlag, 1993.

[BE92]

Eike Best and Javier Esparza. Model Checking of Persistent Petri Nets. In 5th Workshop Computer Science Logic, volume 626 of Lecture Notes in Computer Science, pages 35-52. Springer-Verlag, 1992.

[BD09b]

Eike Best and Philippe Darondeau. Separability in Persistent Petri Nets. Technical Report 03/09, Universitat {O}ldenburg, November 2009.
[ .pdf ]