A Temporal Calculus of Communicating Systems. - Faron Moller; Chris M. N. Tofts (CONCUR, 1990)

The Importance of the Left Merge Operator in Process Algebras. - Faron Moller (ICALP, 1990)

The Nonexistence of Finite Axiomatisations for CCS Congruences - Faron Moller (LICS, 1990)

Relating Processes With Respect to Speed. - Faron Moller; Chris M. N. Tofts (CONCUR, 1991)

Verification of Parallel Systems via Decomposition. - Jan Friso Groote; Faron Moller (CONCUR, 1992)

An overview of TCCS. - Faron Moller; Chris M. N. Tofts (RTS, 1992)

Behavioural Abstraction in TCCS. - Faron Moller; Chris M. N. Tofts (ICALP, 1992)

Bisimulation Equivalence is Decidable for Basic Parallel Processes. - Søren Christensen; Yoram Hirshfeld; Faron Moller (CONCUR, 1993)

Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes - Søren Christensen; Yoram Hirshfeld; Faron Moller (LICS, 1993)

Unique Decomposition of Processes. - Robin Milner; Faron Moller (Theor. Comput. Sci., 1993)

The Mobility Workbench - A Tool for the pi-Calculus. - Björn Victor; Faron Moller (CAV, 1994)

A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. - Yoram Hirshfeld; Faron Moller (CONCUR, 1994)

A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes - Yoram Hirshfeld; Mark Jerrum; Faron Moller (FOCS, 1994)

Decidable Subsets of CCS. - Søren Christensen; Yoram Hirshfeld; Faron Moller (Comput. J., 1994)

Decidability Results in Automata and Process Theory. - Yoram Hirshfeld; Faron Moller (Banff Higher Order Workshop, 1995)

Checking Regular Properties of Petri Nets. - Petr Jancar; Faron Moller (CONCUR, 1995)

On the Computational Complexity of Bisimulation. - Faron Moller; Scott A. Smolka (ACM Comput. Surv., 1995)

Infinite Results. - Faron Moller (CONCUR, 1996)

Logics for Concurrency: Structure Versus Automata. - Faron Moller (ACM Comput. Surv., 1996)

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. - Yoram Hirshfeld; Mark Jerrum; Faron Moller (Math. Struct. Comput. Sci., 1996)

A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. - Yoram Hirshfeld; Mark Jerrum; Faron Moller (Theor. Comput. Sci., 1996)

Preface. - Faron Moller (INFINITY, 1997)

A Taxonomy of Infinite State Processes. - Faron Moller (MFCS Workshop on Concurrency, 1998)

Techniques for Decidability and Undecidability of Bisimilarity. - Petr Jancar; Faron Moller (CONCUR, 1999)

On the Expressive Power of CTL. - Faron Moller; Alexander Moshe Rabinovich (LICS, 1999)

Simulation Problems for One-Counter Machines. - Petr Jancar; Faron Moller; Zdenek Sawa (SOFSEM, 1999)

Petri Nets and Regular Processes. - Petr Jancar; Javier Esparza; Faron Moller (J. Comput. Syst. Sci., 1999)

On the star height of unary regular behaviours. - Yoram Hirshfeld; Faron Moller (Proof, Language, and Interaction, 2000)

Simulation and Bisimulation over One-Counter Processes. - Petr Jancar; Antonín Kucera 001; Faron Moller (STACS, 2000)

Verification on Infinite Structures. - Olaf Burkart; Didier Caucal; Faron Moller; Bernhard Steffen (Handbook of Process Algebra, 2001)

Pushdown automata, multiset automata, and Petri nets. - Yoram Hirshfeld; Faron Moller (Theor. Comput. Sci., 2001)

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. - Petr Jancar; Antonín Kucera 001; Faron Moller; Zdenek Sawa (FoSSaCS, 2002)

Formal Methods in Computation. - Faron Moller (Comput. J., 2002)

On the Computational Complexity of Bisimulation, Redux. - Faron Moller; Scott A. Smolka (PCK50, 2003)

Deciding Bisimilarity between BPA and BPP Processes. - Petr Jancar; Antonín Kucera 001; Faron Moller (CONCUR, 2003)

Counting on CTL*: on the expressive power of monadic path logic. - Faron Moller; Alexander Moshe Rabinovich (Inf. Comput., 2003)

Preface. - Julian C. Bradfield; Faron Moller (INFINITY, 2004)

DP lower bounds for equivalence-checking and model-checking of one-counter automata. - Petr Jancar; Antonín Kucera 001; Faron Moller; Zdenek Sawa (Inf. Comput., 2004)

On the computational complexity of bisimulation, redux. - Faron Moller; Scott A. Smolka; Jirí Srba (Inf. Comput., 2004)

Weak Bisimulation Approximants. - Will Harwood; Faron Moller; Anton Setzer (CSL, 2006)

On the Complexity of Parity Games. - Arnold Beckmann; Faron Moller (BCS Int. Acad. Conf., 2008)

Automated Verification of Signalling Principles in Railway Interlocking Systems. - Karim Kanso; Faron Moller; Anton Setzer (AVoCS, 2008)

Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B. - Faron Moller; Hoang Nga Nguyen; Markus Roggenbach; Steve A. Schneider; Helen Treharne (Haifa Verification Conference, 2012)

Safety and Line Capacity in Railways - An Approach in Timed CSP. - Yoshinao Isobe; Faron Moller; Hoang Nga Nguyen; Markus Roggenbach (IFM, 2012)

The mindstorm effect: a gender analysis on the influence of LEGO mindstorms in computer science education. - Catherine Ball; Faron Moller; Reena Pau (WiPSCE, 2012)

Railway modelling in CSP||B: the double junction case study. - Markus Roggenbach; Faron Moller; Steve A. Schneider; Helen Treharne; Hoang Nga Nguyen (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

Verification of Solid State Interlocking Programs. - Phillip James; Andy Lawrence; Faron Moller; Markus Roggenbach; Monika Seisenberger; Anton Setzer; Karim Kanso; Simon Chadwick (SEFM Workshops, 2013)

Verification of Scheme Plans Using CSP $$||$$ | | B. - Phillip James; Faron Moller; Hoang Nga Nguyen; Markus Roggenbach; Steve A. Schneider; Helen Treharne; Matthew Trumble; David M. Williams (SEFM Workshops, 2013)

Guest Editorial. - Jan A. Bergstra; Jens Blanck; Faron Moller; Stanley S. Wainer (Comput. J., 2013)

Modelling Computing Systems - Mathematics for Computer Science. - Faron Moller; Georg Struth (Springer, 2013)

Visualising Timed CSP Train Simulations for Capacity. - Lloyd Roberts; Mike Smith; Faron Moller; Markus Roggenbach (TPCG, 2014)

On modelling and verifying railway interlockings: Tracking train lengths. - Phillip James; Faron Moller; Hoang Nga Nguyen; Markus Roggenbach; Steve A. Schneider; Helen Treharne (Sci. Comput. Program., 2014)

Techniques for modelling and verifying railway interlockings. - Phillip James; Faron Moller; Nguyen Hoang Nga; Markus Roggenbach; Steve A. Schneider; Helen Treharne (Int. J. Softw. Tools Technol. Transf., 2014)

Technocamps: Advancing Computer Science Education in Wales. - Tom Crick; Faron Moller (WiPSCE, 2015)

OnTrack: The Railway Verification Toolset - Extended Abstract. - Phillip James; Faron Moller; Hoang Nga Nguyen; Markus Roggenbach; Helen Treharne; Xu Wang 001 (ISoLA (2), 2016)

A Specification Theory of Real-Time Processes. - Chris Chilton; Marta Z. Kwiatkowska; Faron Moller; Xu Wang 001 (Concurrency, Security, and Puzzles, 2017)

Teaching Computing via a School Placement. - Faron Moller; Stewart Powell (CEP, 2019)

Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -. - Antonio Cerone; Markus Roggenbach; James H. Davenport; Casey Denner; Marie Farrell; Magne Haveraaen; Faron Moller; Philipp Körner; Sebastian Krings; Peter Csaba Ölveczky; Bernd-Holger Schlingloff; Nikolay V. Shilov 002; et al. (FMFun, 2019)

Teaching Them Early: Formal Methods in School. - Faron Moller; Liam O'Reilly; Stewart Powell; Casey Denner (FMFun, 2019)

Visualising Railway Safety Verification. - Filippos Pantekis; Phillip James; Liam O'Reilly; Daniel Archambault; Faron Moller (FTSCS, 2019)

Teaching Discrete Mathematics to Computer Science Students. - Faron Moller; Liam O'Reilly (FMTea, 2019)

Technoteach: Supporting Computing Teachers Across Wales. - Faron Moller; Stewart Powell (WiPSCE, 2019)

Hands-on Security Testing in a University Lab Environment. - Phillip James; Lauren Powell; Liam O'Reilly; Faron Moller (ITiCSE, 2020)

Report on BCTCS & AlgoUK 2020. - Ulrich Berger 001; Faron Moller (Bull. EATCS, 2020)

Software Model Checking of Interlocking Programs. - Phillip James; Faron Moller; Markus Roggenbach (Applicable Formal Methods for Safe Industrial Products, 2023)

From Asymptomatics to Zombies: Visualization-Based Education of Disease Modeling for Children. - Graham Mcneill; Max Sondag; Stewart Powell; Phoebe Asplin; Cagatay Turkay; Faron Moller; Daniel Archambault (CHI, 2023)

Technocamps: Highlighting 20 Years of Transforming Digital Education in Wales. - Tom Crick; Faron Moller (ITiCSE (2), 2023)

Institute of Coding in Wales Digital Skills Bootcamps - A Model for Stackable Micro-credentials. - Casey Hopkins; Faron Moller; Laura Robert (UKICER, 2023)

Technocamps: 30 Years of Digital Education and Professional Development Throughout Wales. - Faron Moller (UKICER, 2023)

Digital Outreach via Theatre Productions. - Faron Moller; Geinor Styles; Luke Clement (UKICER, 2023)

Generative AI in Software Development Education: Insights from a Degree Apprenticeship Programme. - Olga Petrovska; Lee Clift; Faron Moller (UKICER, 2023)

Institute of Coding in Wales Digital Skills Bootcamps - Micro-Credentials: A Pilot Project. - Casey Hopkins; Faron Moller (CEP, 2024)

Incorporating Generative AI into Software Development Education. - Olga Petrovska; Lee Clift; Faron Moller; Rebecca Pearsall (CEP, 2024)

OnTrack: Reflecting on domain specific formal methods for railway designs. - Phillip James; Faron Moller; Filippos Pantekis (Sci. Comput. Program., 2024)