John Mullins

556 total citations
34 papers, 273 citations indexed

About

John Mullins is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, John Mullins has authored 34 papers receiving a total of 273 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 21 papers in Computer Networks and Communications and 17 papers in Computational Theory and Mathematics. Recurrent topics in John Mullins's work include Formal Methods in Verification (15 papers), Distributed systems and fault tolerance (8 papers) and Petri Nets in System Modeling (8 papers). John Mullins is often cited by papers focused on Formal Methods in Verification (15 papers), Distributed systems and fault tolerance (8 papers) and Petri Nets in System Modeling (8 papers). John Mullins collaborates with scholars based in Canada, France and Tunisia. John Mullins's co-authors include Béatrice Bérard, Nejib Ben Hadj-Alouane, Feng Lin, Abdelouahed Gherbi, Olivier Roux, Srečko Brlek, Guillaume Gardey, Muhammad Usman Qamar, Manuel Mazzara and Franck Cassez and has published in prestigious journals such as IEEE Transactions on Automatic Control, IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) and Theoretical Computer Science.

In The Last Decade

John Mullins

32 papers receiving 266 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
John Mullins Canada 10 169 160 139 57 53 34 273
Laurent Mazaré France 5 222 1.3× 189 1.2× 153 1.1× 17 0.3× 44 0.8× 9 323
Laurent Voisin France 3 166 1.0× 68 0.4× 163 1.2× 41 0.7× 79 1.5× 4 301
Farhad Mehta Switzerland 3 190 1.1× 79 0.5× 197 1.4× 46 0.8× 81 1.5× 5 333
Piotr Dembiński Poland 7 166 1.0× 93 0.6× 140 1.0× 79 1.4× 53 1.0× 20 305
Olaf Owe Norway 11 158 0.9× 217 1.4× 315 2.3× 109 1.9× 98 1.8× 73 450
Kedar S. Namjoshi United States 11 233 1.4× 104 0.7× 191 1.4× 72 1.3× 52 1.0× 24 350
Jérémy Dubreil France 5 249 1.5× 189 1.2× 161 1.2× 23 0.4× 11 0.2× 8 315
Ruggero Lanotte Italy 9 154 0.9× 79 0.5× 144 1.0× 31 0.5× 41 0.8× 49 278
Eugen Zălinescu Switzerland 11 104 0.6× 160 1.0× 213 1.5× 17 0.3× 119 2.2× 20 321
Willem-Paul de Roever Germany 6 177 1.0× 81 0.5× 210 1.5× 47 0.8× 56 1.1× 13 293

Countries citing papers authored by John Mullins

Since Specialization
Citations

This map shows the geographic impact of John Mullins'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 John Mullins with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Mullins more than expected).

Fields of papers citing papers by John Mullins

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John Mullins. 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 John Mullins. The network helps show where John Mullins may publish in the future.

Co-authorship network of co-authors of John Mullins

This figure shows the co-authorship network connecting the top 25 collaborators of John Mullins. A scholar is included among the top collaborators of John Mullins 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 John Mullins. John Mullins 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.
Nikanjam, Amin, et al.. (2021). On Assessing The Safety of Reinforcement Learning algorithms Using Formal Methods. PolyPublie (École Polytechnique de Montréal). 260–269. 2 indexed citations
2.
Mullins, John, et al.. (2021). Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language. International Journal of Foundations of Computer Science. 32(2). 175–202.
3.
Mullins, John. (2020). Nondeterministic Admissible Interference. JUCS - Journal of Universal Computer Science. 6. 1054–1070. 2 indexed citations
4.
Mullins, John, et al.. (2020). An Information Flow Method to Detect Denial of Service Vulnerabilities. PolyPublie (École Polytechnique de Montréal). 1 indexed citations
5.
Gherbi, Abdelouahed, et al.. (2019). Iterative integration of TTEthernet network flows. PolyPublie (École Polytechnique de Montréal). 9(3). 167–167. 1 indexed citations
6.
Gherbi, Abdelouahed, et al.. (2017). Design and simulation of distributed IMA architectures using TTEthernet: a model-driven approach. Journal of Ambient Intelligence and Humanized Computing. 8(3). 345–355. 6 indexed citations
7.
Bérard, Béatrice, Loı̈c Hélouët, & John Mullins. (2016). Non-interference in Partial Order Models. ACM Transactions on Embedded Computing Systems. 16(2). 1–34. 1 indexed citations
8.
Gherbi, Abdelouahed, et al.. (2016). A Modeling and Verification Approach to the Design of Distributed IMA Architectures Using TTEthernet. Procedia Computer Science. 83. 229–236. 7 indexed citations
9.
Gherbi, Abdelouahed, et al.. (2014). SMT-Based Cost Optimization Approach for the Integration of Avionic Functions in IMA and TTEthernet Architectures. PolyPublie (École Polytechnique de Montréal). 165–174. 18 indexed citations
10.
Mazzara, Manuel, et al.. (2013). Towards a formal analysis of dynamic reconfiguration in WS-BPEL. Intelligent Decision Technologies. 7(3). 213–224. 6 indexed citations
11.
Mullins, John, et al.. (2009). Model-checking Web Services Orchestrations using BP-calculus. Electronic Notes in Theoretical Computer Science. 255. 3–21. 10 indexed citations
12.
Cassez, Franck, John Mullins, & Olivier Roux. (2007). Synthesis of Non-Interferent Systems. HAL (Le Centre pour la Communication Scientifique Directe). 1. 6 indexed citations
13.
Gardey, Guillaume, John Mullins, & Olivier Roux. (2007). Non-Interference Control Synthesis for Security Timed Automata. Electronic Notes in Theoretical Computer Science. 180(1). 35–53. 14 indexed citations
14.
Brlek, Srečko, et al.. (2007). A Probabilistic Scheduler for the Analysis of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science. 194(1). 61–83. 1 indexed citations
15.
Brlek, Srečko, et al.. (2005). Anonymous and secure electronic transaction protocol. Annals of Telecommunications. 60(5-6). 530–557. 1 indexed citations
16.
Hadj-Alouane, Nejib Ben, et al.. (2004). An algorithmic approach to verification of intransitive non-interference in security policies. 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601). 6. 51–56 Vol.1. 3 indexed citations
17.
Mullins, John, et al.. (2003). Using admissible interference to detect denial of service vulnerabilities. PolyPublie (École Polytechnique de Montréal). 6–6. 9 indexed citations
18.
Mullins, John, et al.. (2003). Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols. Information and Software Technology. 45(11). 779–790. 3 indexed citations
19.
Mullins, John, et al.. (2002). Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science. 61. 154–177. 9 indexed citations
20.
Hains, Gaétan, Frédéric Loulergue, & John Mullins. (2001). Concrete data structures and functional parallel programming. Theoretical Computer Science. 258(1-2). 233–267. 2 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

Breakdown of academic impact, for papers by Laurent Mazaré Breakdown of academic impact, for papers by Laurent Voisin Breakdown of academic impact, for papers by Farhad Mehta Breakdown of academic impact, for papers by Piotr Dembiński Breakdown of academic impact, for papers by Olaf Owe Breakdown of academic impact, for papers by Kedar S. Namjoshi Breakdown of academic impact, for papers by Jérémy Dubreil Breakdown of academic impact, for papers by Ruggero Lanotte Breakdown of academic impact, for papers by Eugen Zălinescu Breakdown of academic impact, for papers by Willem-Paul de Roever
Rankless by CCL
2026