Eike Best - RankMe

132 papers A* 1A 3B 24C 2Journal 44Unranked 48

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Persistent Permutability in Choice Petri Nets. CoRR Eike Best, Raymond Devillers
2026	J	`jnl`	Well-Formed Free-Choice Petri Nets Revisited. CoRR Petr Jancar, Eike Best, Raymond Devillers, Matej Ostadal
2025	B	`conf`	Coverability in Well-Formed Free-Choice Nets. Petri Nets Eike Best, Raymond Devillers, Petr Jancar
2025	B	`conf`	Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański's Conjecture. Petri Nets Eike Best, Raymond Devillers
2024	—	`conf`	Coverability in Well-Formed Free-Choice Petri Nets. Taming the Infinities of Concurrency Eike Best, Raymond Devillers
2024	—	`book`	Petri Net Primer - A Compendium on the Core Model, Analysis, and Synthesis Eike Best, Raymond Devillers
2024	B	`conf`	Petri Net Synthesis from a Reachability Set. Petri Nets Eike Best, Raymond Devillers
2020	B	`conf`	A New Property of Choice-Free Petri Net Systems. Petri Nets Eike Best, Raymond Devillers, Evgeny Erofeev
2020	J	`jnl`	Target-oriented Petri Net Synthesis. Fundam. Informaticae Eike Best, Raymond Devillers, Evgeny Erofeev, Harro Wimmel
2018	J	`jnl`	Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica Eike Best, Raymond Devillers, Uli Schlachter
2018	B	`conf`	From Event-Oriented Models to Transition Systems. Petri Nets Eike Best, Nataliya Gribovskaya, Irina B. Virbitskaite
2018	J	`jnl`	Pre-synthesis of Petri nets based on prime cycles and distance paths. Sci. Comput. Program. Eike Best, Raymond Devillers
2018	J	`jnl`	Preface. Fundam. Informaticae Wil M. P. van der Aalst, Eike Best, Wojciech Penczek
2018	J	`jnl`	Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. Eike Best, Raymond Devillers, Uli Schlachter, Harro Wimmel
2018	J	`jnl`	Sufficient conditions for the marked graph realisability of labelled transition systems. Theor. Comput. Sci. Eike Best, Thomas Hujsa, Harro Wimmel
2017	B	`conf`	A Graph-Theoretical Characterisation of State Separation. SOFSEM Eike Best, Raymond Devillers, Uli Schlachter
2017	B	`ed.`	Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Zaragoza, Spain, June 25-30, 2017, Proceedings Petri Nets Wil M. P. van der Aalst, Eike Best
2017	J	`jnl`	Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. Eike Best, Raymond Devillers
2017	B	`conf`	Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict. SOFSEM Eike Best, Nataliya S. Gribovskaya, Irina B. Virbitskaite
2017	J	`jnl`	Properties of Plain, Pure, and Safe Petri Nets. Trans. Petri Nets Other Model. Concurr. Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels
2016	B	`conf`	Characterising Petri Net Solvable Binary Words. Petri Nets Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel
2016	J	`jnl`	Conditions for Petri Net Solvable Binary Words. Trans. Petri Nets Other Model. Concurr. Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
2016	J	`jnl`	Existence of home states in Petri nets is decidable. Inf. Process. Lett. Eike Best, Javier Esparza
2016	—	`conf`	Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. RP Eike Best, Harro Wimmel
2016	—	`conf`	Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net Synthesis. ATAED@Petri Nets/ACSD Kamila Barylska, Eike Best
2016	B	`conf`	The Power of Prime Cycles. Petri Nets Eike Best, Raymond Devillers
2016	J	`jnl`	True Concurrent Equivalences in Time Petri Nets. Fundam. Informaticae Irina B. Virbitskaite, Dmitriy Bushin, Eike Best
2015	—	`conf`	Analysis of Petri Nets and Transition Systems. ICE Eike Best, Uli Schlachter
2015	—	`conf`	On Binary Words Being Petri Net Solvable. ATAED@Petri Nets/ACSD Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski
2015	J	`jnl`	State space axioms for T-systems. Acta Informatica Eike Best, Raymond Devillers
2015	J	`jnl`	Synthesis and reengineering of persistent systems. Acta Informatica Eike Best, Raymond Devillers
2015	B	`conf`	Synthesis of Bounded Choice-Free Petri Nets. CONCUR Eike Best, Raymond Devillers
2015	J	`jnl`	Synthesis of Live and Bounded Persistent Systems. Fundam. Informaticae Eike Best, Raymond Devillers
2014	C	`conf`	Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. LATA Eike Best, Raymond Devillers
2014	B	`conf`	Synthesis of Persistent Systems. Petri Nets Eike Best, Raymond Devillers
2013	J	`jnl`	Structure Theory of Petri Nets. Trans. Petri Nets Other Model. Concurr. Eike Best, Harro Wimmel
2012	—	`conf`	Deciding Selective Declassification of Petri Nets. POST Eike Best, Philippe Darondeau
2012	J	`jnl`	Unifying Equivalences for Higher Dimensional Automata. Fundam. Informaticae Elena S. Oshevskaya, Irina B. Virbitskaite, Eike Best
2012	—	`conf`	Unifying Equivalences for Timed Transition Systems. Turing-100 Irina B. Virbitskaite, Natalya Gribovskaya, Eike Best
2011	—	`conf`	Petri Net Distributability. Ershov Memorial Conference Eike Best, Philippe Darondeau
2011	J	`jnl`	Separability in Persistent Petri Nets. Fundam. Informaticae Eike Best, Philippe Darondeau
2010	J	`jnl`	A Categorical View of Timed Behaviours. Fundam. Informaticae Irina B. Virbitskaite, Natalya Gribovskaya, Eike Best
2010	—	`conf`	On the Decidability of Non Interference over Unbounded Petri Nets SecCo Eike Best, Philippe Darondeau, Roberto Gorrieri
2010	B	`conf`	Separability in Persistent Petri Nets. Petri Nets Eike Best, Philippe Darondeau
2009	J	`jnl`	A decomposition theorem for finite persistent transition systems. Acta Informatica Eike Best, Philippe Darondeau
2008	—	`conf`	A Note on Persistent Petri Nets. Concurrency, Graphs and Models Eike Best
2008	—	`conf`	A Slicing Technique for Business Processes. UNISCON Eike Best, Astrid Rakow
2008	B	`conf`	Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets Eike Best, Philippe Darondeau
2008	—	`conf`	Relational Semantics Revisited. SOS@ICALP Eike Best, Kerstin Strecker
2007	J	`jnl`	Making Petri Nets Safe and Free of Internal Transitions. Fundam. Informaticae Eike Best, Philippe Darondeau, Harro Wimmel
2006	—	`conf`	Separability in Conflict-Free Petri Nets. Ershov Memorial Conference Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf
2003	—	`ed.`	Applications and Theory of Petri Nets 2003, 24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003, Proceedings ICATPN Wil M. P. van der Aalst, Eike Best
2003	—	`conf`	Process Algebra: A Petri-Net-Oriented Tutorial. Lectures on Concurrency and Petri Nets Eike Best, Maciej Koutny
2002	J	`jnl`	The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. Eike Best, Raymond Devillers, Maciej Koutny
2001	—	`ch.`	A Unified Model for Nets and Process Algebras. Handbook of Process Algebra Eike Best, Raymond Devillers, Maciej Koutny
2001	—	`book`	Petri net algebra. Eike Best, Raymond Devillers, Maciej Koutny
2001	J	`jnl`	Recursion and Petri nets. Acta Informatica Eike Best, Raymond Devillers, Maciej Koutny
2000	—	`conf`	Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. ICATPN Eike Best, Harro Wimmel
1999	J	`jnl`	Generalised Composition Operations for High-level Petri Nets. Fundam. Informaticae Eike Best, Alexander Lavrov
1999	J	`jnl`	Operational and Denotational Semantics for the Box Algebra. Theor. Comput. Sci. Maciej Koutny, Eike Best
1999	—	`conf`	The Box Algebra - A Model of Nets and Process Expressions. ICATPN Eike Best, Raymond Devillers, Maciej Koutny
1999	B	`conf`	Weak and Strong Composition of High-Level Petri-Nets. CONCUR Eike Best, Alexander Lavrov
1998	J	`jnl`	M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. Acta Informatica Eike Best, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz
1997	—	`conf`	Orthogonal Transformations for Coloured Petri Nets. ICATPN Eike Best, Thomas Thielke
1997	C	`conf`	Partial Order and SOS Semantics for Linear Constraint Programs. COORDINATION Eike Best, Frank S. de Boer, Catuscia Palamidessi
1997	B	`conf`	Refinement of Coloured Petri Nets. FCT Eike Best, Thomas Thielke
1996	B	`conf`	Linear Constraint Systems as High-Level Nets. CONCUR Eike Best, Catuscia Palamidessi
1996	A	`conf`	PEP - More than a Petri Net Tool. TACAS Bernd Grahlmann, Eike Best
1996	—	`conf`	Partial order verification with PEP. Partial Order Methods in Verification Eike Best
1996	—	`conf`	Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) Eike Best, Raymond Devillers, Maciej Koutny
1996	—	`book`	Semantics of sequential and parallel programs. Eike Best
1996	J	`jnl`	Some Major Dichotomies Relating to Future Research in Concurrency. ACM Comput. Surv. Eike Best
1995	—	`conf`	A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN) Application and Theory of Petri Nets Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz
1995	—	`conf`	A Refined View of the Box Algebra. Application and Theory of Petri Nets Eike Best, Maciej Koutny
1995	—	`conf`	An M-net Semantics of B(PN)2. STRICT Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz
1995	—	`conf`	CALIBAN - Esprit Basic Research WG 6067. STRICT Eike Best, Raymond Devillers, Elisabeth Pelz, Arend Rensink, Manuel Silva, Enrique Teruel
1995	—	`conf`	Concurrent Constraint Programming with Information Removal. CCP Frank S. de Boer, Catuscia Palamidessi, Eike Best
1995	—	`book`	Semantik - Theorie sequentieller und paralleler Programmierung. Eike Best
1995	A*	`conf`	Solving Recursive Net Equations. ICALP Eike Best, Maciej Koutny
1995	—	`conf`	Using net refinement to compute the fixpoint of a recursive. SEGRAGRA Eike Best, Maciej Koutny
1994	—	`conf`	A Memory Module Specification Using Composable High-Level Petri Nets. Formal Systems Specification Eike Best
1994	B	`conf`	Operational Semantics for the Petri Box Calculus. CONCUR Maciej Koutny, Javier Esparza, Eike Best
1993	—	`conf`	B(PN) PARLE Eike Best, Richard P. Hopkins
1993	B	`ed.`	CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings CONCUR Eike Best
1993	B	`conf`	Compositional Process Semantics of Petri Boxes. MFPS Eike Best, Hans-Günther Linde-Göers
1993	A	`conf`	General Refinement and Recursion Operators for the Petri Box Calculus. STACS Eike Best, Raymond Devillers, Javier Esparza
1992	J	`jnl`	Compositional Generation of Home States in Free Choice Nets. Formal Aspects Comput. Eike Best, Ludmila Cherkasova, Jörg Desel
1992	—	`ch.`	Esprit Basic Research Action 3148 DEMON (design methods based on nets). Advances in Petri Nets: The DEMON Project Eike Best
1992	J	`jnl`	Petri Net Semantics of Priority Systems. Theor. Comput. Sci. Eike Best, Maciej Koutny
1992	J	`jnl`	Results of the esprit basic research action 3148 demon (design methods based on nets). Microprocess. Microprogramming Eike Best
1992	—	`ch.`	The box calculus: a new causal algebra with multi-label communication. Advances in Petri Nets: The DEMON Project Eike Best, Raymond Devillers, Jon G. Hall
1992	J	`jnl`	Traps Characterize Home States in Free Choice Systems. Theor. Comput. Sci. Eike Best, Jörg Desel, Javier Esparza
1991	A	`conf`	Compositional Generation of Home States in Free Choice Systems. STACS Eike Best, Ludmila Cherkasova, Jörg Desel
1991	J	`jnl`	Concurrent Bisimulations in Petri Nets. Acta Informatica Eike Best, Raymond Devillers, Astrid Kiehn, Lucia Pomello
1991	B	`conf`	Model Checking of Persistent Petri Nets. CSL Eike Best, Javier Esparza
1991	—	`conf`	Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets. PNPM Eike Best
1990	J	`jnl`	Partial Order Behaviour and Structure of Petri Nets. Formal Aspects Comput. Eike Best, Jörg Desel
1990	B	`conf`	Partial Order Semantics of Concurrent Programs (Abstract). CONCUR Eike Best
1989	J	`jnl`	Semantic Independence. Sci. Comput. Program. Eike Best, Christian Lengauer
1988	—	`conf`	Design Methods Based on Nets, Esprit Basic Research Action DEMON. European Workshop on Applications and Theory in Petri Nets Eike Best
1988	—	`—`	Kausale Semantik nichtsequentieller Programme. Eike Best
1988	—	`book`	Nonsequential Processes - A Petri Net View Eike Best, César Fernández
1988	—	`conf`	Weighted Basic Petri Nets. Concurrency Eike Best
1987	—	`conf`	Interleaving and partial orders in concurrency: a formal comparison. Formal Description of Programming Concepts Eike Best, Raymond Devillers
1987	J	`jnl`	Sequential and Concurrent Behaviour in Petri Net Theory. Theor. Comput. Sci. Eike Best, Raymond Devillers
1986	—	`conf`	COSY: Its Relation to Nets and CSP. Advances in Petri Nets Eike Best
1986	—	`conf`	Structure Theory of Petri Nets: the Free Choice Hiatus. Advances in Petri Nets Eike Best
1985	J	`jnl`	Comments on "Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs". IEEE Trans. Computers Eike Best, Flaviu Cristian
1984	—	`conf`	Concurrency axioms and D-continuous posets. European Workshop on Applications and Theory in Petri Nets Eike Best, Agathe Merceron
1984	—	`conf`	Concurrent Behaviour: Sequences, Processes and Axioms. Seminar on Concurrency Eike Best
1984	J	`jnl`	Fairness and Conspiracies. Inf. Process. Lett. Eike Best
1984	—	`conf`	Formale Methoden zur Erstellung robuster Software. Software-Fehlertoleranz und -Zuverlässigkeit Eike Best
1984	J	`jnl`	Free Choice Systems Have Home States. Acta Informatica Eike Best, Klaus Voss
1984	—	`conf`	Frozen tokens and D-continuity: A study in relating system properties to process properties. European Workshop on Applications and Theory in Petri Nets Eike Best, Agathe Merceron
1983	—	`conf`	Discreteness, k-density and d-continuity of occurrence nets. Theoretical Computer Science Eike Best, Agathe Merceron
1983	—	`conf`	Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. CAAP Eike Best, M. W. Shields
1982	J	`jnl`	Adequacy Properties of Path Programs. Theor. Comput. Sci. Eike Best
1982	—	`conf`	Relational Semantics of Concurrent Programs (With Some Applications). Formal Description of Programming Concepts Eike Best
1981	J	`jnl`	A Formal Model of Atomicity in Asynchronous Systems. Acta Informatica Eike Best, Brian Randell
1981	—	`conf`	Information Flow in Nets. Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets Eike Best
1981	—	`conf`	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 Eike Best
1981	J	`jnl`	Systematic Detection of Exception Occurrences. Sci. Comput. Program. Eike Best, Flaviu Cristian
1980	J	`jnl`	A theorem on the characteristics of nonsequential processes. Fundam. Informaticae Eike Best
1980	B	`conf`	Proof of a Concurrent Program Finding Euler Paths. MFCS Eike Best
1979	J	`jnl`	A Note on the Proof of a Concurrent Program. Inf. Process. Lett. Eike Best
1979	—	`conf`	Adequacy of Path Programs. Advanced Course: Net Theory and Applications Eike Best
1979	—	`conf`	Atomicity of Activities. Advanced Course: Net Theory and Applications Eike Best
1979	—	`conf`	Design & Analysis of Highly Parallel & Distributed Systems. Abstract Software Specifications Peter E. Lauer, M. W. Shields, Eike Best
1979	—	`conf`	The Relative Strength of K-Density. Advanced Course: Net Theory and Applications Eike Best
1977	—	`conf`	On the Problem of Achieving Adequacy of Concurrent Programs. Formal Description of Programming Concepts Peter E. Lauer, Eike Best, Michael W. Shields
1975	—	`conf`	Martierte Petrinetze und Sigma-Teilsysteme. GI Jahrestagung Eike Best, Hans Albrecht Schmid
1975	B	`conf`	Systems of Open Paths in Petri Nets. MFCS Eike Best, Hans Albrecht Schmid