Martierte Petrinetze und Sigma-Teilsysteme. - Eike Best; Hans Albrecht Schmid (GI Jahrestagung, 1975)

Systems of Open Paths in Petri Nets. - Eike Best; Hans Albrecht Schmid (MFCS, 1975)

On the Problem of Achieving Adequacy of Concurrent Programs. - Peter E. Lauer; Eike Best; Michael W. Shields (Formal Description of Programming Concepts, 1977)

Atomicity of Activities. - Eike Best (Advanced Course: Net Theory and Applications, 1979)

The Relative Strength of K-Density. - Eike Best (Advanced Course: Net Theory and Applications, 1979)

Adequacy of Path Programs. - Eike Best (Advanced Course: Net Theory and Applications, 1979)

Design & Analysis of Highly Parallel & Distributed Systems. - Peter E. Lauer; M. W. Shields; Eike Best (Abstract Software Specifications, 1979)

A Note on the Proof of a Concurrent Program. - Eike Best (Inf. Process. Lett., 1979)

Proof of a Concurrent Program Finding Euler Paths. - Eike Best (MFCS, 1980)

A theorem on the characteristics of nonsequential processes. - Eike Best (Fundam. Informaticae, 1980)

Overview on Topic 3: Information Flow and Concurrency. - Eike Best (Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981)

Information Flow in Nets. - Eike Best (Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981)

A Formal Model of Atomicity in Asynchronous Systems. - Eike Best; Brian Randell (Acta Informatica, 1981)

Systematic Detection of Exception Occurrences. - Eike Best; Flaviu Cristian (Sci. Comput. Program., 1981)

Relational Semantics of Concurrent Programs (With Some Applications). - Eike Best (Formal Description of Programming Concepts, 1982)

Adequacy Properties of Path Programs. - Eike Best (Theor. Comput. Sci., 1982)

Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. - Eike Best; M. W. Shields (CAAP, 1983)

Discreteness, k-density and d-continuity of occurrence nets. - Eike Best; Agathe Merceron (Theoretical Computer Science, 1983)

Concurrency axioms and D-continuous posets. - Eike Best; Agathe Merceron (European Workshop on Applications and Theory in Petri Nets, 1984)

Frozen tokens and D-continuity: A study in relating system properties to process properties. - Eike Best; Agathe Merceron (European Workshop on Applications and Theory in Petri Nets, 1984)

Concurrent Behaviour: Sequences, Processes and Axioms. - Eike Best (Seminar on Concurrency, 1984)

Formale Methoden zur Erstellung robuster Software. - Eike Best (Software-Fehlertoleranz und -Zuverlässigkeit, 1984)

Free Choice Systems Have Home States. - Eike Best; Klaus Voss (Acta Informatica, 1984)

Fairness and Conspiracies. - Eike Best (Inf. Process. Lett., 1984)

Comments on "Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs". - Eike Best; Flaviu Cristian (IEEE Trans. Computers, 1985)

COSY: Its Relation to Nets and CSP. - Eike Best (Advances in Petri Nets, 1986)

Structure Theory of Petri Nets: the Free Choice Hiatus. - Eike Best (Advances in Petri Nets, 1986)

Interleaving and partial orders in concurrency: a formal comparison. - Eike Best; Raymond Devillers (Formal Description of Programming Concepts, 1987)

Sequential and Concurrent Behaviour in Petri Net Theory. - Eike Best; Raymond Devillers (Theor. Comput. Sci., 1987)

Kausale Semantik nichtsequentieller Programme. - Eike Best (1988)

Design Methods Based on Nets, Esprit Basic Research Action DEMON. - Eike Best (European Workshop on Applications and Theory in Petri Nets, 1988)

Weighted Basic Petri Nets. - Eike Best (Concurrency, 1988)

Nonsequential Processes - A Petri Net View - Eike Best; César Fernández (Springer, 1988)

Semantic Independence. - Eike Best; Christian Lengauer (Sci. Comput. Program., 1989)

Partial Order Semantics of Concurrent Programs (Abstract). - Eike Best (CONCUR, 1990)

Partial Order Behaviour and Structure of Petri Nets. - Eike Best; Jörg Desel (Formal Aspects Comput., 1990)

Model Checking of Persistent Petri Nets. - Eike Best; Javier Esparza (CSL, 1991)

Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets. - Eike Best (PNPM, 1991)

Compositional Generation of Home States in Free Choice Systems. - Eike Best; Ludmila Cherkasova; Jörg Desel (STACS, 1991)

Concurrent Bisimulations in Petri Nets. - Eike Best; Raymond Devillers; Astrid Kiehn; Lucia Pomello (Acta Informatica, 1991)

Esprit Basic Research Action 3148 DEMON (design methods based on nets). - Eike Best (Advances in Petri Nets: The DEMON Project, 1992)

The box calculus: a new causal algebra with multi-label communication. - Eike Best; Raymond Devillers; Jon G. Hall (Advances in Petri Nets: The DEMON Project, 1992)

Compositional Generation of Home States in Free Choice Nets. - Eike Best; Ludmila Cherkasova; Jörg Desel (Formal Aspects Comput., 1992)

Results of the esprit basic research action 3148 demon (design methods based on nets). - Eike Best (Microprocess. Microprogramming, 1992)

Traps Characterize Home States in Free Choice Systems. - Eike Best; Jörg Desel; Javier Esparza (Theor. Comput. Sci., 1992)

Petri Net Semantics of Priority Systems. - Eike Best; Maciej Koutny (Theor. Comput. Sci., 1992)

Compositional Process Semantics of Petri Boxes. - Eike Best; Hans-Günther Linde-Göers (MFPS, 1993)

B(PN)2 - a Basic Petri Net Programming Notation. - Eike Best; Richard P. Hopkins (PARLE, 1993)

General Refinement and Recursion Operators for the Petri Box Calculus. - Eike Best; Raymond Devillers; Javier Esparza (STACS, 1993)

Operational Semantics for the Petri Box Calculus. - Maciej Koutny; Javier Esparza; Eike Best (CONCUR, 1994)

A Memory Module Specification Using Composable High-Level Petri Nets. - Eike Best (Formal Systems Specification, 1994)

Semantik - Theorie sequentieller und paralleler Programmierung. - Eike Best (Vieweg, 1995)

A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2. - Eike Best; Hans Fleischhack; Wojciech Fraczak; Richard P. Hopkins; Hanna Klaudel; Elisabeth Pelz (Application and Theory of Petri Nets, 1995)

A Refined View of the Box Algebra. - Eike Best; Maciej Koutny (Application and Theory of Petri Nets, 1995)

Concurrent Constraint Programming with Information Removal. - Frank S. de Boer; Catuscia Palamidessi; Eike Best (CCP, 1995)

Solving Recursive Net Equations. - Eike Best; Maciej Koutny (ICALP, 1995)

CALIBAN - Esprit Basic Research WG 6067. - Eike Best; Raymond Devillers; Elisabeth Pelz; Arend Rensink; Manuel Silva 001; Enrique Teruel (STRICT, 1995)

An M-net Semantics of B(PN)2. - Eike Best; Hans Fleischhack; Wojciech Fraczak; Richard P. Hopkins; Hanna Klaudel; Elisabeth Pelz (STRICT, 1995)

Using net refinement to compute the fixpoint of a recursive. - Eike Best; Maciej Koutny (SEGRAGRA, 1995)

Semantics of sequential and parallel programs. - Eike Best (Prentice Hall, 1996)

Petri Nets, Process Algebras and Concurrent Programming Languages. - Eike Best; Raymond Devillers; Maciej Koutny (Petri Nets (2), 1996)

Linear Constraint Systems as High-Level Nets. - Eike Best; Catuscia Palamidessi (CONCUR, 1996)

Partial order verification with PEP. - Eike Best (Partial Order Methods in Verification, 1996)

PEP - More than a Petri Net Tool. - Bernd Grahlmann; Eike Best (TACAS, 1996)

Some Major Dichotomies Relating to Future Research in Concurrency. - Eike Best (ACM Comput. Surv., 1996)

Orthogonal Transformations for Coloured Petri Nets. - Eike Best; Thomas Thielke (ICATPN, 1997)

Partial Order and SOS Semantics for Linear Constraint Programs. - Eike Best; Frank S. de Boer; Catuscia Palamidessi (COORDINATION, 1997)

Refinement of Coloured Petri Nets. - Eike Best; Thomas Thielke (FCT, 1997)

M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. - Eike Best; Wojciech Fraczak; Richard P. Hopkins; Hanna Klaudel; Elisabeth Pelz (Acta Informatica, 1998)

The Box Algebra - A Model of Nets and Process Expressions. - Eike Best; Raymond Devillers; Maciej Koutny (ICATPN, 1999)

Weak and Strong Composition of High-Level Petri-Nets. - Eike Best; Alexander Lavrov (CONCUR, 1999)

Generalised Composition Operations for High-level Petri Nets. - Eike Best; Alexander Lavrov (Fundam. Informaticae, 1999)

Operational and Denotational Semantics for the Box Algebra. - Maciej Koutny; Eike Best (Theor. Comput. Sci., 1999)

Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. - Eike Best; Harro Wimmel (ICATPN, 2000)

Petri net algebra. - Eike Best; Raymond Devillers; Maciej Koutny (Springer, 2001)

A Unified Model for Nets and Process Algebras. - Eike Best; Raymond Devillers; Maciej Koutny (Handbook of Process Algebra, 2001)

Recursion and Petri nets. - Eike Best; Raymond Devillers; Maciej Koutny (Acta Informatica, 2001)

The Box Algebra = Petri Nets + Process Expressions. - Eike Best; Raymond Devillers; Maciej Koutny (Inf. Comput., 2002)

Process Algebra: A Petri-Net-Oriented Tutorial. - Eike Best; Maciej Koutny (Lectures on Concurrency and Petri Nets, 2003)

Separability in Conflict-Free Petri Nets. - Eike Best; Javier Esparza; Harro Wimmel; Karsten Wolf (Ershov Memorial Conference, 2006)

Making Petri Nets Safe and Free of Internal Transitions. - Eike Best; Philippe Darondeau; Harro Wimmel (Fundam. Informaticae, 2007)

Decomposition Theorems for Bounded Persistent Petri Nets. - Eike Best; Philippe Darondeau (Petri Nets, 2008)

A Note on Persistent Petri Nets. - Eike Best (Concurrency, Graphs and Models, 2008)

A Slicing Technique for Business Processes. - Eike Best; Astrid Rakow (UNISCON, 2008)

Relational Semantics Revisited. - Eike Best; Kerstin Strecker (SOS@ICALP, 2008)

A decomposition theorem for finite persistent transition systems. - Eike Best; Philippe Darondeau (Acta Informatica, 2009)

On the Decidability of Non Interference over Unbounded Petri Nets - Eike Best; Philippe Darondeau; Roberto Gorrieri (SecCo, 2010)

A Categorical View of Timed Behaviours. - Irina B. Virbitskaite; Natalya Gribovskaya; Eike Best (Fundam. Informaticae, 2010)

Petri Net Distributability. - Eike Best; Philippe Darondeau (Ershov Memorial Conference, 2011)

Separability in Persistent Petri Nets. - Eike Best; Philippe Darondeau (Fundam. Informaticae, 2011)

Unifying Equivalences for Timed Transition Systems. - Irina B. Virbitskaite; Natalya Gribovskaya; Eike Best (Turing-100, 2012)

Deciding Selective Declassification of Petri Nets. - Eike Best; Philippe Darondeau (POST, 2012)

Unifying Equivalences for Higher Dimensional Automata. - Elena S. Oshevskaya; Irina B. Virbitskaite; Eike Best (Fundam. Informaticae, 2012)

Structure Theory of Petri Nets. - Eike Best; Harro Wimmel (Trans. Petri Nets Other Model. Concurr., 2013)

Synthesis of Persistent Systems. - Eike Best; Raymond Devillers (Petri Nets, 2014)

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. - Eike Best; Raymond Devillers (LATA, 2014)

On Binary Words Being Petri Net Solvable. - Kamila Barylska; Eike Best; Evgeny Erofeev; Lukasz Mikulski; Marcin Piatkowski (ATAED@Petri Nets/ACSD, 2015)

Synthesis of Bounded Choice-Free Petri Nets. - Eike Best; Raymond Devillers (CONCUR, 2015)

Synthesis and reengineering of persistent systems. - Eike Best; Raymond Devillers (Acta Informatica, 2015)

State space axioms for T-systems. - Eike Best; Raymond Devillers (Acta Informatica, 2015)

Analysis of Petri Nets and Transition Systems. - Eike Best; Uli Schlachter (ICE, 2015)

Synthesis of Live and Bounded Persistent Systems. - Eike Best; Raymond Devillers (Fundam. Informaticae, 2015)

Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis. - Kamila Barylska; Eike Best (ATAED@Petri Nets/ACSD, 2016)

The Power of Prime Cycles. - Eike Best; Raymond Devillers (Petri Nets, 2016)

Characterising Petri Net Solvable Binary Words. - Eike Best; Evgeny Erofeev; Uli Schlachter; Harro Wimmel (Petri Nets, 2016)

Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. - Eike Best; Harro Wimmel (RP, 2016)

True Concurrent Equivalences in Time Petri Nets. - Irina B. Virbitskaite; Dmitriy Bushin; Eike Best (Fundam. Informaticae, 2016)

Existence of home states in Petri nets is decidable. - Eike Best; Javier Esparza (Inf. Process. Lett., 2016)

Conditions for Petri Net Solvable Binary Words. - Kamila Barylska; Eike Best; Evgeny Erofeev; Lukasz Mikulski; Marcin Piatkowski (Trans. Petri Nets Other Model. Concurr., 2016)

A Graph-Theoretical Characterisation of State Separation. - Eike Best; Raymond Devillers; Uli Schlachter (SOFSEM, 2017)

Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict. - Eike Best; Nataliya S. Gribovskaya; Irina B. Virbitskaite (SOFSEM, 2017)

Characterisation of the state spaces of marked graph Petri nets. - Eike Best; Raymond Devillers (Inf. Comput., 2017)

Properties of Plain, Pure, and Safe Petri Nets. - Kamila Barylska; Eike Best; Uli Schlachter; Valentin Spreckels (Trans. Petri Nets Other Model. Concurr., 2017)

From Event-Oriented Models to Transition Systems. - Eike Best; Nataliya Gribovskaya; Irina B. Virbitskaite (Petri Nets, 2018)

Bounded choice-free Petri net synthesis: algorithmic issues. - Eike Best; Raymond Devillers; Uli Schlachter (Acta Informatica, 2018)

Simultaneous Petri Net Synthesis. - Eike Best; Raymond Devillers; Uli Schlachter; Harro Wimmel (Sci. Ann. Comput. Sci., 2018)

Preface. - Wil M. P. van der Aalst; Eike Best; Wojciech Penczek (Fundam. Informaticae, 2018)

Pre-synthesis of Petri nets based on prime cycles and distance paths. - Eike Best; Raymond Devillers (Sci. Comput. Program., 2018)

Sufficient conditions for the marked graph realisability of labelled transition systems. - Eike Best; Thomas Hujsa; Harro Wimmel (Theor. Comput. Sci., 2018)

A New Property of Choice-Free Petri Net Systems. - Eike Best; Raymond Devillers; Evgeny Erofeev (Petri Nets, 2020)

Target-oriented Petri Net Synthesis. - Eike Best; Raymond Devillers; Evgeny Erofeev; Harro Wimmel (Fundam. Informaticae, 2020)

Petri Net Primer - A Compendium on the Core Model, Analysis, and Synthesis - Eike Best; Raymond Devillers (Springer, 2024)

Petri Net Synthesis from a Reachability Set. - Eike Best; Raymond Devillers (Petri Nets, 2024)

Coverability in Well-Formed Free-Choice Petri Nets. - Eike Best; Raymond Devillers (Taming the Infinities of Concurrency, 2024)

Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański's Conjecture. - Eike Best; Raymond Devillers (Petri Nets, 2025)

Coverability in Well-Formed Free-Choice Nets. - Eike Best; Raymond Devillers; Petr Jancar (Petri Nets, 2025)