Countries citing papers authored by Philippe Darondeau
Since
Specialization
Citations
This map shows the geographic impact of Philippe Darondeau'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 Philippe Darondeau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Darondeau more than expected).
Fields of papers citing papers by Philippe Darondeau
This network shows the impact of papers produced by Philippe Darondeau. 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 Philippe Darondeau. The network helps show where Philippe Darondeau may publish in the future.
Co-authorship network of co-authors of Philippe Darondeau
This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Darondeau.
A scholar is included among the top collaborators of Philippe Darondeau 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 Philippe Darondeau. Philippe Darondeau is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Darondeau, Philippe, et al.. (2008). Synthesis of Nets with Step Firing Policies. School of Computing Science Technical Report Series.1 indexed citations
5.
Best, Eike, et al.. (2007). Making Petri Nets Safe and Free of Internal Transitions. 80(1). 75–90.1 indexed citations
Badouel, Éric & Philippe Darondeau. (2002). The Petri net synthesis problem for automatic graphs. HAL (Le Centre pour la Communication Scientifique Directe).
9.
Badouel, Éric, Philippe Darondeau, & Andrew Tokmakoff. (1999). Modelling Dynamic Agent Systems with Cooperating Automata.. OpenGrey (Institut de l'Information Scientifique et Technique). 11–17.4 indexed citations
Badouel, Éric & Philippe Darondeau. (1996). On the Synthesis of General Petri Nets. OpenGrey (Institut de l'Information Scientifique et Technique).23 indexed citations
13.
Badouel, Éric & Philippe Darondeau. (1995). Trace nets and process automata. Acta Informatica. 32(7). 647–679.9 indexed citations
Darondeau, Philippe, et al.. (1992). Fairness, distances and degrees. Theoretical Computer Science. 97(1). 131–142.6 indexed citations
17.
Darondeau, Philippe. (1991). Recursive Graphs are not Stable under Maximal Reduction.. Bulletin of the European Association for Theoretical Computer Science. 44. 186–189.1 indexed citations
18.
Badouel, Éric & Philippe Darondeau. (1990). A note on guarded recursion. OpenGrey (Institut de l'Information Scientifique et Technique).1 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.