PUBLICATIONS AND PROFESSIONAL ACTIVITIES … AND PROFESSIONAL ACTIVITIES Eike Best ... (grant holder of Alexander-von-Humbo ldt-Stiftung), 2005-2006. ... A Petri-Net-Oriented Tutorial“

PUBLICATIONS AND PROFESSIONAL ACTIVITIES

Eike Best (December 2010)

Addresses

University Professor Eike BestFakultat Informatik und Wirtschafts- und RechtswissenschaftenDepartment InformatikCarl-von-Ossietzky-Universitat OldenburgD-26111 Oldenburg, Germanyemail : [email protected], Tel: +49 441 7982973, FAX: +49 441 7982965Home page: http://parsys.informatik.uni-oldenburg.de/∼best

Private Philipp-de-Haas-Str. 23, D-26125 Oldenburg, GermanyTel. and (voice) FAX: +49 441 3990311.

Activities 2000 – 2010: pages 2-10; 1974 – 1999: pages 11-28.

Contents

1 BOOKS 2

2 EXTERNAL FUNDING, TOOLS 2

3 REFEREED JOURNAL PUBLICATIONS 3

4 CONFERENCE PUBLICATIONS 4

5 OTHER REFEREED PUBLICATIONS 4

6 INVITED PUBLICATIONS 5

7 TECHNICAL REPORTS 5

8 LECTURE NOTES 5

9 ORGANISATION OF EVENTS 6

10 TEACHING 6

11 ADMINISTRATION 8

12 OTHER COURSES 9

13 INVITATIONS, MEMBERSHIPS, REFEREEING 9

14 LECTURES GIVEN AND VISITS MADE 10

15 VINTAGE, MISCELLANEOUS LITERATURE 11

1

Activities since 2000

1 BOOKS

Original books

”Petri Net Algebra“.

Springer-Verlag, 380 pages (January 2001), ISBN 3-540-67398-9 (with Raymond Devillers and MaciejKoutny)

Edited books

”Applications and Theory of Petri Nets 2003“.

24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003. Procee-dings, Springer-Verlag, Lecture Notes in Computer Science, Vol. 2679 (2003), ISBN 3-540-57208-2 (withWil v.d. Aalst)

2 EXTERNAL FUNDING, TOOLS

Externally Funded Projects

• DARTS: Design and Analysis Methods for Real-Time Systems. DFG-funded cooperative projectwith the Russian Academy of Sciences at Nowosibirsk, 2009-2011 (with Prof. Irina Virbitskaite).

• Projekt zur Verbesserung des Ubungsbetriebs in der Informatik. 2007-2009 (with Hans Fleischhack).

• Langzeitstudierenden-Projekt ENDSPURT: 2006-2008 (with Hans Fleischhack).

• Trustsoft (Trustworthy Software Systems, http://trustsoft.uni-oldenburg.de/), 2005-2009.Supported by the DFG (Deutsche Forschungsgemeinschaft) in its Graduate School Programme.As of January 2008, I am in charge of two Trustsoft PhD projects (Astrid Rakow and Malte Diehl).

• Comete (Concepts and Analysis Methods for Mobile and Time Critical Systems), 2004-2005. Sup-ported by the DAAD in its PROCOPE programme (with the University of Paris-Creteil).

• BLK (Bund-Lander-Kommission) project on new curricula (2000-2004):http://blk-lps.informatik.uni-oldenburg.de/ (with Hans Fleischhack).

• JIP (Java in PEP), 2001-2003. Supported by the DAAD (Deutscher Akademischer Austauschdienst)in its Germany/U.K. exchange programme (with the University of Newcastle upon Tyne).

• BAT (Box Algebra with Time), 1998-2001. Supported by the DAAD in its ARC programme (withthe University of Newcastle upon Tyne).

• PORTA (Partial Order Real-Time Analysis), 1999-2002. Supported by the DAAD in its PROCOPEprogramme (with the University of Paris-Orsay).

2

External Funds Supporting Specific Persons

• Dr. Igor Tarasyuk, Universitat Nowosibirsk, Russland (DAAD grant holder), September-October2008.

• Prof. Dr. Li Sek Su, Universitat Pjongyang, North Korea (grant holder of Alexander-von-Humboldt-Stiftung), 2005-2006.

• Dr. Igor Tarasyuk, Universitat Nowosibirsk, Russland (DAAD grant holder), 2005-2006.

• Andreea Barbu (grant holder of Robert-Schumann-Stiftung to support French-German PhD co-tutelle), 2000-2003.

• Dr. Alexander Lavrov (grant holder of Alexander-von-Humboldt-Stiftung), 1996-2000 (earning hisHabilitation in 2000). Update (December 2007): Dr. Lavrov gained an offer of a professorship atFachhochschule Kaiserslautern-Pirmasens.

Tool Construction

”PEP - a Programming Environment Based on Petri Nets“.

Initially funded by the DFG (Deutsche Forschungsgemeinschaft), and since 2003 hosted by SourceForgeat http://sourceforge.net/projects/peptool (with Christian Stehno and Bernd Grahlmann)

”Various Advanced Student Projects“.

STEGO (2008-2009): Steganography. (with Malte Diehl, Hans Fleischhack, Martin Hilscher, Elke Wil-keit). STETZ (2006-2007): Studieneingangstests. (with Hans Fleischhack, Christian Stehno, Elke Wilkeit,Harro Wimmel). P-UMLaut (2005-2006): Modelling, Simulation, and Visualization of Complex Systems.KoSI (2000-2001): Kooperative Spiele im Internet. KerMod (2002-2003): Ein moderationsunterstutzendesTool.

Participation in Fairs and Exhibitions

• CeBIT, Hannover, 2006: P-UMLaut.

• CeBIT, Hannover, 2004: KerMod.

3 REFEREED JOURNAL PUBLICATIONS

”A Categorical View of Timed Behaviours“.

Fundamenta Informaticae, Vol. 102(1), 129-143 (2010). (with Irina Virbitskaite and Natalya Gribovskaya)

”A Decomposition Theorem for Finite Persistent Transition Systems“.

Acta Informatica 46(3), 237-254 (May 2009). (with Philippe Darondeau)

”Making Petri Nets Safe and Free of Internal Transitions“.

Fundamenta Informaticae 80, 75-90 (2007). (with Philippe Darondeau and Harro Wimmel)

”The Box Algebra = Petri Nets + Process Expressions“.

3

Information and Computation 178 (2002), 44-100 (with Raymond Devillers and Maciej Koutny)

”Recursion and Petri Nets“.

Acta Informatica 37 (2001), 781-829 (with Raymond Devillers and Maciej Koutny)

4 CONFERENCE PUBLICATIONS

(‘LNCS’ means Springer Lecture Notes in Computer Science.)

”On the Decidability of Non Interference over Unbounded Petri Nets“.

Proc. SecCo’2010, 8th Intl. Workshop on Security Issues in Concurrency, 1-15 (ed. Kostas Chatzikokola-kis). (with Philippe Darondeau and Roberto Gorrieri)

”Separability in Persistent Petri Nets“.

In Petri Nets 2010 (J. Lilius, W. Penczek, eds), Springer-Verlag, LNCS 6128, 246-266 (2010). (with Phil-ippe Darondeau)

”Relational Semantics Revisited“.

Proc. SOS-2008 (M. Hennessy, B. Klin, eds), ENTCS 229:27-47, www.elsevier.nl/locate/entcs (Au-gust 2009) (with Kerstin Strecker)

”Decomposition Theorems for Bounded Persistent Petri Nets“.

Proceedings of ATPN’08, K.v. Hee, R. Valk (eds), Xi’An, Springer-Verlag, LNCS 5062, 33-51 (2008)(with Philippe Darondeau)

”Reducing k-safe Petri Nets to Pomset-equivalent 1-safe Petri Nets“.

PN’2000, 21st International Conference on Applications and Theory of Petri Nets, M. Nielsen, D. Simp-son (eds), Springer-Verlag, LNCS 1825, Arhus, Denmark (June 2000), 63-82 (with Harro Wimmel)

”Simulation of DNA-Computing (1-page abstract of a poster presentation)“.

Proceedings of DNA6, Leiden, June 13-17 (2000) (with Heiko Burchard, Hans Fleischhack, Andre Hack-mann, Ernst Kretschmann, Stefan Kuhnapfel and Astrid Rakow)

5 OTHER REFEREED PUBLICATIONS

”On the Reducibility of Persistent Nets“.

In Festschrift for P.S. Thiagarajan, Kamal Lodaya, Madhavan Mukund, R. Ramanujam (eds), Perspec-tives in Concurrency Theory, Universities Press / Indian Association for Research in Computer Science,22-34 (2009). (with J. Desel)

”A Note on Persistent Petri Nets“.

In Festschrift for Ugo Montanari, P. Degano, R. de Nicola, R. Gorrieri (eds), Springer-Verlag, LNCS5065, 427-438 (2008)

”A Unified Model for Nets and Process Algebras“.

Chapter 14 in: Handbook on Process Algebra, eds.: J.A.Bergstra, A.Ponse, S.S.Smolka, North Holland,873-944, ISBN 0-444-82830-3 (2001). (with R.Devillers and M.Koutny)

4

6 INVITED PUBLICATIONS

”A Slicing Technique for Business Processes“.

In Kaschek, Kop, Steinberger, and Fliedl, editors, UNISCON 2008, LNBIP 5, 45-51, Springer-Verlag(2008). (with Astrid Rakow)

”Separability in Conflict-free Petri Nets“.

In I. Virbitskaite und A. Voronkov (eds), Perspectives of Systems Informatics, volume 4378 of LectureNotes in Computer Science, 1-18. Springer-Verlag (2006). (with Javier Esparza, Harro Wimmel, andKarsten Wolf)

”Process Algebra: A Petri-Net-Oriented Tutorial“.

Contribution for the 4th Advanced Course on Petri Nets, in Jorg Desel, Wolgang Reisig, and GrzegorzRozenberg, editors, Lectures on Concurrency and Petri Nets, volume 3098 of Lecture Notes in ComputerScience, 180-209 (2004). (with Maciej Koutny)

”Entwicklung eines Leistungspunktsystems in Fachbereichen Elektrotechnik und Informatik“.

Im Abschlussbericht zu einem BLK-Modellversuchsprojekt, Gerhard Wenke, Heike Tauerschmidt (eds)(2004). (with Hans Fleischhack, Sabine Gronewold, Thomas Scheidsteger, Ulrike Scheidsteger)

”Uberprufung vom Steuersystemen mit PEP“.

Niedersachsiches Ministerium fur Wissenschaft und Kultur (Ed.): Informationstechnologie an niedersachsi-schen Hochschulen (March 2002), 40-41 (with Christian Stehno)

7 TECHNICAL REPORTS

”Separability in Persistent Petri Nets“.

Number 03/09 in Berichte aus dem Department fur Informatik, 25 pages. C.v.O. Universitat Oldenburg(November 2009). (with Philippe Darondeau)

8 LECTURE NOTES

”Komplexitatstheorie“.

Vorlesungsskript 2009-2010, in German

”Modelchecking“.


”Theoretische Informatik 1“.

Comprehensive set of slides, 2007-2010, in German

”Petrinetze, part II“.

Vorlesungsskript 2006-2009, in German (with Harro Wimmel)

”Effiziente Algorithmen“.


”Kryptographie“.

5

Vorlesungsskript 2004, in German

”Petrinetze, part I“.

Vorlesungsskript 2003-2009, in German (with Harro Wimmel)

”Theoretische Informatik 2“.


”Theorie und Spiele“.


”Automatentheorie und Logik“.


”Komplexitatstheorie“.

Vorlesungsskript 1990-2000, in German (with J. Esparza and M. Soding)

9 ORGANISATION OF EVENTS

• Workshop of a BLK Project on New Curricula, Oldenburg, November 13-14, 2003; approximately20 participants.

• BAT/JIP Workshop, December 2001 (1 week), Oldenburg; approximately 10 participants.

10 TEACHING

Supervision and Examination

• Ongoing supervision as of January 2008: Malte Diehl, Astrid Rakow, Christian Stehno (PhD Thesis),several MSc and BSc Theses.

• Principal supervisor of:

– Many Diplom and MSc Theses (Detlef Hillen, Claudia Toussaint, Uwe Deichmann, TomasTalanis, Holger Schirnick, Wolfgang Fischer, Matthias Friese, Thomas Thielke, Stefan Romer,Robert-Christoph Riemann, Uwe Hackl, Hartmut True, Burkhard Graves, Theo Ehard-Zieb,Tobias Himstedt, Lars Jenner, Stefan Melzer, Bernd Teßmer, Martina Johl, Ulrich Anhalt,Matthias Moeller, Burkhard Bieber, Katharina Wegener, Carola Pohl, Martin Ackermann,Christoph Gerlach, Holger Krekel, Kerstin Maike Richter, Johannes Jager, Michael Kater,Ulf Fildebrandt, Stefan Schwoon, Stefan Kauer, Stefan Liesche, Manuela Kunz, Peter Har-ders, Christian Stehno, Ernst Kretschmann, Andre Hackmann, Astrid Rakow, Matthias Brill,Niklas Mehner, Andreas Marshall, Oliver Erdmann, Jorg Dannemann, Michael Kohrmann,Uwe Viergutz, Rene Hess, Margarete Muhle, Ulrich Hobelmann, Harry Egbers, Felix Fontein,Frank Nagel, Ortwin Escher, Anke Mangels, Tim Strazny, Robert Bleiker, Helge Hartmann,Ana-Maria Mesaros, Patrik Schulz, Iris Wilde, Jan Jelschen, Holger Lubitz),

– One U.K. MSc Thesis (Alex Ruskin),

– Several PhD Theses (Lucia Pomello, Hans-Gunther Linde-Goers, Robert-Christoph Riemann,Bernd Grahlmann, Thomas Thielke, Andreea Barbu),

6

– And three Habilitation Theses (Javier Esparza, Alexander Lavrov, Harro Wimmel).

• External examiner of:

– Several PhD Theses (Agathe Merceron-Brecht, Lucia Pomello, Javier Esparza, Antti Valmari,Jurgen Schepers, Rob J. van Glabbeek, Julian Bradfield, Hanna Klaudel, Jon G. Hall, LucaBernardinello, Wojciech Fraczak, Twan Basten, Stefan Keuer, Robert-Christoph Riemann,Harro Wimmel, Karsten Schmidt, Keijo Heljanko, Stephan Melzer, Arnim Wedig, MichaelWeber),

– Two Habilitation Theses (Robert Lorenz, Louchka Popova-Zeugmann)

– And one Tesi di Laureo (Oliver Botti).

• Furthermore, I have been co-examiner for many BSc, MSc, Diplom and PhD Theses.

Recent Teaching

At the Carl-von-Ossietzky-Universitat Oldenburg (from 1996 onwards):

(a) Standard (undergraduate) Courses:

Wintersemester: Theory of Computing (4 hours per week + 2 hours per week exercises)Complexity Theory (4 hpw + 2 hpw exercises)

Sommersemester: Basic Logic (4 hpw + 2 hpw exercises)Automata Theory and Logic (4 hpw + 2 hpw exercises).

From 2000 onwards, these courses have changed into teaching modules of 6 ECTS each (6 EuropeanCredit Transfer System points average between 150 to 180 hours of students’ work per semester).

In addition, I also offer regular seminars, programming and teamwork courses (project work), as wellas special lectures in Theoretical Computer Science and related areas. In irregular intervals I also teachother beginners’ courses. I have taught all basic subjects including Programming, Algorithms and DataStructures, Machine Architecture and Languages, Automata and Complexity several times.

(b) Special Courses and Seminars (in addition to undergraduate teaching):

Sommersemester 2008: Petri Nets (2 hpw + 2 hpw exercises), STEGO (8hpw)Wintersemester 2007/2008: Modelchecking (2 hpw + 2 hpw exercises)Sommersemester 2007: Basic Logic (2 hpw + 2 hpw exercises),

STETZ, continued (8hpw)Wintersemester 2006/2007: Petri Nets, Part II (2 hpw + 2 hpw exercises)

STETZ: Project Group on Tests (8hpw)Sommersemester 2006: Automata Theory and Logic (2 hpw + 2 hpw exercises),

Efficient Algorithms (2 hpw + 2 hpw exercises)Wintersemester 2005/2006: Theory of Computing (2 hpw + 2 hpw exercises)Sommersemester 2005: Petri Nets (2 hpw + 2 hpw exercises),

P-UMLaut, continued (8hpw)Wintersemester 2004/2005: Automata Theory and Logic (2 hpw + 2 hpw exercises)

P-UMLaut: Project Group on UML and Petri Nets (8hpw)Seminar on Cryptography (2 hpw)

Sommersemester 2004: Petri Nets (2 hpw + 2 hpw exercises),Cryptography (2 hpw + 2 hpw exercises)Seminar on Graph Theory (2 hpw)

7

Wintersemester 2003/2004: Sabbatical / KerMod, continued (8 hpw)Sommersemester 2003: Petri Nets (2 hpw + 2 hpw exercises),

KerMod: Project Group on Soft Skills, continued (8 hpw),Seminar on Applications of Petri Nets (2 hpw)

Wintersemester 2002/2003: Theory of Computing (2 hpw + 2 hpw exercises)Seminar on Real-Time Java (2 hpw)

Sommersemester 2002: Automata Theory and Logic (4 hpw + 2 hpw exercises)KerMod: Project Group on Soft Skills (8 hpw),

Wintersemester 2001/2002: Model-Checking based on Partial Orders (2 hpw)Seminar on Real-Time Java (2 hpw)

Sommersemester 2001: Petri Nets (3 hpw + 1 hpw exercises)The OS part of Beginners Lecture on Computing (due to illnessof a colleague) (4 hpw + 2 hpw exercises, for 3 weeks in a row)Project Group on Bridge Programming, continued (8 hpw)

Wintersemester 2000/01: Project Group on Bridge Programming (8 hpw)Sommersemester 2000: Theory and Games (3 hpw + 1 hpw exercises)

Seminar on Modal LogicWintersemester 1999/00: Automata Theory and Logic (4 hpw + 2 hpw exercises)

Efficient Algorithms (2 hpw)Advanced Project: DNA Computing (4 hpw)

11 ADMINISTRATION

Administrative work at the Universitat Oldenburg:

Recent: I have been elected Director of the Department of Computing Science since October 1, 2009.

Past:

Almost starting simultaneously with my move to the University of Oldenburg (1996-97), I have beeninvolved in the conception and the planning of new, modularised curricula in Computing Science. I havebeen instrumental both in changing the structure of the existing Diplom curriculum into a scheme sup-porting modularisation, as well as in conceiving and realising (including successfully accrediting) a BSccurriculum - one of the first in Germany. During this work, I have been a member in the Studienkom-mission (Board of Studies) from April 1998 to May 1999, and have also served as the Chairman of thisCommittee from November 1999 to March 2000.

In April 2000, for 2.5 years until the end of September 2002, I was elected Dean of the (then) Facultyof Computing Science. During this period, the Faculty successfully underwent its first External ResearchEvaluation (beginning of 2001), which is to be held every five years. Moreover, the University decidedto merge the Faculties of Computing Science and the Faculty of Business Administration into a single,larger Faculty in 2002, creating, after an initial unsuccessful period of opposition, plenty of additional -but hopefully, transitional - work for us, and for me in particular.

Apart from these particularly time-concuming jobs, I also direct the Division of Parallel Systems, and Ihave been a member of the Diplomprufungsausschuß (Committee for the Diplom Curriculum) betweenOctober 1998 and September 2002, serving as its Chairman between October 1998 and March 2000. Onthe University level, I have been the representative of our Faculty in a Senate Subcommitte dealing withTeaching (the Kommission fur Lehre, Studium und Weiterbildung) between April 1999 and March 2001.

8

12 OTHER COURSES

I have been a lecturer in the Fourth Advanced Course on Petri Nets in Eichstatt (September 2003). Ihave also been invited to be a lecturer at the Fifth Advanced Course on Petri Nets in Rostock (September2010). Actually, I am one of the few persons to have been a lecturer in four courses on Petri nets thathave been held between 1979 and 2003, and I will probably be the only one who will have been a lecturerat all five Advanced Courses on Petri Nets.

13 INVITATIONS, MEMBERSHIPS, REFEREEING

• I’ve been a reviewer for:

(i) Books: MIT Press, Springer-Verlag, Cambridge University Press;

(ii) Periodicals: Acta Informatica, Theoretical Computer Science, JCSS, Science of ComputerProgramming, Information and Computation, Advances in Petri Nets, MST, IPL, FundamentaInformaticae, JCSS, Journal of Computer Science and Technology, The Computer Journal, andothers;

(iii) Conferences: CONCUR, ICALP, STACS, International Conference on Applications andTheory of Petri Nets, MFCS, and others; miscellaneous Workshops.

(iv) Research grant bodies: Canadian Science Research Council, Commission of the EuropeanCommunities, Deutsche Forschungsgemeinschaft, Studienstiftung des deutschen Volkes, Bri-tish EPSERC (Science and Engineering Research Council), DAAD, Alexander-von-Humboldt-Stiftung, Finnisch Academy of Sciences (Centres of Excellence).

(v) Search Commissions: Javier Esparza (Technical University of Munich, 2005), Agathe Mer-ceron (TFH Berlin, 2006).

• Steering Committee, CONCUR series of yearly conferences, since 1991.

• Program Committee, IARCS Annual Conference on Foundations of Software Technology and Theo-retical Computer Science, FSTTCS (Chennai, December 2010).

• Program Committee, ICATPN’2009 (Paris, June 2009).

• Program Committee, CONCUR’2008 (Toronto/Canada, August 2008).

• Program Committee, ICATPN’2008 (Xi´an, China, June 2008).

• Program Committee, ACSD’04 (Hamilton/Canada, 2004).

• Program Committee, ICALP’2003 (Eindhoven, The Netherlands, June/July 2003).

• Program Committee, ICATPN’2003 (Eindhoven, The Netherlands, June 2003) – Theoretical PapersChairman.

• Program Committee, CONCUR’2002 (Brno, July 2002).

• Program Committee, ACSD’01 (Newcastle upon Tyne, UK, June 2001) – invited but declined.

• Program Committee, ICATPN’2000 (Arhus, Denmark, June 2000).

• Program Committee, CONCUR’2000 (Philadelphia, July 2000).

9

14 LECTURES GIVEN AND VISITS MADE

• Organisation of the following list: Location, date; topic of talk; duration of event.

• Paris, 22. August - 11. September 2010 (CONCUR’10, SecCo’2010 [talk] and Research Visit); 20days.

• Braga, 20.-26. June 2010 (Petri Nets 2010 [talk] and ART workshop); 6 days.

• Paris, 24.-25. November 2009 (Habilitation Franck Pommereau); 5 days.

• Bologna, 31. August - 6. September 2009 (CONCUR’09 and IFIP 2.2 meeting); 7 days.

• Rennes, 1.-28. February 2009 (Research Visit); Separability; 28 days.

• Paris, 27.-31. January 2009 (Research Visit); 5 days.

• Toronto, 12.-14. September 2008 (IFIP 2.2 meeting); Separability; 7 days.

• Toronto, 17.-24. August 2008 (CONCUR’08); 7 days.

• Reykjavik, 5.-12. July 2008 (SOS’08 and ICALP’08); Relational Semantics Revisited; 7 days.

• Xi’An, 21.-28. June 2008 (PN’08); Decomposition Theorems for Persistent Petri Nets; 7 days.

• Dagstuhl, 19.-21. May 2008 (TrustSoft Graduate School Meeting); 3 days.

• Klagenfurt, 22.-25. April 2008 (UNISCON-08); Slicing Technique for Business Processes; 4 days.

• LORIA Nancy, 16.-20. September 2007 (IFIP 2.2 meeting); Separability in Petri Nets; 4 days.

• Lisbon University, 3.-9. September 2007 (CONCUR’07); 4 days.

• Dortmund, 15. June 2004; Pomset-Equivalence in Petri Nets; 1 day.

• Lubeck, 26. November 2003; Pomset-Equivalence in Petri Nets; 1 day.

• Herrsching, 30. September - 2. October 2003 (Theorietag der GI - Gesellschaft fur Informatik);Pomset-Equivalence in Petri Nets; 3 days.

• Universitat Eichstatt, 15.-17. September 2003; Process Algebra; 3 days.

• Fachhochschule Stralsund, 20.-24. November 2002; Project Work on New Curricula (BLK-Projekt);5 days.

• Brno University, 19.-25. August 2002 (CONCUR’02); Presentation of PEP; 7 days.

• Aalborg University, 19.-23. August 2001 (CONCUR’01); 4 days.

• University of Newcastle upon Tyne, 15.-18. August 2001; Project Work, 4 days.

• University of Newcastle upon Tyne, 25.-30. June 2001; 6 days.

• Universitat Dortmund, 28. November 2000; Concurrency and Compositionality; 1 day.

10

Activities before 2000

15 VINTAGE, MISCELLANEOUS LITERATURE

BOOKS

”Semantics of Sequential and Parallel Programs“.

Prentice Hall International Series in Computer Science, 356 pages, 1996, ISBN 0-13-460643-4 (revised Englishtranslation of ‘Semantik’)

”Semantik. Theorie sequentieller und paralleler Programmierung“.

Verlag Vieweg, 380 pages, 1995, ISBN 3-528-05431-X

”CONCUR’93“.

4th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993, Proceedings, Springer-Verlag, Lecture Notes in Computer Science, Vol. 715 (1993), ISBN 3-540-40334-5

”Kausale Semantik nichtsequentieller Programme“.

R. Oldenbourg Verlag, GMD-Bericht Nr.174, 250 pages, 1989, ISBN 3-486-21322-9

”Nonsequential Processes: a Petri Net View“.

Springer EATCS Monographs on Theoretical Computer Science Vol.13, 130 pages, 1988, ISBN 0-387-19030-9 (withCesar Fernandez)

”Auswirkungen des Datenschutzes: a Co-Authored Study of GMD“.

R. Oldenbourg Verlag GmbH, Munchen, 1979. (List of authors: Fevzi Belli, Eike Best, Bernd Demant, ThomasGertner, Edmund Hogrebe, Mark Karhausen, Uwe Kerstan, Antje Pieper, Peter Reichelt, Barbara Schmidt-Belz,Lotte Tuner)

EXTERNALLY FUNDED PROJECTS, PERSONS, and TOOLS

• ANT (Algebraic Net Theory), 1996-1999. Supported by the DAAD in its ARC programme (with the Uni-versity of Newcastle upon Tyne).

• POEM (Programming Environment Based on M-Nets), 1996-1997 Supported by the DAAD in its PROCOPEprogramme (with the University of Paris-Orsay).

• VW-Stiftung cooperation project FOMD (Formal Methods of Systems Design, 1995-97 with Novosibirsk).

• Participation in the EU-Network EXPRESS (1992-96, led by J.W.Klop).

• PEP (Programming Environment Based on Petri Nets), a project financed by the DFG (Deutsche For-schungsgemeinschaft) (January 1993-September 1999).

• Project Leadership: CALIBAN (Causal Calculi Based on Nets), Esprit Basic Research Working GroupNo.6067 (July 1992-July 1995).

• Project Leadership: DEMON (Design Methods Based on Nets), Esprit Basic Research Actions No.3148 (June1989-March 1992).

• Dr. Igor Tarasyuk (DAAD grant holder), 1996-1998.

• CeBIT, Hannover, March 8-March 15, 1995: PEP.

• CeBIT, Hannover, March 16-March 23, 1994: PEP.

• Dr. Johan Lilius (DAAD Visiting Professor), 1993 (one semester).

• Dr. Johan Lilius (DAAD Visiting Professor), 1992 (one semester).

11

JOURNAL PUBLICATIONS (refereed)

”Generalised Composition Operations for High-level Petri Nets“.

Fundamenta Informaticae 40 (1999), 125-163 (with Alexander Lavrov)

”Fundamental Study: Operational and Denotational Semantics for the Box Algebra“.

Theoretical Computer Science 211, 1-83 (1999) (with Maciej Koutny)

”M-nets: an Algebra of High-level Petri Nets, with an Application to the Semantics of Concurrent Programming

Languages“.Acta Informatica, 813-857 (1998) (with Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel and Elisabeth Pelz)

”Compositional Generation of Home States in Free Choice Systems“.

Formal Aspects of Computing 4, 572-581 (1992). (with Ludmila Cherkasova and Jorg Desel)

”Traps Characterise Home States in Free Choice Systems“.

Theoretical Computer Science 101, 161-176 (1992). (with Jorg Desel and Javier Esparza)

”Petri Net Semantics of Priority Systems“.

Theoretical Computer Science 96, 175-215 (1992). (with Maciej Koutny)

”Concurrent Bisimulation in Petri Nets“.

Acta Informatica, 231-264 (1991). (with Raymond Devillers, Astrid Kiehn and Lucia Pomello)

”Partial Order Structure and Behaviour of Petri Nets“.

Formal Aspects of Computing Vol.2(2) (1990), 123-138. (with Jorg Desel)

”Semantic Independence“.

Science of Computer Programming, Vol.13(1) (December 1989), 23-50. (with Christian Lengauer)

”Sequential and Concurrent Behaviour in Petri Net Theory“.

Theoretical Computer Science, Vol.55, No.1 (November 1987), 87-136. (with Raymond Devillers)

”D-continuity and Petri’s Axioms of Concurrency for Nonsequential Process Models“.

Fundamenta Informaticae (1987) Vol.X, 161-212 (1987). (with Agathe Merceron)

”Comments on a paper by A.Mili“.

IEEE Transactions on Computers Vol.C-34(1) (1985), 97-98. (with Flaviu Cristian)

”Free Choice Systems have Home States“.

Acta Informatica Vol.21 (1984), 89-100. (with Klaus Voss)

”Fairness and Conspiracies“.

IPL Vol.18, No.4 (May 1984), 215-220. Erratum: IPL Vol.19 (October 1984), p.162.

”Adequacy Properties of Path Programs“.

Theoretical Computer Science Vol.18 (1982), 149-171

”Systematic Detection of Exception Occurrences“.

Science of Computer Programming, Vol.1 (1981), 115-144. (with Flaviu Cristian; –reprinted in: Reliable ComputerSystems (ed. Santosh Shrivastava), Springer Texts & Monographs in Computer Science (1985))

”A Formal Model of Atomicity in Asynchronous Systems“.

Acta Informatica Vol.16 (1981), 93-124. (with Brian Randell; –reprinted in: Reliable Computer Systems (ed. San-tosh Shrivastava), Springer Texts & Monographs in Computer Science (1985))

”A Theorem on the Characteristics of Non-sequential Processes“.

Fundamenta Informaticae, Series IV, Vol.3, No.1 (1980), 77-94

”A Note on the Proof of a Concurrent Program“.

IPL Vol.9, No.3 (October 1979), 103-104

12

JOURNAL PUBLICATIONS (other periodicals)

”Coloured Nets with Curry: a multirelation-based linear algebra for high-level Petri nets“.

Petri Net Newsletters No. 50, 27-44 (April 1996). (with Thomas Thielke)

”Second Progress Report of the Esprit Basic Research Working Group No.6067 CALIBAN“.

EATCS Bulletin No.54, 90-104 (1994)

”First Progress Report of the Esprit Basic Research Working Group No.6067 CALIBAN“.

EATCS Bulletin No.51 (1993)

”DEMON - an ESPRIT Basic Research Action (No.3148)“.

EATCS Bulletin No.41 (June 1990), 87-103. (with Fiorella de Cindio and Richard Hopkins)

”AC/DC-Systems“.

Petri Net Newsletters No.33 (August 1989). (with Jorg Desel)

”Notations and Terminology on Petri Net Theory“.

Petri Net Newsletters No.20 (May 1985). (with Cesar Fernandez)

”Into Enlogy“.

Petri Net Newsletters No.19 (February 1985), 3-6. (with Einar Smith)

”In Quest of a Morphism“.

Petri Net Newsletters No.18 (October 1984), 14-18

”Non-deterministic Interleaving and the Non-transitivity of Concurrency“.

Petri Net Newsletters No.15 (October 1983), 11-15

”A Counterexample“.

Petri Net Newsletters No.14 (June 1983), 8-9.

”Some Open Problems in ‘Token Mathematics’“.

Bulletin of the EATCS (June 1983), 309-312. (with P.S.Thiagarajan)

”A Theorem on Open Covers in Petri Nets“.

Petri Net Newsletters No.11 (June 1982), 5-12.

”Representing a Program Invariant as a Linear Invariant in a Net“.

Bulletin of the EATCS (June 1982), 2-11.

CONFERENCE PUBLICATIONS

”Weak and Strong Composition of High-level Petri Nets“.

Proc. CONCUR’99, Jos C.M. Baeten, Sjouke Mauw (eds), Springer-Verlag, LNCS 1664 (1999), 194-209 (with Alex-ander Lavrov)

”The Box Algebra – a Model of Nets and Process Expressions“.

Proc. 20th Int. Conf. on Applications and Theory of Petri Nets, Susanna Donatelli and H.C.J.M. (Jetty) Kleijn(eds.), Springer-Verlag, LNCS 1639 (1999), 344-363 (with Raymond Devillers and Maciej Koutny)

”Refinement of Coloured Petri Nets“.

Fundamentals of Computation Theory. Proceedings of 11th International Symposium, FCT’97, Krakow, Poland,September 1997. B. S. Chlebus, L. Czaja (eds), LNCS Vol. 1279, 105-116, Springer-Verlag (1997) (with ThomasThielke)

”Partial Order and SOS Semantics for Linear Constraint Programs“.

Proc. of COORDINATION’97 (D. Garlan and D. Le Metayer, eds), Springer LNCS Vol. 1282, 256-273, 1997 (withF. de Boer and C. Palamidessi)

13

”Orthogonal Transformations for Coloured Petri Nets“.

Proc. of eighteenth European Workshop on Applications and Theory of Petri Nets, ICATPN’97, Toulouse, P.Azema, G. Balbo (eds), LNCS Vol. 1248, 447-466 (with Thomas Thielke)

”Linear Constraint Systems as High-level Nets“.

Proc. CONCUR’96, U. Montanari, V. Sassone (eds), Springer LNCS Vol. 1119, 498-513, 1996 (with Catuscia Pa-lamidessi)

”Investigating Equivalence Notions for Nondeterministic Processes“.

Proceedings of A. Ershov Second International Memorial Conference on Perspectives of System Informatics, No-vosibirsk, Russia, June 25-28, 1996, 220-226 (with Irinia Virbitskaite and Angelika Votintseva)

”PEP - more than a Petri Net Tool“.

Proc. of Tools and Algorithms for the Construction and Analysis of Systems, 2nd International Workshop, TA-CAS ’96, Passau, Germany, March 1996, Tiziana Margaria and Bernhard Steffen (eds), LNCS Vol.1055, 397-401,Springer-Verlag (1996) (with Bernd Grahlmann)

”Concurrent Constraint Programming with Information Removal“.

CCP’95, First International Workshop on Concurrent Constraint Programming, Venice, May 29-31 (1995) (withFrank de Boer and Catuscia Palamidessi)

”A Class of Composable High Level Petri Nets“.

Petri Net Conference’95, Torino, LNCS Vol.935, Springer-Verlag (eds. G.De Michelis, M.Diaz) 103-120 (June 1995)(with Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel and Elisabeth Pelz)

”An M-net Semantics of B(PN)2“.

STRICT’95, Berlin (May 1995), Springer-Verlag, Workshops in Computing (ed. J.Desel), 85-100 (with Hans Fleisch-hack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel and Elisabeth Pelz)

”Operational Semantics for the Petri Box Calculus“.

Proc. of CONCUR’94, Springer LNCS Vol.836 (eds. B. Jonsson, J. Parrow), 210-225 (1994) (with Maciej Koutnyand Javier Esparza)

”Compositional Process Semantics of Petri Boxes“.

Proc. of Mathematical Foundations of Programming Semantics (MFPS-93), Springer LNCS Vol.802 (eds. S. Broo-kes, M. Main, A. Melton, M. Mislove, D. Schmidt), 250-270 (1994) (with Hans-Gunther Linde-Goers)

”B(PN)2 - a Basic Petri Net Programming Notation“.

Proc. of PARLE-93, Springer LNCS Vol.694 (eds. A. Bode, M. Reeve, G. Wolf), 379-390 (1993) (with Richard P.Hopkins)

”General Refinement and Recursion Operators for the Petri Box Calculus“.

Proc. STACS-93, Springer LNCS Vol.665 (eds. P. Enjalbert, A. Finkel, K.W. Wagner), 130-140 (1993) (with Ray-mond Devillers and Javier Esparza)

”Model Checking of Persistent Petri Nets“.

5th Workshop Computer Science Logic-91, Springer LNCS Vol.626, 35-52 (1992) (with Javier Esparza)

”Compositional Generation of Home States in Free Choice Systems“.

STACS’91, Hamburg (February 1991), Springer LNCS Vol.480, 398-409 (with Ludmila Cherkasova and Jorg Desel)

”Structure and Behaviour of Concurrent Systems: Selected Results of the Esprit Basic Research Action No.3148:

DEMON“.Annual Esprit Conference, Kluwer Publications, 791-803 (November 1990)

”Weighted Basic Petri Nets“.

Proc. of ‘Concurrency’88’, F.H.Vogt (ed.), Springer-Verlag, LNCS Vol. 335, Hamburg, 257-276 (1988)


Proc. of eighth European Workshop on Applications and Theory of Petri Nets, Zaragoza, 5-29 (June 1987). (withChristian Lengauer)

14

”Interleaving and Partial Orders in Concurrency: A Formal Comparison“.

Proc. of IFIP WG2.2 Conference on Formal Description of Programming Concepts III, Ebberup/Denmark (1986).(with Raymond Devillers; appeared in North Holland, 1987)

”Concurrent Behaviour: Processes, Sequences and Axioms“.

Proc. of CMU Workshop on Concurrency (1984), LNCS Vol.197 (1985), 221-245

”Frozen Tokens and D-continuity: A Study in Relating System Properties to Process Properties“.

Proc. of fifth European Workshop on Applications and Theory of Petri Nets, Arhus (June 1984). (with AgatheMerceron; –also in: Advances in Petri Nets 1984 (ed. Grzegorz Rozenberg), LNCS Vol.188, 48-61)

”Formale Methoden zur Erstellung robuster Software“.

In: Software-Fehlertoleranz und -Zuverlassigkeit, Informatik-Fachberichte No.83, Springer Verlag (1984), 1-9.

”Concurrency Axioms and D-continuous Posets“.

Proc. of the fourth European Workshop on Applications and Theory of Petri Nets, Toulouse (September 1985),59-83. (with Agathe Merceron; –also in: Advances in Net Theory 1984 (ed. Grzegorz Rozenberg), LNCS Vol.188,32-47))

”Some Equivalence Results on Free Choice Nets and Simple Nets, and on the Periodicity of Live Free Choice Nets“.

Proc. of CAAP’83, in: LNCS Vol.159 (1983), 141-154. (with Michael W. Shields)

”Discreteness, K-density and D-continuity of Occurrence Nets“.

Proc. of 6th GI Conference on Theoretical Computer Science, in: LNCS Vol.145 (1982), 73-83. (with Agathe Mer-ceron)

”Relational Semantics of Concurrent Programs (with some Applications)“.

Proc. of IFIP WG2.2 Conference on Formal Description of Programming Concepts II (ed. Dines Bjorner), NorthHolland (1983), 431-452

”Fail-safe Extrema-finding in Circular Distributed Systems“.

AICA Annual Congress (October 1982). (with Fabio Panzieri; –reprinted in: Reliable Computer Systems (ed. San-tosh Shrivastava), Springer Texts & Monographs in Computer Science (1985))

”Information Flow in Nets“.

Proc. of first European Workshop on Theory and Applications of Petri Nets, in: Informatik-Fachberichte No.52,Springer Verlag (1982), 82-87

”Proof of a Concurrent Program Finding Euler Paths“.

Proc. of MFCS’80, in: LNCS Vol.88 (1980), 142-153.

”On the Problem of Achieving Adequacy of Concurrent Programs“.

Proc. of IFIP WG2.2 Conference on Formal Description of Programming Concepts (ed. Erich Neuhold), NorthHolland (1978). (with Peter E. Lauer and Michael W. Shields)

”Systems of Open Paths in Petri Nets“.

Proc. of MFCS’75, in: LNCS Vol.32 (1975), 186-193. (with Hans Albrecht Schmid)

”Markierte Petrinetze und Σ-Teilsysteme“.

Proc. of GI, 5. Jahrestagung, in: LNCS Vol.34 (1975), 151-161. (with Hans Albrecht Schmid)

OTHER REFEREED PUBLICATIONS

”Partial Order Verification with PEP“.

Proc. POMIV’96 (Partial Order Methods in Verification), G. Holzmann, D. Peled and V. Pratt (eds), Am. Math.Soc., 305-328 (1997)

”Some Major Dichotomies Relating to Future Research in Concurrency“.

In http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a40-best/

15

”A Memory Module Specification Using Composable High-level Nets“.

In: Formal Systems Specification. The RPC-Memory Specification Case Study. Proceedings of a Dagstuhl Seminar,Springer LNCS Vol. 1169, M. Broy, St. Merz and K. Spies (eds), 109-159 (1996)

”The Box Calculus: a New Causal Algebra with Multi-label Communication“.

Advances in Petri Nets 92 (ed. G.Rozenberg), Springer LNCS Vol.609, 21-609 (1992). (with Raymond Devillersand Jon G.Hall)

”Some Classes of Live and Safe Petri Nets“.

In: Concurrency and Nets, eds.: K.Voss, H.J.Genrich and G.Rozenberg, Springer Verlag, 71-94 (1987). (withP.S.Thiagarajan)

”Structure Theory of Petri Nets: The Free Choice Hiatus“.

Proc. of Advanced Course on Petri Nets, Bad Honnef (1986), Springer LNCS Vol.254 (1987)

”COSY: Its Relation to Nets and to CSP“.

Proc. of Advanced Course on Petri Nets, Bad Honnef (1986), Springer LNCS Vol.255 (1987)

INVITED PUBLICATIONS

”Petri Nets, Process Algebras and Concurrent Programming Languages“.

Lectures on Petri Nets II: Applications, W. Reisig and G. Rozenberg (eds), Advances in Petri Nets, 1-84, Springer-Verlag (1998) (with Raymond Devillers and Maciej Koutny)

”CALIBAN - Esprit Basic Research WG 6067“.

STRICT’95, Berlin (May 1995), Springer-Verlag, Workshops in Computing (ed. J.Desel), 2-31 (with RaymondDevillers, Elisabeth Pelz, Arend Rensink, Manuel Silva and Enrique Teruel)

”Solving Recursive Net Equations“.

Proceedings of ICALP’95, Szeged, (ed. F.Gecseg and Z.Fulop), LNCS Vol.944, 605-623, Springer-Verlag (1995).(with Maciej Koutny)

”A Refined View of the Box Calculus“.

Proceedings of 16th Conference on Application and Theory of Petri Nets 1995, Torino, (eds. G. De Michelis,M.Diaz), LNCS Vol. 935, 1-21, Springer-Verlag (1995). (with Maciej Koutny)

”DEMON: Aims and Achievements“.

Advances in Petri Nets 92 (ed. G.Rozenberg), Springer LNCS Vol.609, 1-20 (1992); abridged version in: EATCSBulletin, June 1992.


Proc. of the Baastad Workshop on Concurrency, 76-98 (1991). (with Javier Esparza)

”Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets“.

Proc. of the Fourth Int. Workshop on Petri Nets and Performance Models, Melbourne (3-5 December 1991), IEEEComputer Society, 224-235, Also in: Bulletin of the EATCS No.45 (October 1991), 39-58

”The Petri Box Calculus for Concurrent Programs“.

In: GMD-Studien Nr.191 (May 1991)

”Design Methods Based on Nets“.

Advances in Petri Nets 89 (ed. G.Rozenberg), Springer LNCS Vol.424, 487-506 (1990)

”Zielsetzungen und Stand der Forschungsarbeiten des Projekts DEMON“.

Der GMD-Spiegel Nr.3/90, 52-54

”Partial Order Semantics of Concurrent Programs (abstract)“.

Proc. of Concur’90 (eds. Jos C.M. Baeten and Jan W. Klop), Springer LNCS Vol.458 (1990), p.1.

16

”Traps, Free Choice and Home States (extended abstract)“.

In: Semantics for Concurrency, Leicester 1990 (eds. Marta Z. Kwiatkowska, Michael W. Shields and Rick M. Tho-mas), Springer Workshops in Computing (1990), 16-21. (with Ludmila Cherkasova, Jorg Desel and Javier Esparza)

”Design Methods Based on Nets: Esprit Basic Research Action DEMON“.

Advances in Petri Nets 1989, Springer LNCS Vol.424 (1990), 487-506.

”Towards Compositional Predicate Transformer Semantics for Concurrent Programs“.

Liber Amicorum for J.W.de Bakker (1989)

”Systementwurf mit kausalitatsbasierten Modellen (in German).“.

Aufsatz im Jahresbericht der GMD (Gesellschaft fur Mathematik und Datenverarbeitung), 1989 (with Ursula Goltzund Axel Poigne)

”Design and Analysis of Highly Parallel and Distributed Systems“.

Proc. of Winter School on Abstract Software Specifications, Copenhagen (1979), in: LNCS Vol.86 (1980), 451-503.(with P.E.Lauer and M.W.Shields)

”Adequacy of Path Programs“.

Proc. of Advanced Course on Net Theory of Systems and Processes, Hamburg (1979), in: LNCS Vol.84 (1980),291-305

”The Relative Strength of K-density“.


”Atomicity of Activities“.


LECTURE NOTES

”Petrinetze“.

1994-2001, in German

”Semantik und Entwurf von Programmen“.

Vorlesungsskript (1985), Universitat Bonn and Universitat-GH Paderborn, in German

”Semantische Grundlagen der parallelen Programmierung“.

Vorlesungsskript WS 1983/84, Universitat Bonn (February 1984), in German

THESES

”Kausale Semantik nichtsequentieller Programme“.

Habilitationsschrift, Universitat Bonn (Marz 1988)

”Semantics, Verification and Design of Concurrent Programs Using Atomic Actions“.

PhD Thesis, University of Newcastle upon Tyne, England (August 1981)

”Beitrage zur Petrinetztheorie“.

Diplomarbeit, Universitat Karlsruhe (1974)

17

TECHNICAL REPORTS

”The Box Algebra = Petri Nets + Process Expresions“.

Oldenburger Berichte 14/99, September 1999 (with Raymond Devillers and Maciej Koutny)

”Recursion and Petri Nets“.

Oldenburger Berichte 13/99, September 1999 (with Raymond Devillers and Maciej Koutny)

”Relational Semantics Revisited“.

Oldenburger Berichte 2/99, January 1999 (with Kerstin M. Richter)

”Coloured Nets with Curry“.

Hildesheimer Informatikbericht, 1996 (with Thomas Thielke)

”Comparing Logical and Behavioural Equivalences for Event Structures“.

Hildesheimer Informatikbericht 22/96 (July 1996) (with Irina Virbitskaite and Anzhelika Votintseva)

”Final Report of the Esprit Basic Research Working Group 6067 CALIBAN“.

Hildesheimer Informatikbericht, November 1995 (with Raymond Devillers, Elisabeth Pelz, Arend Rensink, ManuelSilva, Enrique Teruel)

”Operational and Denotational Semantics for the Box Algebra“.

Hildesheimer Informatikbericht 33/95 (October 1995) (with Maciej Koutny)

”A Class of Composable High Level Petri Nets, and An M-net Semantics of B(PN)2“.

Hildesheimer Informatikbericht 10/95 (April 1995) (with Hans Fleischhack, Wojciech Frazak, Richard P. Hopkins,Hanna Klaudel and Elisabeth Pelz)

”A Refined View of the Box Algebra, and Solving Recursive Net Equations“.

Hildesheimer Informatikbericht 9/95 (April 1995) (with Maciej Koutny)

”A High Level Petri Net Semantics of B(PN)2“.

LRI Technical Report No.895 (March 1994) (with Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, HannaKlaudel and Elisabeth Pelz)

”Compositional Process Semantics of the Box Algebra“.

Hildesheimer Informatikbericht 19/93 (December 1993) (with Hans-Gunther Linde-Goers)

”Operational Semantics for the Petri Box Calculus“.

Hildesheimer Informatik-Bericht 13/93 (October 1993) (with Maciej Koutny and Javier Esparza)

”First Year Results of the Esprit Basic Research WG 6067 CALIBAN (Causal Calculi Based on Nets)“.

Hildesheimer Informatikbericht 11/93 (September 1993).

”B(PN)2 - a Basic Petri Net Programming Notation“.

Hildesheimer Informatikbericht 27/92 (December 1992). (with Richard P. Hopkins)

”General Refinement and Recursion for the Box Calculus“.

Hildesheimer Informatikbericht 26/92 (December 1992). (with Raymond Devillers and Javier Esparza)

”The Box Calculus: a New Causal Algebra with Multilabel Communication“.

Hildesheimer Informatikbericht 4/92 (April 1992). (with Raymond Devillers and Jon G. Hall)


Hildesheimer Informatik-Berichte Nr.11/91 (September 1991). (with Javier Esparza)

”Characterisation of Home States in Free Choice Systems“.

Hildesheimer Informatik-Berichte Nr.9/90 (September 1990). (with Ludmila Cherkasova, Jorg Desel and JavierEsparza)

”Structure and Behaviour of Concurrent Systems: Selected Results of the Esprit Basic Research Action No.3148:

DEMON“.Proc. of the Annual Esprit Conference (July 1990)

18

”Partial Order Semantics of Priority Systems“.

Hildesheimer Informatik-Berichte Nr.6/90 (June 1990). (with Maciej Koutny)

”Design Methods Based on Nets“.

Hildesheimer Informatik-Berichte Nr.1/90 (January 1990)

”Technical Annex for the Esprit Basic Research Action No.3148: DEMON“.

Arbeitspapiere der GMD Nr.435 (January 1990)

”Fully Concurrent Bisimulation“.

Technical Report LIT-202, Universite Libre de Bruxelles (July 1989). (with Raymond Devillers, Astrid Kiehn andLucia Pomello)

”Minimal Deadlocks in Free Choice Nets“.

Hildesheimer Informatik-Berichte Nr.1/89 (July 1989) (with J.Esparza and M.Silva)


Arbeitspapiere der GMD No.250 (May 1987). (with Christian Lengauer)

”Notations and Terminology on Petri Net Theory“.

Arbeitspapiere der GMD No.195 (January 1986, 2nd edition: March 1987). (with Cesar Fernandez)

”Concurrent Systems and Processes“.

Final Report of the Project BEGRUND, Studien der GMD No.104 (March 1985). (with Cesar Fernandez andHelmut Plunnecke)

”Concurrent Behaviour: Processes, Sequences and Programming Languages“.

Studien der GMD No.99 (May 1985). (with Raymond Devillers)

”Concurrent Behaviour: Processes, Sequences and Axioms“.

Arbeitspapiere der GMD No.118 (November 1984).

”D-continuity: A Study in Relating System Properties to Process Properties“.

Arbeitspapiere der GMD No.83 (February 1984). (with Agathe Merceron)

”Free Choice Systems have Home States“.

Arbeitspapiere der GMD No.46 (August 1983). (with Klaus Voss)

”Consistent Relational and Predicate Transformer Semantics of a Sequential Deterministic Language Supporting

Exception Handling“.Arbeitspapiere der GMD No.20 (March 1983). (with Flaviu Cristian)

”D-continuity in Partially Ordered Sets“.

Arbeitspapiere der GMD No.10 (January 1983).

”Relational Semantics of Concurrent Programs (with some Applications)“.

TR/180, Computing Laboratory, University of Newcastle upon Tyne (1982).

”Some Properties of Nonsequential Processes“.

GMD-ISF Report 82.07 (August 1982). (with Agathe Merceron)

”Consistency of Relational and Assertional Semantics of Concurrent Programs“.

GMD-ISF Report 82.01 (May 1982)

”A Relational Framework for Concurrent Programs Using Atomic Actions“.

GMD-ISF Report 81.04 (December 1981).

”Systematic Detection of Exception Occurrences“.

TR/165, Computing Laboratory, University of Newcastle upon Tyne (1980). (with Flaviu Cristian)

”The Relative Strength of K-density“.

TR/148, Computing Laboratory, University of Newcastle upon Tyne (1980)

19

”An Operational Characterisation of the Atomicity of Activities“.


”Notes on Predicate Transformers and Concurrent Programs“.


”A Formal Model of Atomicity in Asynchronous Systems“.

TR/130, Computing Laboratory, University of Newcastle upon Tyne (1978). (with Brian Randell)

”Formal Theory of the Basic COSY Notation“.

TR/143, Computing Laboratory, University of Newcastle upon Tyne (1979). (with Peter E. Lauer and Michael W.Shields)

”Design and Analysis of Highly Parallel and Distributed Systems“.

TR/142, Computing Laboratory, University of Newcastle upon Tyne (1979). (with Peter E. Lauer and Michael W.Shields)

”A Theorem on the Characteristics of Non-sequential Processes“.


”A Step towards the Solution of the Liveness Problem in Petri Nets“.

TR/114, Computing Laboratory, University of Newcastle upon Tyne (1977). (with Hans Albrecht Schmid)

”On the Problem of Achieving Adequacy of Concurrent Programs“.

TR/103, Computing Laboratory, University of Newcastle upon Tyne (February 1977). (with Peter E. Lauer andMichael W. Shields)

”Benutzerhandbuch FEDS (A Flexible and Efficient Dialogue System)“.

Report 1/75, Universitat Karlsruhe, Institut fur Informatik (Februar 1975). (with Hans Albrecht Schmid and SevinUlukut)

EDITED PUBLICATIONS

”PEP: Programming Environment Based on Petri Nets“.

Proceedings of a Workshop, October 11-12 (1994), Humboldt-Universitat zu Berlin. Hildesheimer Informatikbericht14/95 (May 1995) (with Hans Fleischhack)

”Esprit Basic Research Action 3148 DEMON: aims, scope and achievements“.

Hildesheimer Informatikbericht 5/92 (April 1992).

”Final Report of the Project DEMON“.

Studie der GMD Nr.217 (1994)

”What Good are Partial Orders?“.

Proceedings of the Pro-CALIBAN Workshop, Sheffield (June 1992), also: Hildesheimer Informatik-Bericht 13/92(October 1992)

”Second Progress Report of the Esprit Basic Research Action DEMON“.

GMD-Studie Nr. 198 (September 1991), eds. E.Best and J.Esparza

”Selected Papers from the 3rd Workshop on Concurrency and Compositionality, jointly organised by DEMON and

CEDISYS, Goslar, March 5-8, 1991“.Special Issue of Theoretial Computer Science (1993), eds. E.Best and G.Rozenberg

”Proceedings of the 3rd Workshop on Concurrency and Compositionality, jointly organised by DEMON and CE-

DISYS, Goslar, March 5-8, 1991“.GMD-Studien Nr.191 and Hildesheimer Informatik-Bericht Nr. 6/91 (May 1991), eds. E.Best and G.Rozenberg

20

ORGANISATION OF EVENTS

• POEM Workshop, Hildesheim, May 23-25, 1996; approximately 10 participants.

• PEP Open Workshop, Berlin, October 11-12, 1994; approximately 40 participants.

• Open Workshop of CALIBAN, Zaragoza (June 20-June 24, 1994); approximately 30 participants.

• CONCUR-93 in Hildesheim, August 23-26 (1993); 118 participants (Organisation Chair: U.Goltz, PC Chair:E.Best).

• CALIBAN Workshop on High Level Boxes, Wangerooge (5-9 May, 1993); 15 participants from Paris, New-castle, Milano, Brussels, Oldenburg, Hildesheim.

• Pro-CALIBAN Workshop ‘What Good are Partial Orders’, Sheffield (June 1992); approximately 40 partici-pants.

• Final Review of DEMON, Bruxelles (January 1992); 18 participants.

• Second Review, and Open Workshop, of DEMON, Gjern / Denmark (June 1991); approximately 100 parti-cipants.

• 3rd Workshop on Concurrency and Compositionality, Goslar / Germany, (March 1991); 59 participants.

• Hildesheimer Sommerschule uber Petrinetze (August 1990); approximately 60 partcipants.

• First Review of the Esprit Basic Research Project No.3148 DEMON, Paris (June 1990); 50 participants.

PAST TEACHING

• At the Universitat Hildesheim (from 1991/92 onwards):

(a) Standard Courses:

Wintersemester: Theory of Programming Part 1 (sequential programs) (3 hpw + exerci-ses)Complexity of Sequential and Parallel Algorithms (3 hpw + exercises)Petri Nets (2 hpw)

Sommersemester: Theory of Programming Part 2 (concurrent programs) (3 hpw + exerci-ses)Computability and Logic (3 hpw + exercises)

(b) Special Courses and Seminars:

21

Sommersemester 1999: SabbaticalWintersemester 1998/99: Complexity of Sequential and Parallel Programs (4 hpw + 2 hpw exer-

cises)Theory and Games (3 hpw + 1 hpw exercises)

Sommersemester 1998: Automata Theory and Logic (4 hpw + 2 hpw exercises)Seminar: Model Checking

Wintersemester 1997/98: Theory of Computing (4 hpw + 2 hpw exercises)Seminar: Petri Net Tools

Sommersemester 1997: Basic Logic (4 hpw + 2 hpw exercises)Efficient Algorithms (2 hpw)Seminar: Parallel Algorithms

Wintersemester 1996/97: Complexity of Algorithms (4 hpw + 2 hpw exercises).Wintersemester 1991/92: Petri Nets (2 hpw + exercises)

Seminar: ProzeßalgebraSommersemester 1992: Seminar: Parallel AlgorithmsWintersemester 1992/93: Seminar: VLSI DesignSommersemester 1993: Seminar: Social Aspects of Computer ScienceWintersemester 1993/94: Analysis of Petri Nets (2 hpw + exercises)

Seminar: Standard SoftwareSommersemester 1994: Efficient Algorithms (2 hpw)

Seminar: Decidability Questions in Petri NetsWintersemester 1994/95: Seminar: Petri Net Software Tools

Sabbatical SemesterSommersemester 1995: Efficient Algorithms (2 hpw)Wintersemester 1995/96: Temporal Logic (2 hpw)Sommersemester 1996: Efficient Parallel Algorithms (2 hpw)

Seminar: Parallel AlgorithmsWintersemester 1996/97: Complexity of Parallel and Sequential Programs (4 hpw + 2 hpw exer-

cises)Seminar: Automated Proving (2 hpw)

Sommersemester 1997: Computability and Logic (3 hpw + 1 hpw exercises).

• At the Universitat Hildesheim (1989-1991):

Sommersemester 1989: Berechenbarkeit und Logik (4 hpw plus exercises)Wintersemester 1989/90: Informatik I (4 hpw plus exercises)

Komplexitat von Algorithmen (2 hpw plus exercises)Seminar: Parallel Program Design (2 hpw)

Sommersemester 1990: Informatik II (4 hpw + exercises)Semantik paralleler Programme (3 hpw + exercises)

Wintersemester 1990/91: Informatik I (4 hpw + exercises)Einfuhrung in die Petrinetze (3 hpw + exercises)Seminar: Logik (2 hpw)

Sommersemester 1991: Informatik II (4 hpw + exercises)Seminar: Temporale Logik (2 hpw)

• At the Universitat-Gesamthochschule Paderborn:

Sommersemester 1985: Theorie der Programmierung (4 hpw plus exercises)Wintersemester 1988/89: Semantik von Programmen (2 hpw)Wintersemester 1988/89: Petrinetze (2 hpw)

• At the University of Bonn:

22

Wintersemester 1983/84: Semantische Grundlagen der parallelen Programmierung (2 hpw)Wintersemester 1983/84: Seminar zu den semantischen Grundlagen der parallelen Programmie-

rung (2 hpw)Wintersemester 1984/85: Semantik I (2 hpw)Sommersemester 1985: Semantik II (2 hpw plus exercises)

(to third and fourth year students in Computer Science)

• At the University of Newcastle upon Tyne:

Easter Term 1977: General Net TheoryMichelmas Term 1977: Formal Aspects of ParallelismEaster Term 1979: Net TheoryEaster Term 1980: Net Theory

(all to third year Computer Science students in the Computer Systems and Software Design Course).

ADMINISTRATION

Administrative work at the Universitat Hildesheim (up to 1996):

– Membership in the Fachbereichsrat (Faculty Counselling Committee).

– Institute Director (Institute of Theoretical Computer Science).

– Membership in the Forschungskomitee (a Senate Subcommittee dealing with Research).

– Membership in the Senate.

OTHER COURSES

• Fourth Advanced Course on Petri Nets, Eichstatt (September 2003).

• Third Advanced Course on Petri Nets, Schloß Dagstuhl (October 1996).

• Graduiertenkolleg Freiberg/Holzhau, February 19-23, 1996; Lecturer on Petri Net Methods.

• Latin American Petri Nets Course’95, Recife (Brazil), November 20-28, 1995; Lecturer.

• Latin American Petri Nets Course’93, Santiago de Chile, November 22-30, 1993; Lecturer.

• Hildesheimer Sommerschule uber Petrinetze: Systementwurf und Werkzeuge (August 1990) - Organiser andLecturer.

• Nordic Summer School on Design Methods of Distributed Systems, SICS-Stockholm (August 1987).

• Second Advanced Course on Petri Nets, Bad Honnef (September 1986).

• Systematischer Entwurf von parallelen Programmen, Seminar der GMD (25.-27. September 1985).

• First Advanced Course on General Net Theory of Processes and Systems, Hamburg (Fall 1979).

INVITATIONS, MEMBERSHIPS, REFEREEING

• Program Committee, EXPRESS’98 (Sophia Antipolis, France, September 1998).

• Permanent Reviewer of the DFG (Deutsche Forschungsgemeinschaft) for a Group of Researchers (1996-1999).

• Program Committee, EXPRESS’97 (Santa Margharita, Italy, September 1997).

• Program Committee, CONCUR’97 (Warszawa, July 1997).

• Invited Lecturer at the third Advanced Course on Petri Nets (Schloß Dagstuhl, 1996).

23

• Invited Lecturer at POMIV’96 (Partial Order Methods in Verification), Princeton (July 24-26, 1996).

• Invited Participant at the ACM/NSF Workshop on Strategic Directions in Computing Research, MIT (June13-14, 1996).

• Invited lecturer, Latin American PN Courses ’93 (Brazil) and ’95 (Chile).

• Invited lecturer, SEGRAGRA’95.

• Invited lecturer, ICALP’95.

• Invited lecturer, PN’95 Conference.

• Member of the Advisory Board of the Journal of Information and Cybernetics (1993-1995).

• External Reviewer for die Deutsche Forschungsgemeinschaft, Berlin, January 26, 1995. Amsterdam), 1994-1996.

• Coordination Committee, STRICT’95 (Berlin, May 1995).

• Program Committee, CONCUR’94 (Uppsala/Sweden, Aug.22-Aug.25, 1994).

• Program Committee Chair, CONCUR’93 (Hildesheim, Aug.30-Sep.2, 1993).

• Representative of the University of Hildesheim at the German Board of Computer Science Faculties (1990-1994).

• Program Committee Member: 13th International Conference on Applications and Theory of Petri Nets,Chicago, USA (1993).

• Program Committee Member: CONCUR’91, Amsterdam (August 1991).

• Program Committee Member and Organising Committee Chairman of the 3rd Workshop on Concurrencyand Compositionality, Goslar / Harz (March 1991).

• Organiser of the Sommerschule on ‘Petrinetze: Systementwurf und Werkzeuge’, Hildesheim (August 1990).

• Program Committee, CONCUR’90, Amsterdam (August 1990).

• Invited Lecturer, Workshop on Semantics of Concurrent Computation, Leeds (July 1990).

• Invitation to Moscow, Novosibirsk and Tbilisi (March-April 1990).

• Program Committee and Invited Lecturer, Second Workshop on Concurrency and Compositionality, SanMiniato (March 1990).

• Program Committee, 11th International Conference on Applications and Theory of Petri Nets, Paris (1990).

• Invited Lecturer, 10th International Conference on Applications and Theory of Petri Nets, Bad Godesberg(June 1989).

• Program Committee, ICCI’89 (International Conference on Computing and Information), Toronto, Canada(1989).

• Program Committee, 10th International Conference on Applications and Theory of Petri Nets, Bad Godes-berg (1989).

• Member of IFIP Working Group 2.2: Formal Description of Programming Concepts (May 1987).

• Invited Lecturer at the second Advanced Course on Petri Nets (Bad Honnef, 1986).

• Professorship (C4) in 1985 at the Universitat-Gesamthochschule Paderborn.

• Program Committee, 2nd GI-NTG-GMR-GMD Tagung Fehlertolerante Rechensysteme, Bonn (1984).

• One-month guest researcher at the CWI, Amsterdam (October 1983).

• Program Committee, 2nd European Workshop on Application and Theory of Petri Nets, Bad Honnef (1980).

• Program Committee, 1st European Workshop on Application and Theory of Petri Nets, Strasbourg (1980).

• Observer at the IFIP WG2.2 Annual Meetings (1982, 1984, 1985, 1986 and 1987).

• Invited Lecturer at the first Advanced Course on Net Theory (Hamburg, 1979).

24

LECTURES GIVEN AND VISITS MADE

• Organisation of the following list: Location, date; topic of talk; duration of event.

• Long Island, 8.-15. June 1998; Procomet’98; 1 week.

• Universitat Jena, 12. January 1998; PEP; 1 day.

• Universitat Graz, 22.-26. September 1997; IFIP WG 2.2; 5 days.

• Technische Universitat Berlin, 28. May 1997; Coloured Nets with Curry; 1 day.

• Universite Libre de Bruxelles, 19.-24. November 1996; Box Calculus; 5 days.

• Schloß Dagstuhl, 13.-19. October 1996 (3rd Advanced Course on Petri Nets); Petri Nets, Process Algebrasand Programming Languages (series of lectures); 5 days.

• Schloß Dagstuhl, 16.-20. September 1996 (EXPRESS Workshop); High-level Nets and Concurrent ConstraintProgramming; 5 days.

• University of Newcastle upon Tyne, 1.-6. September 1996; Box Calculus; 5 days.

• Universita di Pisa, 26.-30. August 1996 (CONCUR’96); High-level Nets and Concurrent Constraint Program-ming; 5 days.

• Princeton University, 24.-27. July 1996, DIMACS Workshop POMIV’96 (Partial Order Methods in Verifica-tion); Partial Order Verification with PEP; 3 days.

• MIT, 14.-15. June 1996; ACM Workshop on Strategic Directions in Computing Research; 2 days.

• POEM Workshop, Hildesheim, 23.-25. May 1996; Linear Algebra for High-level Nets; 2 days.

• University of Newcastle upon Tyne, 9.-14. April 1996; Box Calculus; 5 days.

• Universite Libre de Bruxelles, 6.-9. March 1996; Box Calculus; 3 days.

• Universite Paris-Sud, LRI, 5. March 1996; Box Calculus; 1 day.

• Freiberg/Holzhau, 19.-23. February 1996; Petri Net Methods (series of lectures); 5 days.

• Universita di Genova, 10.-16. February 1996; Constraint Systems and High-level Nets; 1 day.

• Universite Paris-Sud, LRI, 12. December 1995; M-nets; 2 days.

• Universitat Munchen, 7.-10. December 1995; M-nets and M-net Semantics of B(PN)2; 3 days.

• Latin American PN Course’95, Recife, November 22-28, 1995; Petri Nets, Programming and Process Algebras(series of lectures); 7 days.

• SEGRAGRA’95 Workshop Volterra, August 27-September 2, 1995; Solving Recursive Net Equations; 7 days.

• ICALP’95 Szeged, July 10-15, 1995; Solving Recursive Net Equations; 6 days.

• PN’95 Conference Torino, June 27-29, 1995; A Refined View of the Box Calculus; 3 days.

• EXPRESS Workshop Tarquinia, June 21-23, 1995; Solving Recursive Net Equations; 3 days.

• IFIP WG 2.2 meeting Amsterdam, June 13-17, 1995; Solving Recursive Net Equations; 5 days.

• STRICT Workshop Berlin, May 11-13, 1995; Results of CALIBAN; 3 days.

• MASK Workshop Koblenz, April 5-8, 1995; Solving Recursive Net Equations; 4 days.

• Universita di Genova, 8. February 1995; Composable High Level Nets; 1 week.

• Universita La Sapienza di Roma, 1. February 1995; Composable High Level Nets; 1 week.

• Universitat Bremen, 11. January 1995; Composable High Level Nets; 1 day.

• Universitat Koblenz-Landau, 14. December 1994; Composable High Level Nets; 2 days.

25

• Universitat Munchen, 7. December 1994; Composable High Level Nets; 8 days.

• Schloß Dagstuhl, 29. September 1994; Solution of the Broy/Lamport Problem Using Composable High LevelNets; 5 days.

• Uppsala, 23. August 1994; Operational Semantics of the Box Calculus; 5 days.

• Invited Talk at the Days of Research of the Universitat Hildesheim, 2. July 1994; Research Profile of theUniversity; 2 days.

• Wangerooge, 8. May 1994; The Box Calculus; 3 days.

• Amsterdam, 23. March 1994; The Box Calculus; 3 days.

• Latin American PN Course’93, Santiago de Chile, November 22-30, 1993; Petri Nets and Parallel Programs;9 days.

• University of Edinburgh, 5. November 1993; Operational Semantics of the Box Calculus; 1 day.

• Newcastle upon Tyne, 1. November 1993; Petri Net Programming Notation; 2 days.

• Fischbachau, 27. September 1993; CALIBAN Open Questions; 2 days.

• Universitat Konstanz, 9. June 1993; Model Checking; 1 day.

• Wangerooge, 6. May 1993; Petri Net Programming Notation; 3 days.

• Universita di Genova, 18. February 1993; Operational Semantics for Petri Boxes; 1 day.

• Universita degli Studi di Milano, 17. February 1993; Operational Semantics for Petri Boxes; 1 day.

• Technische Hochschule Darmstadt, 9. February 1993; Operational Semantics for Petri Boxes; 1 day.

• Schloß Dagstuhl, 12. January 1993 (Distributed Automata Workshop); Operational Semantics for PetriBoxes; 1 week.

• Institut fur Informatik, Technische Universitat Braunschweig, 6. April 1992; Ubersicht uber die Resultatevon DEMON; 1 day.

• Institut fur Informatik, Universitat Hamburg, 6. January 1992; Petri Box Calculus; 1 day.

• Institut fur Informatik, Universitat Hamburg, 6. January 1992; Model Checking of Persistent Nets; 1 day.

• PNPM-91, Melbourne, Australien, 4. December 1991; Result Overview of DEMON; 1 week.

• Computer Science Department, University of Arhus, 6. November 1991; Model Checking of Persistent PetriNets; 1 day.

• Computer Science Department, University of Arhus, 6. November 1991; Petri Box Calculus; 1 day.

• Centrum voor Wiskunde en Informatica, Amsterdam, 24. October 1991; Petri Box Calculus; 1 day.

• Universitat Warszawa, 20. October 1991; Petri Box Calculus; 1 day.

• Banach-Zentrum, Warszawa, 18. October 1991; Model Checking of Persistent Petri Nets; 2 days.

• Alborg University, 20. September 1991; Model Checking of Persistent Petri Nets; 1 day.

• Alborg University, 20. September 1991; Polynomial Time Analysis of Network Properties; 1 day.

• Cedisys Workshop, Sophia Antipolis, 18. September 1991; Petri Boxes; 2 days.

• IFIP 2.2 Working Group Meeting, Darmstadt, 25. July 1991; Model Checking of Persistent Petri Nets; 4days.

• Open Workshop of DEMON, Gjern, 24. June 1991; Petri Boxes; 2 days.

• Institut fur Informatik, Universitat Oldenburg, 17. June 1991; Polynomzeitanalyse von Netzwerkeigenschaf-ten; 1 day.

26

• GMD, 5. June 1991; Polynomzeitanalyse von Netzwerkeigenschaften; 1/2 day.

• Universitat Dortmund, 5. June 1991; Polynomzeitanalyse von Netzwerkeigenschaften; 1/2 day.

• Concurrency Workshop, Bastad, Schweden, 30. May 1991; Model Checking of Marked Graphs; 1 week.

• Institut fur Informatik, Technische Universitat Munchen, 16. May 1991; Model Checking auf Petrinetzen; 1day.

• Department of Computer Science, Edinburgh University, 13. May 1991; Model Checking of Persistent PetriNets; 1 day.

• Computing Laboratory, University of Newcastle upon Tyne, 7. May 1991; Model Checking of Marked Graphs;3 days.

• Univ. of Birmingham, 19. March 1991; Polynomial Time Analysis of Network Properties; 2 days.

• 3rd Workshop on Concurrency and Compositionality. Goslar, 7. March 1991; The Petri Box Calculus; 5 days.

• STACS-91, Hamburg, 15. February 1991; Compositional Generation of Home States in Live and BoundedFree Choice Systems; 2 days.

• CONCUR’90, Amsterdam (August 1990); Partial Order Semantics, Concurrent Programs; 4 days

• Semantics for Concurrency Workshop (July 1990); Home States; 3 days

• ICALP’90, Warwick (July 1990); 1 week

• Paris (DEMON Review Meeting and Petri Net Conference); DEMON WG8 Report; 1 week

• CWI, Amsterdam (May 1990); Home States; 1 day

• IFIP WG2.2 / 2.3 Conference, Israel; 1 week

• Institute of Cybernetics, Tbilisi (March 1990); Priorities; 1 week

• Soviet Academy of Science, Novosibirsk (March 1990); Priorities, Semantics of Concurrent Programs; 2 weeks

• San Miniato / Pisa (February 1990); Petri Net Semantics of Priorities; 3 days

• Univ. Hildesheim (January 1990); Sicherheit von Programmen; 1 day

• Amsterdam, CWI, REX day (November 1989); Petri Nets and Partial Orders; 1 day

• Telavi, SU (October 2-6, 1989); Partial Orders; 1 week

• Bad Godesberg (June 1989); Report on DEMON; 4 days

• GMD, (April 1989, CWI-GMD-INRIA Workshop; Petri Net Semantics of Priorities; 1 day

• Konigswinter (March 1988); Efficiency of Asynchronous Systems; 3 days

• Paderborn (January 1988); Semantic Independence; 1 day

• Kiel (January 1988); TC-Bisimulation; 1 day

• Milano (Nov/Dec 87); TC-Bisimulation, FC-Systems; 1 week

• Zaragoza (June 1987); Semantic Independence; 3 days

• Sophia Antipolis (June 1987); Semantic Independence; 1 week

• Bad Honnef (September 1986); Nets, COSY and CSP; 2 weeks

• Bad Honnef (September 1986); Free Choice Petri Nets; 2 weeks

• IFIP TC2 Conference, Ebberup (August 1986); Concurrent Behaviour; 1 week

• Universitat Frankfurt am Main (March 1986); Petri Nets (Home States); 1 day

27

• Universitat Tubingen (November 1985); Petri Nets (Home States); 1 day

• Universitat Paderborn (June 1985); Concurrent Programming; 1 day

• Universitat Passau (May (1985); Concurrent Programs and Petri Nets; 1 week

• Universitat Tubingen (May 1985); Concurrent Programs; 1 day

• University of Newcastle upon Tyne (March 1985); Concurrent Programs; 4 days

• Universite Libre de Bruxelles (February 1985); Petri Nets and Concurrent Programs (two talks); 1 week

• Universitat Bonn (December 1984); Concurrent Programs; 1 day

• CMU Workshop on Concurrency (July 1984); Concurrent Behaviour; 3 days

• Wayne State University (June 1984); Concurrent Programs; 1 day

• University of Toronto/Canada (June 1984); Petri Nets; 1 day

• University of Texas at Austin (June 1984); Concurrent Programs; 1 day

• Cornell University (June 1984); Some small talks given; 3 days

• IFIP WG2.2 Annual Meeting, MIT, USA; Concurrent Programs; 1 week

• Hochschule Bremerhaven (May 1984); Semantics of Exception Handling; 1 day

• University of Leiden (October 1983); Net Theory; 1 day

• CWI Amsterdam (October 1983); Net Theory; 1 day

• Universitat Saarbrucken (July 1983); Concurrent Programs; 1 day

• GI Conference on Theoretical Computer Science, Dortmund (January 1983); Petri Nets (D-continuity etc.);3 days

• Universitat Aachen (November 1981); Concurrent Programs; 1 day

• GMD (October 1981); Concurrent Programs; 1 day

• FACS Meeting in Birmingham (April 1981); Net Theory; 1 day

• Net Theory Workshop, Strasbourg (September 1980); Information Flow in Nets, Atomicity; 4 days

• MFCS’80, Rydzyna (September 1980); Concurrent programs; 1 week

• FACS Workshop Loughborough (April 1980); Nondeterminacy and Concurrency in Guarded Commands; 3days

• Advanced Course on Net Theory, Hamburg (October 1979); Petri nets and Path expressions; 2 weeks

• University of Warwick (Fall 1978); Petri Nets; 2 days

• University of Edinburgh, Computer Science Department (March 1978); Occurrence nets (K-density andatomicity); 1 day

• University of Edinburgh, Dep. of Artificial Intelligence (March 1978); Petri Nets (K-density); 1 day

• IFIP WG2.2 Conference on Formal Description of Programming Concepts, St.Andrews/Canada (August1977); Path expressions; 1 week

• Yale University (July 1977); No talk scheduled; 1 day

• New York State University at Stony Brook (July 1977); Path expressions; 1 day

• IBM (Yorktown Heights) (July 1977); Path expressions; 1 day

• Arhus, Workshop on Verification of Parallel Processes (June 1977); Petri Nets (K-density); 2 weeks

• MFCS’75, Marianske Lazne (September 1975); Petri Nets; 1 week

• GI’75, Dortmund (October 1975); Petri Nets; 2 days

28

Documents

PUBLICATIONS AND PROFESSIONAL ACTIVITIES … AND PROFESSIONAL ACTIVITIES Eike Best ... (grant holder of Alexander-von-Humbo ldt-Stiftung), 2005-2006. ... A Petri-Net-Oriented Tutorial“