Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDEike Best
Person information
- affiliation: University of Oldenburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j44]Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel:
Target-oriented Petri Net Synthesis. Fundam. Informaticae 175(1-4): 97-122 (2020)- [c69]Eike Best, Raymond R. Devillers, Evgeny Erofeev:
A New Property of Choice-Free Petri Net Systems. Petri Nets 2020: 89-108
2010 – 2019
- 2018
- [j43]Eike Best, Raymond R. Devillers, Uli Schlachter
:
Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica 55(7): 575-611 (2018) - [j42]Eike Best, Raymond R. Devillers, Uli Schlachter, Harro Wimmel:
Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. 28(2): 199-236 (2018) - [j41]Wil M. P. van der Aalst, Eike Best, Wojciech Penczek:
Preface. Fundam. Informaticae 161(4): i-ii (2018) - [j40]Eike Best, Raymond R. Devillers:
Pre-synthesis of Petri nets based on prime cycles and distance paths. Sci. Comput. Program. 157: 41-55 (2018) - [j39]Eike Best, Thomas Hujsa, Harro Wimmel:
Sufficient conditions for the marked graph realisability of labelled transition systems. Theor. Comput. Sci. 750: 101-116 (2018) - [c68]Eike Best, Nataliya Gribovskaya, Irina B. Virbitskaite:
From Event-Oriented Models to Transition Systems. Petri Nets 2018: 117-139 - 2017
- [j38]Eike Best, Raymond R. Devillers:
Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. 253: 399-410 (2017) - [j37]Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels:
Properties of Plain, Pure, and Safe Petri Nets. Trans. Petri Nets Other Model. Concurr. 12: 1-18 (2017) - [c67]Eike Best, Nataliya S. Gribovskaya, Irina B. Virbitskaite:
Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict. SOFSEM 2017: 132-146 - [c66]Eike Best, Raymond R. Devillers, Uli Schlachter:
A Graph-Theoretical Characterisation of State Separation. SOFSEM 2017: 163-175 - [e3]Wil M. P. van der Aalst, Eike Best:
Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Zaragoza, Spain, June 25-30, 2017, Proceedings. Lecture Notes in Computer Science 10258, Springer 2017, ISBN 978-3-319-57860-6 [contents] - 2016
- [j36]Irina B. Virbitskaite, Dmitriy Bushin, Eike Best:
True Concurrent Equivalences in Time Petri Nets. Fundam. Informaticae 149(4): 401-418 (2016) - [j35]Eike Best, Javier Esparza:
Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6): 423-427 (2016) - [j34]Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski:
Conditions for Petri Net Solvable Binary Words. Trans. Petri Nets Other Model. Concurr. 11: 137-159 (2016) - [c65]Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel:
Characterising Petri Net Solvable Binary Words. Petri Nets 2016: 39-58 - [c64]Eike Best, Raymond R. Devillers:
The Power of Prime Cycles. Petri Nets 2016: 59-78 - [c63]Kamila Barylska, Eike Best:
Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis. ATAED@Petri Nets/ACSD 2016: 111-125 - [c62]Eike Best, Harro Wimmel:
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. RP 2016: 51-62 - 2015
- [j33]Eike Best, Raymond R. Devillers:
Synthesis and reengineering of persistent systems. Acta Informatica 52(1): 35-60 (2015) - [j32]Eike Best, Raymond R. Devillers:
State space axioms for T-systems. Acta Informatica 52(2-3): 133-152 (2015) - [j31]Eike Best, Raymond R. Devillers:
Synthesis of Live and Bounded Persistent Systems. Fundam. Informaticae 140(1): 39-59 (2015) - [c61]Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski:
On Binary Words Being Petri Net Solvable. ATAED@Petri Nets/ACSD 2015: 1-15 - [c60]Eike Best, Raymond R. Devillers:
Synthesis of Bounded Choice-Free Petri Nets. CONCUR 2015: 128-141 - [c59]Eike Best, Uli Schlachter:
Analysis of Petri Nets and Transition Systems. ICE 2015: 53-67 - 2014
- [c58]Eike Best, Raymond R. Devillers:
Synthesis of Persistent Systems. Petri Nets 2014: 111-129 - [c57]Eike Best, Raymond R. Devillers:
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. LATA 2014: 161-172 - 2013
- [j30]Eike Best, Harro Wimmel:
Structure Theory of Petri Nets. Trans. Petri Nets Other Model. Concurr. 7: 162-224 (2013) - 2012
- [j29]Elena S. Oshevskaya, Irina B. Virbitskaite, Eike Best:
Unifying Equivalences for Higher Dimensional Automata. Fundam. Informaticae 119(3-4): 357-372 (2012) - [c56]Irina B. Virbitskaite, Natalya Gribovskaya, Eike Best:
Unifying Equivalences for Timed Transition Systems. Turing-100 2012: 386-404 - [c55]Eike Best, Philippe Darondeau:
Deciding Selective Declassification of Petri Nets. POST 2012: 290-308 - 2011
- [j28]Eike Best, Philippe Darondeau:
Separability in Persistent Petri Nets. Fundam. Informaticae 113(3-4): 179-203 (2011) - [c54]Eike Best, Philippe Darondeau:
Petri Net Distributability. Ershov Memorial Conference 2011: 1-18 - 2010
- [j27]Irina B. Virbitskaite, Natalya Gribovskaya, Eike Best:
A Categorical View of Timed Behaviours. Fundam. Informaticae 102(1): 129-143 (2010) - [c53]Eike Best, Philippe Darondeau:
Separability in Persistent Petri Nets. Petri Nets 2010: 246-266 - [c52]Eike Best, Philippe Darondeau, Roberto Gorrieri:
On the Decidability of Non Interference over Unbounded Petri Nets. SecCo 2010: 16-33
2000 – 2009
- 2009
- [j26]Eike Best, Philippe Darondeau:
A decomposition theorem for finite persistent transition systems. Acta Informatica 46(3): 237-254 (2009) - [j25]Eike Best, Kerstin Strecker:
Relational Semantics Revisited. Electron. Notes Theor. Comput. Sci. 229(4): 27-47 (2009) - 2008
- [c51]Eike Best, Philippe Darondeau:
Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets 2008: 33-51 - [c50]Eike Best:
A Note on Persistent Petri Nets. Concurrency, Graphs and Models 2008: 427-438 - [c49]Eike Best, Astrid Rakow:
A Slicing Technique for Business Processes. UNISCON 2008: 45-51 - 2007
- [j24]Eike Best, Philippe Darondeau, Harro Wimmel:
Making Petri Nets Safe and Free of Internal Transitions. Fundam. Informaticae 80(1-3): 75-90 (2007) - 2006
- [c48]Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf:
Separability in Conflict-Free Petri Nets. Ershov Memorial Conference 2006: 1-18 - 2003
- [c47]Eike Best, Maciej Koutny:
Process Algebra: A Petri-Net-Oriented Tutorial. Lectures on Concurrency and Petri Nets 2003: 180-209 - [e2]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. Lecture Notes in Computer Science 2679, Springer 2003, ISBN 3-540-40334-5 [contents] - 2002
- [j23]Eike Best, Raymond R. Devillers, Maciej Koutny:
The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178(1): 44-100 (2002) - 2001
- [b5]Eike Best, Raymond R. Devillers, Maciej Koutny:
Petri net algebra. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2001, ISBN 978-3-540-67398-9, pp. I-XI, 1-378 - [j22]Eike Best, Raymond R. Devillers, Maciej Koutny:
Recursion and Petri nets. Acta Informatica 37(11-12): 781-829 (2001) - [p3]Eike Best, Raymond R. Devillers, Maciej Koutny:
A Unified Model for Nets and Process Algebras. Handbook of Process Algebra 2001: 873-944 - 2000
- [c46]Eike Best, Harro Wimmel:
Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. ICATPN 2000: 63-82
1990 – 1999
- 1999
- [j21]Eike Best, Alexander Lavrov:
Generalised Composition Operations for High-level Petri Nets. Fundam. Informaticae 40(2-3): 125-163 (1999) - [j20]Maciej Koutny, Eike Best:
Operational and Denotational Semantics for the Box Algebra. Theor. Comput. Sci. 211(1-2): 1-83 (1999) - [c45]Eike Best, Raymond R. Devillers, Maciej Koutny:
The Box Algebra - A Model of Nets and Process Expressions. ICATPN 1999: 344-363 - [c44]Eike Best, Alexander Lavrov:
Weak and Strong Composition of High-Level Petri-Nets. CONCUR 1999: 194-209 - 1998
- [j19]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): 813-857 (1998) - 1997
- [c43]Eike Best, Thomas Thielke:
Orthogonal Transformations for Coloured Petri Nets. ICATPN 1997: 447-466 - [c42]Eike Best, Frank S. de Boer, Catuscia Palamidessi:
Partial Order and SOS Semantics for Linear Constraint Programs. COORDINATION 1997: 256-273 - [c41]Eike Best, Thomas Thielke:
Refinement of Coloured Petri Nets. FCT 1997: 105-116 - 1996
- [b4]Eike Best:
Semantics of sequential and parallel programs. Prentice Hall International series in computer science, Prentice Hall 1996, ISBN 978-0-13-460643-9, pp. I-XI, 1-351 - [j18]Eike Best:
Some Major Dichotomies Relating to Future Research in Concurrency. ACM Comput. Surv. 28(4es): 40 (1996) - [c40]Eike Best, Raymond R. Devillers, Maciej Koutny:
Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) 1996: 1-84 - [c39]Eike Best, Catuscia Palamidessi:
Linear Constraint Systems as High-Level Nets. CONCUR 1996: 498-513 - [c38]Eike Best:
Partial order verification with PEP. Partial Order Methods in Verification 1996: 305-328 - [c37]Bernd Grahlmann, Eike Best:
PEP - More than a Petri Net Tool. TACAS 1996: 397-401 - 1995
- [b3]Eike Best:
Semantik - Theorie sequentieller und paralleler Programmierung. Lehrbuch Informatik, Vieweg 1995, ISBN 978-3-528-05431-1, pp. I-XIV, 1-370 - [j17]Eike Best, Maciej Koutny:
Using net refinement to compute the fixpoint of a recursive. Electron. Notes Theor. Comput. Sci. 2: 27-28 (1995) - [c36]Eike Best, Maciej Koutny:
A Refined View of the Box Algebra. Application and Theory of Petri Nets 1995: 1-20 - [c35]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 - [c34]Eike Best, Maciej Koutny:
Solving Recursive Net Equations. ICALP 1995: 605-623 - [c33]Eike Best, Raymond R. Devillers, Elisabeth Pelz, Arend Rensink, Manuel Silva, Enrique Teruel:
CALIBAN - Esprit Basic Research WG 6067. STRICT 1995: 2-31 - [c32]Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz:
An M-net Semantics of B(PN)2. STRICT 1995: 85-100 - 1994
- [c31]Maciej Koutny, Javier Esparza, Eike Best:
Operational Semantics for the Petri Box Calculus. CONCUR 1994: 210-225 - [c30]Eike Best:
A Memory Module Specification Using Composable High-Level Petri Nets. Formal Systems Specification 1994: 109-159 - 1993
- [c29]Eike Best, Hans-Günther Linde-Göers:
Compositional Process Semantics of Petri Boxes. MFPS 1993: 250-270 - [c28]Eike Best, Richard P. Hopkins:
B(PN)2 - a Basic Petri Net Programming Notation. PARLE 1993: 379-390 - [c27]Eike Best, Raymond R. Devillers, Javier Esparza:
General Refinement and Recursion Operators for the Petri Box Calculus. STACS 1993: 130-140 - [e1]Eike Best:
CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings. Lecture Notes in Computer Science 715, Springer 1993, ISBN 3-540-57208-2 [contents] - 1992
- [j16]Eike Best, Ludmila Cherkasova, Jörg Desel:
Compositional Generation of Home States in Free Choice Nets. Formal Aspects Comput. 4(6): 572-581 (1992) - [j15]Eike Best:
Results of the esprit basic research action 3148 demon (design methods based on nets). Microprocess. Microprogramming 35(1-5): 23-27 (1992) - [j14]Eike Best, Maciej Koutny:
Petri Net Semantics of Priority Systems. Theor. Comput. Sci. 96(1): 175-174 (1992) - [j13]Eike Best, Jörg Desel, Javier Esparza:
Traps Characterize Home States in Free Choice Systems. Theor. Comput. Sci. 101(2): 161-176 (1992) - [p2]Eike Best:
Esprit Basic Research Action 3148 DEMON (design methods based on nets). Advances in Petri Nets: The DEMON Project 1992: 1-20 - [p1]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 - 1991
- [j12]Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello:
Concurrent Bisimulations in Petri Nets. Acta Informatica 28(3): 231-264 (1991) - [c26]Eike Best, Javier Esparza:
Model Checking of Persistent Petri Nets. CSL 1991: 35-52 - [c25]Eike Best:
Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets. PNPM 1991: 224-235 - [c24]Eike Best, Ludmila Cherkasova, Jörg Desel:
Compositional Generation of Home States in Free Choice Systems. STACS 1991: 398-409 - 1990
- [j11]Eike Best, Jörg Desel:
Partial Order Behaviour and Structure of Petri Nets. Formal Aspects Comput. 2(2): 123-138 (1990) - [c23]Eike Best:
Partial Order Semantics of Concurrent Programs (Abstract). CONCUR 1990: 1
1980 – 1989
- 1989
- [j10]Eike Best, Christian Lengauer:
Semantic Independence. Sci. Comput. Program. 13(1): 23-50 (1989) - 1988
- [b2]Eike Best:
Kausale Semantik nichtsequentieller Programme. Universität Bonn, 1988, pp. I-IV, 1-187 - [b1]Eike Best, César Fernández:
Nonsequential Processes - A Petri Net View. EATCS Monographs on Theoretical Computer Science 13, Springer 1988, ISBN 978-3-642-73485-4, pp. i-ix, 1-112 - [c22]Eike Best:
Design Methods Based on Nets, Esprit Basic Research Action DEMON. European Workshop on Applications and Theory in Petri Nets 1988: 487-506 - [c21]Eike Best:
Weighted Basic Petri Nets. Concurrency 1988: 257-276 - 1987
- [j9]Eike Best, Raymond R. Devillers:
Sequential and Concurrent Behaviour in Petri Net Theory. Theor. Comput. Sci. 55(1): 87-136 (1987) - [c20]Eike Best, Raymond R. Devillers:
Interleaving and partial orders in concurrency: a formal comparison. Formal Description of Programming Concepts 1987: 299-324 - 1986
- [c19]Eike Best:
Structure Theory of Petri Nets: the Free Choice Hiatus. Advances in Petri Nets 1986: 168-205 - [c18]Eike Best:
COSY: Its Relation to Nets and CSP. Advances in Petri Nets 1986: 416-440 - 1985
- [j8]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
- [j7]Eike Best, Klaus Voss:
Free Choice Systems Have Home States. Acta Informatica 21: 89-100 (1984) - [j6]Eike Best:
Fairness and Conspiracies. Inf. Process. Lett. 18(4): 215-220 (1984) - [c17]Eike Best, Agathe Merceron:
Concurrency axioms and D-continuous posets. European Workshop on Applications and Theory in Petri Nets 1984: 32-47 - [c16]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 - [c15]Eike Best:
Concurrent Behaviour: Sequences, Processes and Axioms. Seminar on Concurrency 1984: 221-245 - [c14]Eike Best:
Formale Methoden zur Erstellung robuster Software. Software-Fehlertoleranz und -Zuverlässigkeit 1984: 1-9 - 1983
- [c13]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 - [c12]Eike Best, Agathe Merceron:
Discreteness, k-density and d-continuity of occurrence nets. Theoretical Computer Science 1983: 73-83 - 1982
- [j5]Eike Best:
Adequacy Properties of Path Programs. Theor. Comput. Sci. 18: 149-171 (1982) - [c11]Eike Best:
Relational Semantics of Concurrent Programs (With Some Applications). Formal Description of Programming Concepts 1982: 431-452 - 1981
- [j4]Eike Best, Brian Randell:
A Formal Model of Atomicity in Asynchronous Systems. Acta Informatica 16: 93-124 (1981) - [j3]Eike Best, Flaviu Cristian:
Systematic Detection of Exception Occurrences. Sci. Comput. Program. 1(1-2): 115-144 (1981) - [c10]Eike Best:
Overview on Topic 3: Information Flow and Concurrency. Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets 1981: 72-73 - [c9]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 - 1980
- [j2]Eike Best:
A theorem on the characteristics of nonsequential processes. Fundam. Informaticae 3(1): 77-94 (1980) - [c8]Eike Best:
Proof of a Concurrent Program Finding Euler Paths. MFCS 1980: 142-153
1970 – 1979
- 1979
- [j1]Eike Best:
A Note on the Proof of a Concurrent Program. Inf. Process. Lett. 9(3): 103-104 (1979) - [c7]Eike Best:
Atomicity of Activities. Advanced Course: Net Theory and Applications 1979: 225-250 - [c6]Eike Best:
The Relative Strength of K-Density. Advanced Course: Net Theory and Applications 1979: 261-276 - [c5]Eike Best:
Adequacy of Path Programs. Advanced Course: Net Theory and Applications 1979: 291-305 - [c4]Peter E. Lauer, M. W. Shields, Eike Best:
Design & Analysis of Highly Parallel & Distributed Systems. Abstract Software Specifications 1979: 451-503 - 1977
- [c3]Peter E. Lauer, Eike Best, Michael W. Shields:
On the Problem of Achieving Adequacy of Concurrent Programs. Formal Description of Programming Concepts 1977: 301-336 - 1975
- [c2]Eike Best, Hans Albrecht Schmid:
Martierte Petrinetze und Sigma-Teilsysteme. GI Jahrestagung 1975: 151-161 - [c1]Eike Best, Hans Albrecht Schmid:
Systems of Open Paths in Petri Nets. MFCS 1975: 186-193
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-04-10 23:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
