Raymond Devillers

1.8k total citations
75 papers, 582 citations indexed

About

Raymond Devillers is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Raymond Devillers has authored 75 papers receiving a total of 582 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 20 papers in Management Information Systems. Recurrent topics in Raymond Devillers's work include Petri Nets in System Modeling (40 papers), Formal Methods in Verification (31 papers) and Business Process Modeling and Analysis (18 papers). Raymond Devillers is often cited by papers focused on Petri Nets in System Modeling (40 papers), Formal Methods in Verification (31 papers) and Business Process Modeling and Analysis (18 papers). Raymond Devillers collaborates with scholars based in Belgium, France and Germany. Raymond Devillers's co-authors include Eike Best, Joël Goossens, Maciej Koutny, Hanna Klaudel, Astrid Kiehn, Lucia Pomello, Antti Valmari, Peter Lauer, Ryszard Janicki and Nicolas Navet and has published in prestigious journals such as Communications of the ACM, BMC Bioinformatics and Theoretical Computer Science.

In The Last Decade

Raymond Devillers

64 papers receiving 514 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Raymond Devillers Belgium 12 438 182 155 146 132 75 582
Éric Badouel France 11 342 0.8× 129 0.7× 96 0.6× 39 0.3× 160 1.2× 33 404
Alain Finkel France 8 442 1.0× 104 0.6× 61 0.4× 66 0.5× 229 1.7× 30 553
Giacomo Bucci Italy 12 252 0.6× 70 0.4× 56 0.4× 171 1.2× 77 0.6× 43 403
Rüdiger Valk Germany 7 306 0.7× 98 0.5× 184 1.2× 27 0.2× 107 0.8× 18 456
Jonathan Billington Australia 9 271 0.6× 98 0.5× 100 0.6× 51 0.3× 56 0.4× 57 359
Nadia Busi Italy 14 247 0.6× 220 1.2× 97 0.6× 27 0.2× 255 1.9× 51 513
Hanifa Boucheneb Canada 11 271 0.6× 90 0.5× 87 0.6× 105 0.7× 50 0.4× 60 404
C. Dutheillet France 6 207 0.5× 89 0.5× 104 0.7× 51 0.3× 22 0.2× 11 287
Pieter S. Kritzinger South Africa 10 121 0.3× 137 0.8× 92 0.6× 37 0.3× 36 0.3× 30 301
Philippe Schnoebelen France 7 267 0.6× 50 0.3× 30 0.2× 45 0.3× 233 1.8× 20 385

Countries citing papers authored by Raymond Devillers

Since Specialization
Citations

This map shows the geographic impact of Raymond Devillers's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Raymond Devillers with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Raymond Devillers more than expected).

Fields of papers citing papers by Raymond Devillers

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Raymond Devillers. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Raymond Devillers. The network helps show where Raymond Devillers may publish in the future.

Co-authorship network of co-authors of Raymond Devillers

This figure shows the co-authorship network connecting the top 25 collaborators of Raymond Devillers. A scholar is included among the top collaborators of Raymond Devillers based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Raymond Devillers. Raymond Devillers is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Best, Eike & Raymond Devillers. (2024). Petri Net Primer. 2 indexed citations
2.
Devillers, Raymond, et al.. (2019). Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. Fundamenta Informaticae. 169(1-2). 1–30. 1 indexed citations
3.
Best, Eike & Raymond Devillers. (2018). Pre-synthesis of Petri nets based on prime cycles and distance paths. Science of Computer Programming. 157. 41–55. 1 indexed citations
4.
Best, Eike, et al.. (2017). Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica. 55(7). 575–611. 7 indexed citations
5.
Best, Eike & Raymond Devillers. (2016). Characterisation of the state spaces of marked graph Petri nets. Information and Computation. 253. 399–410. 8 indexed citations
6.
Devillers, Raymond, et al.. (2008). Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms. HAL (Le Centre pour la Communication Scientifique Directe). 209–216. 20 indexed citations
7.
Klaudel, Hanna, et al.. (2007). Incremental and unifying modelling formalism for biological interaction networks. BMC Bioinformatics. 8(1). 433–433. 4 indexed citations
8.
Goossens, Joël, et al.. (2006). Joint garbage collection and hard real-time scheduling. 2(3). 313–326. 3 indexed citations
9.
Goossens, Joël, et al.. (2006). Joint garbage collection and hard real-time scheduling. 2(3-4). 313–326. 1 indexed citations
10.
Devillers, Raymond & Hanna Klaudel. (2005). Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. Fundamenta Informaticae. 66(3). 221–257. 1 indexed citations
11.
Devillers, Raymond, et al.. (2003). General parameterised refinement and recursion for the M-net calculus. Theoretical Computer Science. 300(1-3). 259–300. 10 indexed citations
12.
Goossens, Joël, Raymond Devillers, Shelby Funk, & Michael González Harbour. (2002). Tie-breaking for EDF on multiprocessor platforms. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 17–20. 2 indexed citations
13.
Devillers, Raymond, Hanna Klaudel, Maciej Koutny, & Franck Pommereau. (2002). Asynchronous Box Calculus. Fundamenta Informaticae. 54(4). 295–344. 9 indexed citations
14.
Best, Eike, Raymond Devillers, & Maciej Koutny. (2002). The Box Algebra=Petri Nets+Process Expressions. Information and Computation. 178(1). 44–100. 1 indexed citations
15.
Goossens, Joël & Raymond Devillers. (1999). General response time computation for hard real-time asynchronous periodic task sets using static schedulers. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 1 indexed citations
16.
Goossens, Joël & Raymond Devillers. (1997). The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems. Real-Time Systems. 13(2). 107–126. 31 indexed citations
17.
Devillers, Raymond, et al.. (1997). General Refinement in the M-net Calculus: (LIT 357). Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 1 indexed citations
18.
Devillers, Raymond. (1990). The semantics of capacities in P/T nets. Springer eBooks. 128–150. 2 indexed citations
19.
Best, Eike & Raymond Devillers. (1987). Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science. 55(1). 87–136. 125 indexed citations
20.
Janicki, Ryszard, Peter Lauer, Maciej Koutny, & Raymond Devillers. (1986). Concurrent and maximally concurrent evolution of nonsequential systems. Theoretical Computer Science. 43. 213–238. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026