The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Eike Best: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  67. Decomposition Theorems for Bounded Persistent Petri Nets. [Citation Graph (, )][DBLP]


  68. Separability in Persistent Petri Nets. [Citation Graph (, )][DBLP]


  69. A Note on Persistent Petri Nets. [Citation Graph (, )][DBLP]


  70. A Slicing Technique for Business Processes. [Citation Graph (, )][DBLP]


  71. A decomposition theorem for finite persistent transition systems. [Citation Graph (, )][DBLP]


  72. Relational Semantics Revisited. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002