Faron Moller

Q: What Schools Are Affiliated With Faron Moller

Faron Moller is affiliated with the following schools: Uppsala University, University of Wales, University of Edinburgh

Faron Moller's AcademicInfluence.com Rankings

Faron Moller

Computer Science

#1387

World Rank

#1435

Historical Rank

Database

#6521

World Rank

#6756

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Faron Moller Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Faron George Moller is a Canadian-born British computer scientist and expert on theoretical computer science, particularly infinite-state automata theory and temporal logic. His work has focussed on structural decomposition techniques for analysing abstract models of computing systems. He is founding Director of the Swansea Railway Verification Group; Director of Technocamps; and Head of the Institute of Coding in Wales. In 2023, he was elected General Secretary of the Learned Society of Wales.

(See a Problem?)

Faron Moller's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Temporal Calculus of Communicating Systems (1990) (479)
Verification on Infinite Structures (2001) (220)
The Mobility Workbench - A Tool for the pi-Calculus (1994) (220)
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes (1994) (146)
Bisimulation Equivalence is Decidable for Basic Parallel Processes (1993) (145)
Infinite Results (1996) (103)
Axioms for concurrency (1989) (96)
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (1994) (93)
Unique decomposition of processes (1993) (88)
Logics for Concurrency (1996) (87)
The Importance of the Left Merge Operator in Process Algebras (1990) (80)
Relating Processes With Respect to Speed (1991) (77)
Checking Regular Properties of Petri Nets (1995) (72)
Logics for concurrency: structure versus automata (1996) (66)
Automated Verification of Signalling Principles in Railway Interlocking Systems (2009) (61)
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes (1993) (55)
On the expressive power of CTL (1999) (51)
The nonexistence of finite axiomatisations for CCS congruences (1990) (49)
Counting on CTL*: on the expressive power of monadic path logic (2003) (45)
Techniques for modelling and verifying railway interlockings (2014) (42)
Simulation Problems for One-Counter Machines (1999) (41)
Simulation and Bisimulation over One-Counter Processes (2000) (39)
Petri Nets and Regular Processes (1999) (39)
A university-based model for supporting computer science curriculum reform (2018) (39)
DP lower bounds for equivalence-checking and model-checking of one-counter automata (2004) (38)
Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B (2012) (37)
Behavioural Abstraction in TCCS (1992) (35)
Techniques for Decidability and Undecidability of Bisimilarity (1999) (33)
Decidable Subsets of CCS (1994) (33)
Decidability Results in Automata and Process Theory (1996) (28)
Verification of Parallel Systems via Decomposition (1992) (27)
Verification of Solid State Interlocking Programs (2013) (26)
A polynomial-time algorithm for deciding equivalence of normed context-free processes (1994) (24)
Safety and Line Capacity in Railways - An Approach in Timed CSP (2012) (24)
Verification of Scheme Plans Using CSP $$||$$ | | B (2013) (23)
On the computational complexity of bisimulation (1995) (22)
On modelling and verifying railway interlockings: Tracking train lengths (2014) (22)
Pushdown automata, multiset automata, and Petri nets (2001) (20)
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes (1994) (17)
Simulation of One-Counter Nets via Colouring (1999) (15)
On the computational complexity of bisimulation, redux (2003) (14)
Railway modelling in CSP||B: the double junction case study (2012) (12)
Weak Bisimulation Approximants (2006) (12)
Deciding Bisimilarity between BPA and BPP Processes (2003) (11)
Technocamps: Advancing Computer Science Education in Wales (2015) (11)
A Taxonomy of Infinite State Processes (1998) (11)
A National Engagement Model for Developing Computer Science Education in Wales (2016) (9)
Process Algebra as a Tool for Real Time Analysis (1991) (8)
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (2002) (8)
The mindstorm effect: a gender analysis on the influence of LEGO mindstorms in computer science education (2012) (8)
Automated Verification of Signalling Principles in Railway Interlockings (2008) (7)
Decomposing scheme plans to manage verification complexity (2014) (7)
Modelling Computing Systems: Mathematics for Computer Science (2013) (6)
An overview of TCCS (1992) (5)
B modelling for railway verification : the double junction case study (2012) (5)
On the Complexity of Parity Games (2008) (4)
Hands-on Security Testing in a University Lab Environment (2020) (4)
Rooting Formal Methods within Higher Education Curricula for Computer Science and Software Engineering - A White Paper (2020) (3)
Teaching Them Early: Formal Methods in School (2019) (3)
A Taxonomy of Innnite State Processes (1998) (3)
Timed CSP Simulator (2012) (3)
On the star height of unary regular behaviours (2000) (3)
OnTrack: The Railway Verification Toolset - Extended Abstract (2016) (2)
The specification of an asynchronous router (1996) (2)
Teaching Discrete Mathematics to Computer Science Students (2019) (1)
Using CSP | | B and ProB for railway modelling (2012) (1)
A Specification Theory of Real-Time Processes (2017) (1)
Veriication on Innnite Structures (2000) (1)
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata (1996) (1)
TCCS : A Temporal Calculus of Communicating Systems ( DRAFT ) (2001) (1)
Techniques for modelling and verifying railway interlockings (2014) (0)
A university-based model for supporting computer science curriculum reform (2018) (0)
Advancing Computer Science Education in Wales (2018) (0)
Distinguishing Between Processes (2013) (0)
OnTrack: The Railway Verification Toolset (2016) (0)
Visualising Railway Safety Verification (2019) (0)
Technoteach (2019) (0)
Teaching Computing via a School Placement (2019) (0)
Games and Strategies (2013) (0)
Boolean Algebras and Circuits (2013) (0)
On Teaching Discrete Mathematics to Freshman Computer Science Students (2019) (0)
Number 7 (2017) (0)
Preface: Volume 9 (1997) (0)
Report on BCTCS & AlgoUK 2020 (2020) (0)
Inductive and Recursive Definitions (2013) (0)
Invited Talks at BCTCS 2006 (2006) (0)
Proofs by Induction (2013) (0)
Guest Editorial (2013) (0)
Logical Properties of Processes (2013) (0)
The Speciication of an Asynchronous Router (1997) (0)
Towards the Verification of Bidirectional Railway Models in CSP||B (2014) (0)
Identifying Conflicting Routes in Control Table of Indian Railways Interlocking System using NuSMV (2017) (0)
Preface (2004) (0)
Counting on CTL : On the Expressive (2003) (0)
Technoteach: Supporting Computing Teachers Across Wales (2019) (0)
Contents and abstracts of the Electronic Notes in Theoretical Computer Science vol. 9: Preface volume 9 (1999) (0)
Formal Methods in Computation (2002) (0)
Asynchronous router specification (1997) (0)
Visualising Timed CSP Train Simulations for Capacity (2014) (0)

This paper list is powered by the following services:

Other Resources About Faron Moller

en.wikipedia.org

What Schools Are Affiliated With Faron Moller?

Faron Moller is affiliated with the following schools:

Faron Moller's Academic­Influence.com Rankings