Eike Best

Publication Activity (10 Years)

Years Active: 1975-2020
Publications (10 Years): 25

Top Venues

Petri Nets

Fundam. Informaticae

Trans. Petri Nets Other Model. Concurr.

Acta Informatica

Universität Bonn (PHD)

Education History

Universität Bonn

PHD

Publications

Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel
Target-oriented Petri Net Synthesis. Fundam. Informaticae 175 (1-4) (2020)
Eike Best, Raymond R. Devillers, Evgeny Erofeev
A New Property of Choice-Free Petri Net Systems. Petri Nets (2020)
Eike Best, Raymond R. Devillers
Pre-synthesis of Petri nets based on prime cycles and distance paths. Sci. Comput. Program. 157 (2018)
Eike Best, Raymond R. Devillers, Uli Schlachter
Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica 55 (7) (2018)
Eike Best, Thomas Hujsa, Harro Wimmel
Sufficient conditions for the marked graph realisability of labelled transition systems. Theor. Comput. Sci. 750 (2018)
Eike Best, Raymond R. Devillers, Uli Schlachter, Harro Wimmel
Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. 28 (2) (2018)
Wil M. P. van der Aalst, Eike Best, Wojciech Penczek
Preface. Fundam. Informaticae 161 (4) (2018)
Eike Best, Nataliya Gribovskaya, Irina B. Virbitskaite
From Event-Oriented Models to Transition Systems. Petri Nets (2018)
Eike Best, Raymond R. Devillers, Uli Schlachter
A Graph-Theoretical Characterisation of State Separation. SOFSEM (2017)
Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels
Properties of Plain, Pure, and Safe Petri Nets. Trans. Petri Nets Other Model. Concurr. 12 (2017)
Eike Best, Nataliya S. Gribovskaya, Irina B. Virbitskaite
Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict. SOFSEM (2017)
Eike Best, Raymond R. Devillers
Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. 253 (2017)
Eike Best, Javier Esparza
Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116 (6) (2016)
Eike Best, Raymond R. Devillers
The Power of Prime Cycles. Petri Nets (2016)
Eike Best, Harro Wimmel
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. RP (2016)
Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel
Characterising Petri Net Solvable Binary Words. Petri Nets (2016)
Irina B. Virbitskaite, Dmitriy Bushin, Eike Best
True Concurrent Equivalences in Time Petri Nets. Fundam. Informaticae 149 (4) (2016)
Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
Conditions for Petri Net Solvable Binary Words. Trans. Petri Nets Other Model. Concurr. 11 (2016)
Kamila Barylska, Eike Best
Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis. ATAED@Petri Nets/ACSD (2016)
Eike Best, Raymond R. Devillers
Synthesis of Live and Bounded Persistent Systems. Fundam. Informaticae 140 (1) (2015)
Eike Best, Raymond R. Devillers
State space axioms for T-systems. Acta Informatica 52 (2-3) (2015)
Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
On Binary Words Being Petri Net Solvable. ATAED@Petri Nets/ACSD (2015)
Eike Best, Raymond R. Devillers
Synthesis and reengineering of persistent systems. Acta Informatica 52 (1) (2015)
Eike Best, Raymond R. Devillers
Synthesis of Bounded Choice-Free Petri Nets. CONCUR (2015)
Eike Best, Uli Schlachter
Analysis of Petri Nets and Transition Systems. ICE (2015)
Eike Best, Raymond R. Devillers
Synthesis of Persistent Systems. Petri Nets (2014)
Eike Best, Raymond R. Devillers
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. LATA (2014)
Eike Best, Harro Wimmel
Structure Theory of Petri Nets. Trans. Petri Nets Other Model. Concurr. 7 (2013)
Elena S. Oshevskaya, Irina B. Virbitskaite, Eike Best
Unifying Equivalences for Higher Dimensional Automata. Fundam. Informaticae 119 (3-4) (2012)
Eike Best, Philippe Darondeau
Deciding Selective Declassification of Petri Nets. POST (2012)
Irina B. Virbitskaite, Natalya Gribovskaya, Eike Best
Unifying Equivalences for Timed Transition Systems. Turing-100 (2012)
Eike Best, Philippe Darondeau
Petri Net Distributability. Ershov Memorial Conference (2011)
Eike Best, Philippe Darondeau
Separability in Persistent Petri Nets. Fundam. Informaticae 113 (3-4) (2011)
Irina B. Virbitskaite, Natalya Gribovskaya, Eike Best
A Categorical View of Timed Behaviours. Fundam. Informaticae 102 (1) (2010)
Eike Best, Philippe Darondeau
Separability in Persistent Petri Nets. Petri Nets (2010)
Eike Best, Philippe Darondeau, Roberto Gorrieri
On the Decidability of Non Interference over Unbounded Petri Nets SecCo (2010)
Eike Best, Kerstin Strecker
Relational Semantics Revisited. Electron. Notes Theor. Comput. Sci. 229 (4) (2009)
Eike Best, Philippe Darondeau
A decomposition theorem for finite persistent transition systems. Acta Informatica 46 (3) (2009)
Eike Best, Philippe Darondeau
Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets (2008)
Eike Best
A Note on Persistent Petri Nets. Concurrency, Graphs and Models (2008)
Eike Best, Astrid Rakow
A Slicing Technique for Business Processes. UNISCON (2008)
Eike Best, Philippe Darondeau, Harro Wimmel
Making Petri Nets Safe and Free of Internal Transitions. Fundam. Informaticae 80 (1-3) (2007)
Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf
Separability in Conflict-Free Petri Nets. Ershov Memorial Conference (2006)
Eike Best, Maciej Koutny
Process Algebra: A Petri-Net-Oriented Tutorial. Lectures on Concurrency and Petri Nets (2003)
Eike Best, Raymond R. Devillers, Maciej Koutny
The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178 (1) (2002)
Eike Best, Raymond R. Devillers, Maciej Koutny
Recursion and Petri nets. Acta Informatica 37 (11-12) (2001)
Eike Best, Harro Wimmel
Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. ICATPN (2000)
Eike Best, Alexander Lavrov
Generalised Composition Operations for High-level Petri Nets. Fundam. Informaticae 40 (2-3) (1999)
Eike Best, Alexander Lavrov
Weak and Strong Composition of High-Level Petri-Nets. CONCUR (1999)
Maciej Koutny, Eike Best
Operational and Denotational Semantics for the Box Algebra. Theor. Comput. Sci. 211 (1-2) (1999)
Eike Best, Raymond R. Devillers, Maciej Koutny
The Box Algebra - A Model of Nets and Process Expressions. ICATPN (1999)
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 Informatica 35 (10) (1998)
Eike Best, Thomas Thielke
Orthogonal Transformations for Coloured Petri Nets. ICATPN (1997)
Eike Best, Thomas Thielke
Refinement of Coloured Petri Nets. FCT (1997)
Eike Best, Frank S. de Boer, Catuscia Palamidessi
Partial Order and SOS Semantics for Linear Constraint Programs. COORDINATION (1997)
Eike Best, Raymond R. Devillers, Maciej Koutny
Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) (1996)
Bernd Grahlmann, Eike Best
PEP - More than a Petri Net Tool. TACAS (1996)
Eike Best
Some Major Dichotomies Relating to Future Research in Concurrency. ACM Comput. Surv. 28 (4es) (1996)
Eike Best
Partial order verification with PEP. Partial Order Methods in Verification (1996)
Eike Best, Catuscia Palamidessi
Linear Constraint Systems as High-Level Nets. CONCUR (1996)
Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz
. Application and Theory of Petri Nets (1995)
Eike Best, Raymond R. Devillers, Elisabeth Pelz, Arend Rensink, Manuel Silva, Enrique Teruel
CALIBAN - Esprit Basic Research WG 6067. STRICT (1995)
Eike Best, Maciej Koutny
Using net refinement to compute the fixpoint of a recursive. Electron. Notes Theor. Comput. Sci. 2 (1995)
Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz
An M-net Semantics of B(PN)2. STRICT (1995)
Eike Best, Maciej Koutny
Solving Recursive Net Equations. ICALP (1995)
Frank S. de Boer, Catuscia Palamidessi, Eike Best
Concurrent Constraint Programming with Information Removal. CCP (1995)
Eike Best, Maciej Koutny
A Refined View of the Box Algebra. Application and Theory of Petri Nets (1995)
Maciej Koutny, Javier Esparza, Eike Best
Operational Semantics for the Petri Box Calculus. CONCUR (1994)
Eike Best
A Memory Module Specification Using Composable High-Level Petri Nets. Formal Systems Specification (1994)
Eike Best, Hans-Günther Linde-Göers
Compositional Process Semantics of Petri Boxes. MFPS (1993)
Eike Best, Richard P. Hopkins
- a Basic Petri Net Programming Notation. PARLE (1993)
Eike Best, Raymond R. Devillers, Javier Esparza
General Refinement and Recursion Operators for the Petri Box Calculus. STACS (1993)
Eike Best, Jörg Desel, Javier Esparza
Traps Characterize Home States in Free Choice Systems. Theor. Comput. Sci. 101 (2) (1992)
Eike Best, Maciej Koutny
Petri Net Semantics of Priority Systems. Theor. Comput. Sci. 96 (1) (1992)
Eike Best, Ludmila Cherkasova, Jörg Desel
Compositional Generation of Home States in Free Choice Nets. Formal Aspects Comput. 4 (6) (1992)
Eike Best
Results of the esprit basic research action 3148 demon (design methods based on nets). Microprocess. Microprogramming 35 (1-5) (1992)
Eike Best, Ludmila Cherkasova, Jörg Desel
Compositional Generation of Home States in Free Choice Systems. STACS (1991)
Eike Best
Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets. PNPM (1991)
Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello
Concurrent Bisimulations in Petri Nets. Acta Informatica 28 (3) (1991)
Eike Best, Javier Esparza
Model Checking of Persistent Petri Nets. CSL (1991)
Eike Best, Jörg Desel
Partial Order Behaviour and Structure of Petri Nets. Formal Aspects Comput. 2 (2) (1990)
Eike Best
Partial Order Semantics of Concurrent Programs (Abstract). CONCUR (1990)
Eike Best, Christian Lengauer
Semantic Independence. Sci. Comput. Program. 13 (1) (1989)
Eike Best
Design Methods Based on Nets, Esprit Basic Research Action DEMON. European Workshop on Applications and Theory in Petri Nets (1988)
Eike Best
Weighted Basic Petri Nets. Concurrency (1988)
Eike Best, Raymond R. Devillers
Sequential and Concurrent Behaviour in Petri Net Theory. Theor. Comput. Sci. 55 (1) (1987)
Eike Best, Raymond R. Devillers
Interleaving and partial orders in concurrency: a formal comparison. Formal Description of Programming Concepts (1987)
Eike Best
COSY: Its Relation to Nets and CSP. Advances in Petri Nets (1986)
Eike Best
Structure Theory of Petri Nets: the Free Choice Hiatus. Advances in Petri Nets (1986)
Eike Best, Flaviu Cristian
Comments on "Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs". IEEE Trans. Computers 34 (1) (1985)
Eike Best
Formale Methoden zur Erstellung robuster Software. Software-Fehlertoleranz und -Zuverlässigkeit (1984)
Eike Best
Fairness and Conspiracies. Inf. Process. Lett. 18 (4) (1984)
Eike Best, Agathe Merceron
Concurrency axioms and D-continuous posets. European Workshop on Applications and Theory in Petri Nets (1984)
Eike Best
Concurrent Behaviour: Sequences, Processes and Axioms. Seminar on Concurrency (1984)
Eike Best, Klaus Voss
Free Choice Systems Have Home States. Acta Informatica 21 (1984)
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)
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)
Eike Best, Agathe Merceron
Discreteness, k-density and d-continuity of occurrence nets. Theoretical Computer Science (1983)
Eike Best
Relational Semantics of Concurrent Programs (With Some Applications). Formal Description of Programming Concepts (1982)
Eike Best
Adequacy Properties of Path Programs. Theor. Comput. Sci. 18 (1982)

Eike Best.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eike Best