Eike Best
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Eike Best has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Raymond Devillers
Universite Libre de Bruxelles
15 shared publications - Maciej Koutny
Newcastle University
10 shared publications - Raymond Devillers
Universite Libre de Bruxelles
4 shared publications - Kamila Barylska
Nicolaus Copernicus University
2 shared publications - Petr Jančar
Palacký University
2 shared publications - Philippe Darondeau
INRIA, Centre Rennes - Bretagne Atlantique, Campus de Beaulieu, F-35042 Rennes Cedex, France
2 shared publications
Latest Publications
- Open Access
Well-Formed Free-Choice Petri Nets Revisited
The theory of free-choice Petri nets is an established field, initiated in the 1970s by Commoner and Hack at MIT. We revisit well-formed free-choice nets (those admitting markings that are both live and bounded) and provide a new characterization by introducing semi-T-components. This notion is dual to that of semi-S-components, which in turn correspond to the well-known minimal siphons. By highlighting the symmetry between these dual concepts, we derive the classical coverability theorems for T- and S-components, as well as the duality theorem -- stating that a free-choice net is well-formed if and only if its reverse-dual is also well-formed -- using arguments that are as symmetric as possible.
Open AccessWell-Formed Free-Choice Petri Nets Revisited
The theory of free-choice Petri nets is an established field, initiated in the 1970s by Commoner and Hack at MIT. We revisit well-formed free-choice nets (those admitting markings that are both live and bounded) and provide a new characterization by introducing semi-T-components. This notion is dual to that of semi-S-components, which in turn correspond to the well-known minimal siphons. By highlighting the symmetry between these dual concepts, we derive the classical coverability theorems for T- and S-components, as well as the duality theorem -- stating that a free-choice net is well-formed if and only if its reverse-dual is also well-formed -- using arguments that are as symmetric as possible.
- 8 June 2025
- Published by Springer Nature
- p. 155-173
Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański’s Conjecture
- 8 June 2025
- Published by Springer Nature
- p. 155-173
Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański’s Conjecture
- 13 June 2024
- Published by Springer Nature
- p. 223-243
Petri Net Synthesis from a Reachability Set
- 6 July 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 161 (4) , I-II
Preface
- 1 June 2018
- Published by Elsevier in Science of Computer Programming
- Vol. 157, 41-55
Pre-synthesis of Petri nets based on prime cycles and distance paths
- 1 June 2018
- Published by Elsevier in Science of Computer Programming
- Vol. 157, 41-55
Pre-synthesis of Petri nets based on prime cycles and distance paths
- 20 November 2017
- Published by Springer Nature in Acta Informatica
- Vol. 55 (7) , 575-611
Bounded choice-free Petri net synthesis: algorithmic issues
- 20 November 2017
- Published by Springer Nature in Acta Informatica
- Vol. 55 (7) , 575-611
Bounded choice-free Petri net synthesis: algorithmic issues
- 11 January 2017
- Published by Springer Nature
- p. 132-146
Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict
- 11 January 2017
- Published by Springer Nature
- p. 132-146
Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict
- 2 September 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 137-159
Conditions for Petri Net Solvable Binary Words
- 2 September 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 137-159
Conditions for Petri Net Solvable Binary Words