Eike Best

According to our database1, Eike Best authored at least 110 papers between 1975 and 2018.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Pre-synthesis of Petri nets based on prime cycles and distance paths.
Sci. Comput. Program., 2018

Preface.
Fundam. Inform., 2018

From Event-Oriented Models to Transition Systems.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Properties of Plain, Pure, and Safe Petri Nets.
T. Petri Nets and Other Models of Concurrency, 2017

Characterisation of the state spaces of marked graph Petri nets.
Inf. Comput., 2017

Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

A Graph-Theoretical Characterisation of State Separation.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016
Conditions for Petri Net Solvable Binary Words.
T. Petri Nets and Other Models of Concurrency, 2016

Existence of home states in Petri nets is decidable.
Inf. Process. Lett., 2016

True Concurrent Equivalences in Time Petri Nets.
Fundam. Inform., 2016

Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

Characterising Petri Net Solvable Binary Words.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

The Power of Prime Cycles.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2016 Satellite event of the conferences: 37th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2016 and 16th International Conference on Application of Concurrency to System Design ACSD 2016, 2016

2015
Synthesis of Live and Bounded Persistent Systems.
Fundam. Inform., 2015

Analysis of Petri Nets and Transition Systems.
Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

State space axioms for T-systems.
Acta Inf., 2015

Synthesis and reengineering of persistent systems.
Acta Inf., 2015

Synthesis of Bounded Choice-Free Petri Nets.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

On Binary Words Being Petri Net Solvable.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, 2015

2014
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets.
Proceedings of the Language and Automata Theory and Applications, 2014

Synthesis of Persistent Systems.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Structure Theory of Petri Nets.
Trans. Petri Nets and Other Models of Concurrency, 2013

2012
Unifying Equivalences for Higher Dimensional Automata.
Fundam. Inform., 2012

Deciding Selective Declassification of Petri Nets.
Proceedings of the Principles of Security and Trust - First International Conference, 2012

Unifying Equivalences for Timed Transition Systems.
Proceedings of the Turing-100, 2012

2011
Separability in Persistent Petri Nets.
Fundam. Inform., 2011

Petri Net Distributability.
Proceedings of the Perspectives of Systems Informatics, 2011

2010
A Categorical View of Timed Behaviours.
Fundam. Inform., 2010

On the Decidability of Non Interference over Unbounded Petri Nets
Proceedings of the Proceedings 8th International Workshop on Security Issues in Concurrency, 2010

Separability in Persistent Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Relational Semantics Revisited.
Electr. Notes Theor. Comput. Sci., 2009

A decomposition theorem for finite persistent transition systems.
Acta Inf., 2009

2008
A Slicing Technique for Business Processes.
Proceedings of the Information Systems and e-Business Technologies, 2008

A Note on Persistent Petri Nets.
Proceedings of the Concurrency, 2008

Decomposition Theorems for Bounded Persistent Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007
Making Petri Nets Safe and Free of Internal Transitions.
Fundam. Inform., 2007

2006
Separability in Conflict-Free Petri Nets.
Proceedings of the Perspectives of Systems Informatics, 2006

2003
Process Algebra: A Petri-Net-Oriented Tutorial.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002
The Box Algebra = Petri Nets + Process Expressions.
Inf. Comput., 2002

2001
Recursion and Petri nets.
Acta Inf., 2001

Petri net algebra.
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04457-5, 2001

2000
Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets.
ICATPN, 2000

1999
Operational and Denotational Semantics for the Box Algebra.
Theor. Comput. Sci., 1999

Generalised Composition Operations for High-level Petri Nets.
Fundam. Inform., 1999

Weak and Strong Composition of High-Level Petri-Nets.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

The Box Algebra - A Model of Nets and Process Expressions.
Proceedings of the Application and Theory of Petri Nets 1999, 1999

1998
M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages.
Acta Inf., 1998

1997
Refinement of Coloured Petri Nets.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Partial Order and SOS Semantics for Linear Constraint Programs.
Proceedings of the Coordination Languages and Models, Second International Conference, 1997

Orthogonal Transformations for Coloured Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1997, 1997

1996
Some Major Dichotomies Relating to Future Research in Concurrency.
ACM Comput. Surv., 1996

PEP - More than a Petri Net Tool.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

Partial order verification with PEP.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Linear Constraint Systems as High-Level Nets.
Proceedings of the CONCUR '96, 1996

Petri Nets, Process Algebras and Concurrent Programming Languages.
Proceedings of the Lectures on Petri Nets II: Applications, 1996

Semantics of sequential and parallel programs.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-460643-9, 1996

1995
Using net refinement to compute the fixpoint of a recursive.
Electr. Notes Theor. Comput. Sci., 1995

Solving Recursive Net Equations.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

A Refined View of the Box Algebra.
Proceedings of the Application and Theory of Petri Nets 1995, 1995

A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2.
Proceedings of the Application and Theory of Petri Nets 1995, 1995

Semantik - Theorie sequentieller und paralleler Programmierung.
Lehrbuch Informatik, Vieweg, ISBN: 978-3-528-05431-1, 1995

1994
A Memory Module Specification Using Composable High-Level Petri Nets.
Proceedings of the Formal Systems Specification, 1994

Operational Semantics for the Petri Box Calculus.
Proceedings of the CONCUR '94, 1994

1993
General Refinement and Recursion Operators for the Petri Box Calculus.
Proceedings of the STACS 93, 1993

B(PN)2 - a Basic Petri Net Programming Notation.
Proceedings of the PARLE '93, 1993

Compositional Process Semantics of Petri Boxes.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Petri Net Semantics of Priority Systems.
Theor. Comput. Sci., 1992

Traps Characterize Home States in Free Choice Systems.
Theor. Comput. Sci., 1992

Results of the esprit basic research action 3148 demon (design methods based on nets).
Microprocessing and Microprogramming, 1992

Compositional Generation of Home States in Free Choice Nets.
Formal Asp. Comput., 1992

The box calculus: a new causal algebra with multi-label communication.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

Esprit Basic Research Action 3148 DEMON (design methods based on nets).
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991
Concurrent Bisimulations in Petri Nets.
Acta Inf., 1991

Compositional Generation of Home States in Free Choice Systems.
Proceedings of the STACS 91, 1991

Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets.
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models, 1991

Model Checking of Persistent Petri Nets.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
Partial Order Behaviour and Structure of Petri Nets.
Formal Asp. Comput., 1990

Partial Order Semantics of Concurrent Programs (Abstract).
Proceedings of the CONCUR '90, 1990

1989
Semantic Independence.
Sci. Comput. Program., 1989

1988
Nonsequential Processes - A Petri Net View
EATCS Monographs on Theoretical Computer Science 13, Springer, ISBN: 978-3-642-73483-0, 1988

Weighted Basic Petri Nets.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

Design Methods Based on Nets, Esprit Basic Research Action DEMON.
Proceedings of the Advances in Petri Nets 1989, 1988

Kausale Semantik nichtsequentieller Programme.
PhD thesis, 1988

1987
Sequential and Concurrent Behaviour in Petri Net Theory.
Theor. Comput. Sci., 1987

1986
Structure Theory of Petri Nets: the Free Choice Hiatus.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

COSY: Its Relation to Nets and CSP.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

1985
Comments on "Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs".
IEEE Trans. Computers, 1985

1984
Fairness and Conspiracies.
Inf. Process. Lett., 1984

Free Choice Systems Have Home States.
Acta Inf., 1984

Formale Methoden zur Erstellung robuster Software.
Proceedings of the Software-Fehlertoleranz und -Zuverlässigkeit, 1984

Concurrent Behaviour: Sequences, Processes and Axioms.
Proceedings of the Seminar on Concurrency, 1984

Frozen tokens and D-continuity: A study in relating system properties to process properties.
Proceedings of the Advances in Petri Nets 1984, 1984

Concurrency axioms and D-continuous posets.
Proceedings of the Advances in Petri Nets 1984, 1984

1983
Discreteness, k-density and d-continuity of occurrence nets.
Proceedings of the Theoretical Computer Science, 1983

Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets.
Proceedings of the CAAP'83, 1983

1982
Adequacy Properties of Path Programs.
Theor. Comput. Sci., 1982

1981
Systematic Detection of Exception Occurrences.
Sci. Comput. Program., 1981

A Formal Model of Atomicity in Asynchronous Systems.
Acta Inf., 1981

Information Flow in Nets.
Proceedings of the Application and Theory of Petri Nets, 1981

Overview on Topic 3: Information Flow and Concurrency.
Proceedings of the Application and Theory of Petri Nets, 1981

1980
A theorem on the characteristics of nonsequential processes.
Fundam. Inform., 1980

Proof of a Concurrent Program Finding Euler Paths.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
A Note on the Proof of a Concurrent Program.
Inf. Process. Lett., 1979

Design & Analysis of Highly Parallel & Distributed Systems.
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979

Adequacy of Path Programs.
Proceedings of the Net Theory and Applications, 1979

The Relative Strength of K-Density.
Proceedings of the Net Theory and Applications, 1979

Atomicity of Activities.
Proceedings of the Net Theory and Applications, 1979

1975
Systems of Open Paths in Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Martierte Petrinetze und Sigma-Teilsysteme.
Proceedings of the GI - 5. Jahrestagung, Dortmund, 8.-10. Oktober 1975, 1975


  Loading...