Faron Moller

2.7k total citations
48 papers, 479 citations indexed

About

Faron Moller is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Science Applications. According to data from OpenAlex, Faron Moller has authored 48 papers receiving a total of 479 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 10 papers in Computer Science Applications. Recurrent topics in Faron Moller's work include Formal Methods in Verification (22 papers), semigroups and automata theory (13 papers) and Teaching and Learning Programming (8 papers). Faron Moller is often cited by papers focused on Formal Methods in Verification (22 papers), semigroups and automata theory (13 papers) and Teaching and Learning Programming (8 papers). Faron Moller collaborates with scholars based in United Kingdom, Sweden and Israel. Faron Moller's co-authors include Yoram Hirshfeld, Mark Jerrum, Alexander Rabinovich, Tom Crick, Anton Setzer, Petr Jančar, Hoang Nga Nguyen, Steve Schneider, Helen Treharne and Markus Roggenbach and has published in prestigious journals such as ACM Computing Surveys, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Faron Moller

43 papers receiving 453 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Faron Moller United Kingdom	12	314	231	89	58	42	48	479
Joseph E. Urban United States	10	69 0.2×	171 0.7×	104 1.2×	32 0.6×	62 1.5×	78	357
Esko Nuutila Finland	8	39 0.1×	132 0.6×	25 0.3×	38 0.7×	116 2.8×	20	330
Harald Søndergaard Australia	16	475 1.5×	579 2.5×	230 2.6×	96 1.7×	87 2.1×	62	866
Carlo Bellettini Italy	10	41 0.1×	102 0.4×	57 0.6×	55 0.9×	62 1.5×	39	307
G. Jacopini Italy	5	155 0.5×	252 1.1×	106 1.2×	54 0.9×	85 2.0×	7	471
Roger Duke Australia	13	188 0.6×	296 1.3×	261 2.9×	39 0.7×	71 1.7×	40	546
Earl J. Schweppe United States	5	72 0.2×	82 0.4×	57 0.6×	223 3.8×	66 1.6×	12	344
William F. Atchison United States	5	66 0.2×	74 0.3×	57 0.6×	237 4.1×	66 1.6×	11	363
Silvio O. Navarro United States	4	82 0.3×	86 0.4×	61 0.7×	238 4.1×	68 1.6×	7	372
John W. Hamblen United States	8	97 0.3×	97 0.4×	63 0.7×	304 5.2×	95 2.3×	41	531

Countries citing papers authored by Faron Moller

Since Specialization

Citations

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

Fields of papers citing papers by Faron Moller

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Faron Moller

This figure shows the co-authorship network connecting the top 25 collaborators of Faron Moller. A scholar is included among the top collaborators of Faron Moller 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 Faron Moller. Faron Moller is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Turkay, Çağatay, et al.. (2023). From Asymptomatics to Zombies: Visualization-Based Education of Disease Modeling for Children. Warwick Research Archive Portal (University of Warwick). 1–17. 3 indexed citations

Moller, Faron, et al.. (2022). Modelling Zombies and Other Diseases. 1 indexed citations

Moller, Faron, et al.. (2019). Teaching Computing via a School Placement. Cronfa (Swansea University). 1–4. 1 indexed citations

Moller, Faron, et al.. (2019). Technoteach. Cronfa (Swansea University). 1–2. 1 indexed citations

Moller, Faron, et al.. (2014). On modelling and verifying railway interlockings: Tracking train lengths. Science of Computer Programming. 96. 315–336. 10 indexed citations

Moller, Faron, et al.. (2014). Techniques for modelling and verifying railway interlockings. International Journal on Software Tools for Technology Transfer. 16(6). 685–711. 23 indexed citations

Moller, Faron, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider, & Helen Treharne. (2013). Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B. Lecture notes in computer science. 193–208. 2 indexed citations

Roggenbach, Markus, Faron Moller, Steve Schneider, Helen Treharne, & Hoang Nga Nguyen. (2012). Railway modelling in CSP||B: the double junction case study. Surrey Research Insight Open Access (The University of Surrey). 3 indexed citations

Ball, C. D., et al.. (2012). The mindstorm effect. 141–142. 5 indexed citations

10.

Moller, Faron, et al.. (2009). Automated Verification of Signalling Principles in Railway Interlocking Systems. Electronic Notes in Theoretical Computer Science. 250(2). 19–31. 34 indexed citations

11.

Moller, Faron, Scott A. Smolka, & Jiřı́ Srba. (2004). On the computational complexity of bisimulation, redux. Information and Computation. 194(2). 129–143. 3 indexed citations

12.

Jančar, Petr, et al.. (2003). DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation. 188(1). 1–19. 10 indexed citations

13.

Moller, Faron & Alexander Rabinovich. (2003). On the expressive power of CTL. 360–368. 27 indexed citations

14.

Moller, Faron & Alexander Rabinovich. (2003). Counting on CTL*: on the expressive power of monadic path logic. Information and Computation. 184(1). 147–159. 26 indexed citations

15.

Jančar, Petr, Antonı́n Kučera, & Faron Moller. (1999). Simulation and Bisimulation over One-Counter Processes. DSpace VŠB-TUO (VŠB-TUO). 1 indexed citations

16.

Jančar, Petr, Javier Esparza, & Faron Moller. (1999). Petri Nets and Regular Processes. Journal of Computer and System Sciences. 59(3). 476–503. 14 indexed citations

17.

Hirshfeld, Yoram, Mark Jerrum, & Faron Moller. (1996). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science. 158(1-2). 143–159. 61 indexed citations

18.

Hirshfeld, Yoram, Mark Jerrum, & Faron Moller. (1996). A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Mathematical Structures in Computer Science. 6(3). 251–259. 35 indexed citations

19.

Milner, Robin & Faron Moller. (1993). Unique decomposition of processes. Theoretical Computer Science. 107(2). 357–363. 2 indexed citations

20.

Moller, Faron & Chris Tofts. (1992). An overview of TCCS. 98–103. 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