| 2008 |
|---|
| 72 | EE | Eike Best:
A Note on Persistent Petri Nets.
Concurrency, Graphs and Models 2008: 427-438 |
| 71 | EE | Eike Best,
Philippe Darondeau:
Decomposition Theorems for Bounded Persistent Petri Nets.
Petri Nets 2008: 33-51 |
| 70 | EE | Eike Best,
Astrid Rakow:
A Slicing Technique for Business Processes.
UNISCON 2008: 45-51 |
| 2007 |
|---|
| 69 | EE | Eike Best,
Philippe Darondeau,
Harro Wimmel:
Making Petri Nets Safe and Free of Internal Transitions.
Fundam. Inform. 80(1-3): 75-90 (2007) |
| 2006 |
|---|
| 68 | EE | Eike Best,
Javier Esparza,
Harro Wimmel,
Karsten Wolf:
Separability in Conflict-Free Petri Nets.
Ershov Memorial Conference 2006: 1-18 |
| 2003 |
|---|
| 67 | | Wil M. P. van der Aalst,
Eike Best:
Applications and Theory of Petri Nets 2003, 24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003, Proceedings
Springer 2003 |
| 66 | EE | Eike Best,
Maciej Koutny:
Process Algebra: A Petri-Net-Oriented Tutorial.
Lectures on Concurrency and Petri Nets 2003: 180-209 |
| 2002 |
|---|
| 65 | EE | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
The Box Algebra = Petri Nets + Process Expressions.
Inf. Comput. 178(1): 44-100 (2002) |
| 2001 |
|---|
| 64 | EE | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
Recursion and Petri nets.
Acta Inf. 37(11-12): 781-829 (2001) |
| 2000 |
|---|
| 63 | EE | Eike Best,
Harro Wimmel:
Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets.
ICATPN 2000: 63-82 |
| 1999 |
|---|
| 62 | EE | Eike Best,
Alexander Lavrov:
Weak and Strong Composition of High-Level Petri-Nets.
CONCUR 1999: 194-209 |
| 61 | EE | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
The Box Algebra - A Model of Nets and Process Expressions.
ICATPN 1999: 344-363 |
| 60 | | Eike Best,
Alexander Lavrov:
Generalised Composition Operations for High-level Petri Nets.
Fundam. Inform. 40(2-3): 125-163 (1999) |
| 59 | EE | Maciej Koutny,
Eike Best:
Operational and Denotational Semantics for the Box Algebra.
Theor. Comput. Sci. 211(1-2): 1-83 (1999) |
| 1998 |
|---|
| 58 | EE | Eike Best,
Wojciech Fraczak,
Richard P. Hopkins,
Hanna Klaudel,
Elisabeth Pelz:
M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages.
Acta Inf. 35(10): 813-857 (1998) |
| 1997 |
|---|
| 57 | | Eike Best,
Frank S. de Boer,
Catuscia Palamidessi:
Partial Order and SOS Semantics for Linear Constraint Programs.
COORDINATION 1997: 256-273 |
| 56 | | Eike Best,
Thomas Thielke:
Refinement of Coloured Petri Nets.
FCT 1997: 105-116 |
| 55 | | Eike Best,
Thomas Thielke:
Orthogonal Transformations for Coloured Petri Nets.
ICATPN 1997: 447-466 |
| 1996 |
|---|
| 54 | | Eike Best,
Catuscia Palamidessi:
Linear Constraint Systems as High-Level Nets.
CONCUR 1996: 498-513 |
| 53 | | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
Petri Nets, Process Algebras and Concurrent Programming Languages.
Petri Nets (2) 1996: 1-84 |
| 52 | | Bernd Grahlmann,
Eike Best:
PEP - More than a Petri Net Tool.
TACAS 1996: 397-401 |
| 51 | | Eike Best:
Some Major Dichotomies Relating to Future Research in Concurrency.
ACM Comput. Surv. 28(4es): 40 (1996) |
| 1995 |
|---|
| 50 | | Eike Best,
Maciej Koutny:
A Refined View of the Box Algebra.
Application and Theory of Petri Nets 1995: 1-20 |
| 49 | | Eike Best,
Hans Fleischhack,
Wojciech Fraczak,
Richard P. Hopkins,
Hanna Klaudel,
Elisabeth Pelz:
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2.
Application and Theory of Petri Nets 1995: 103-120 |
| 48 | | Eike Best,
Maciej Koutny:
Solving Recursive Net Equations.
ICALP 1995: 605-623 |
| 47 | EE | Eike Best,
Maciej Koutny:
Using net refinement to compute the fixpoint of a recursive.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1994 |
|---|
| 46 | | Maciej Koutny,
Javier Esparza,
Eike Best:
Operational Semantics for the Petri Box Calculus.
CONCUR 1994: 210-225 |
| 45 | | Eike Best:
A Memory Module Specification Using Composable High-Level Petri Nets.
Formal Systems Specification 1994: 109-159 |
| 1993 |
|---|
| 44 | | Eike Best:
CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings
Springer 1993 |
| 43 | | Eike Best,
Hans-Günther Linde-Göers:
Compositional Process Semantics of Petri Boxes.
MFPS 1993: 250-270 |
| 42 | | Eike Best,
Richard P. Hopkins:
B(PN)2 - a Basic Petri Net Programming Notation.
PARLE 1993: 379-390 |
| 41 | | Eike Best,
Raymond R. Devillers,
Javier Esparza:
General Refinement and Recursion Operators for the Petri Box Calculus.
STACS 1993: 130-140 |
| 1992 |
|---|
| 40 | | Eike Best:
Esprit Basic Research Action 3148 DEMON (design methods based on nets).
Advances in Petri Nets: The DEMON Project 1992: 1-20 |
| 39 | | Eike Best,
Raymond R. Devillers,
Jon G. Hall:
The box calculus: a new causal algebra with multi-label communication.
Advances in Petri Nets: The DEMON Project 1992: 21-69 |
| 38 | | Eike Best,
Ludmila Cherkasova,
Jörg Desel:
Compositional Generation of Home States in Free Choice Nets.
Formal Asp. Comput. 4(6): 572-581 (1992) |
| 37 | | Eike Best,
Jörg Desel,
Javier Esparza:
Traps Characterize Home States in Free Choice Systems.
Theor. Comput. Sci. 101(2): 161-176 (1992) |
| 36 | | Eike Best,
Maciej Koutny:
Petri Net Semantics of Priority Systems.
Theor. Comput. Sci. 96(1): 175-174 (1992) |
| 1991 |
|---|
| 35 | | Eike Best,
Javier Esparza:
Model Checking of Persistent Petri Nets.
CSL 1991: 35-52 |
| 34 | | Eike Best:
Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets.
PNPM 1991: 224-235 |
| 33 | | Eike Best,
Ludmila Cherkasova,
Jörg Desel:
Compositional Generation of Home States in Free Choice Systems.
STACS 1991: 398-409 |
| 32 | | Eike Best,
Raymond R. Devillers,
Astrid Kiehn,
Lucia Pomello:
Concurrent Bisimulations in Petri Nets.
Acta Inf. 28(3): 231-264 (1991) |
| 1990 |
|---|
| 31 | | Eike Best:
Partial Order Semantics of Concurrent Programs (Abstract).
CONCUR 1990: 1 |
| 30 | | Eike Best,
Jörg Desel:
Partial Order Behaviour and Structure of Petri Nets.
Formal Asp. Comput. 2(2): 123-138 (1990) |
| 1989 |
|---|
| 29 | | Eike Best,
Christian Lengauer:
Semantic Independence.
Sci. Comput. Program. 13(1): 23-50 (1989) |
| 1988 |
|---|
| 28 | | Eike Best:
Weighted Basic Petri Nets.
Concurrency 1988: 257-276 |
| 27 | | Eike Best:
Design Methods Based on Nets, Esprit Basic Research Action DEMON.
European Workshop on Applications and Theory in Petri Nets 1988: 487-506 |
| 1987 |
|---|
| 26 | | Eike Best,
Raymond R. Devillers:
Sequential and Concurrent Behaviour in Petri Net Theory.
Theor. Comput. Sci. 55(1): 87-136 (1987) |
| 1986 |
|---|
| 25 | | Eike Best:
Structure Theory of Petri Nets: the Free Choice Hiatus.
Advances in Petri Nets 1986: 168-205 |
| 24 | | Eike Best:
COSY: Its Relation to Nets and CSP.
Advances in Petri Nets 1986: 416-440 |
| 1985 |
|---|
| 23 | | Eike Best,
Flaviu Cristian:
Comments on ``Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs''.
IEEE Trans. Computers 34(1): 97-98 (1985) |
| 1984 |
|---|
| 22 | | Eike Best,
Agathe Merceron:
Concurrency axioms and D-continuous posets.
European Workshop on Applications and Theory in Petri Nets 1984: 32-47 |
| 21 | | Eike Best,
Agathe Merceron:
Frozen tokens and D-continuity: A study in relating system properties to process properties.
European Workshop on Applications and Theory in Petri Nets 1984: 48-61 |
| 20 | | Eike Best:
Concurrent Behaviour: Sequences, Processes and Axioms.
Seminar on Concurrency 1984: 221-245 |
| 19 | | Eike Best:
Formale Methoden zur Erstellung robuster Software.
Software-Fehlertoleranz und -Zuverlässigkeit 1984: 1-9 |
| 18 | | Eike Best,
Klaus Voss:
Free Choice Systems Have Home States.
Acta Inf. 21: 89-100 (1984) |
| 17 | | Eike Best:
Fairness and Conspiracies.
Inf. Process. Lett. 18(4): 215-220 (1984) |
| 1983 |
|---|
| 16 | | Eike Best,
M. W. Shields:
Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets.
CAAP 1983: 141-154 |
| 15 | | Eike Best,
Agathe Merceron:
Discreteness, k-density and d-continuity of occurrence nets.
Theoretical Computer Science 1983: 73-83 |
| 1982 |
|---|
| 14 | | Eike Best:
Adequacy Properties of Path Programs.
Theor. Comput. Sci. 18: 149-171 (1982) |
| 1981 |
|---|
| 13 | | Eike Best:
Overview.
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets 1981: 72-73 |
| 12 | | Eike Best:
Information Flow in Nets.
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets 1981: 82-87 |
| 11 | | Eike Best,
Brian Randell:
A Formal Model of Atomicity in Asynchronous Systems.
Acta Inf. 16: 93-124 (1981) |
| 10 | | Eike Best,
Flaviu Cristian:
Systematic Detection of Exception Occurrences.
Sci. Comput. Program. 1(1-2): 115-144 (1981) |
| 1980 |
|---|
| 9 | | Eike Best:
Proof of a Concurrent Program Finding Euler Paths.
MFCS 1980: 142-153 |
| 8 | | Eike Best:
A theorem on the characteristics of nonsequential processes.
Fundam. Inform. 3(1): 77-94 (1980) |
| 1979 |
|---|
| 7 | | Peter E. Lauer,
M. W. Shields,
Eike Best:
Design & Analysis of Highly Parallel & Distributed Systems.
Abstract Software Specifications 1979: 451-503 |
| 6 | | Eike Best:
A Note on the Proof of a Concurrent Program.
Inf. Process. Lett. 9(3): 103-104 (1979) |
| 1975 |
|---|
| 5 | | Eike Best:
Atomicity of Activities.
Advanced Course: Net Theory and Applications 1975: 225-250 |
| 4 | | Eike Best:
The Relative Strength of K-Density.
Advanced Course: Net Theory and Applications 1975: 261-276 |
| 3 | | Eike Best:
Adequacy of Path Programs.
Advanced Course: Net Theory and Applications 1975: 291-305 |
| 2 | | Eike Best,
Hans Albrecht Schmid:
Martierte Petrinetze und Sigma-Teilsysteme.
GI Jahrestagung 1975: 151-161 |
| 1 | | Eike Best,
Hans Albrecht Schmid:
Systems of Open Paths in Petri Nets.
MFCS 1975: 186-193 |
