Faron Moller

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Faron George Moller (born February 25, 1962 in Trail, British Columbia) 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.


Moller studied mathematics and computer science as an undergraduate at the University of British Columbia, and then as a Masters student at the University of Waterloo, before going on to do a PhD supervised by Robin Milner in the Laboratory for Foundations of Computer Science at the University of Edinburgh. He has held posts at Strathclyde University, Edinburgh University, The Swedish Institute for Computer Science, The Royal Institute of Technology in Stockholm, and Uppsala University before moving to Wales as Professor of Computer Science at Swansea University in 2000.

Professor Moller is a Fellow of the British Computer Society and Fellow of the Institute of Mathematics and its Applications, and in 2004 was elected President of the British Colloquium for Theoretical Computer Science. He is also Director of Technocamps, a pan-Wales schools outreach programme supported by a £6 million European grant aimed at inspiring young people to study computing-based topics.

Selected Publications[edit]

  • F Moller, Infinite Results, in U Montanari and V Sassone (eds.), Lecture Notes in Computer Science, Volume 1119, Springer Verlag (1996), pp195–216.
  • O Burkart, D Caucal, F Moller and B Steffen, Verification over Infinite States, in J Bergstra, A Ponse and S A Smolka (eds.), Handbook of Process Algebra, Elsevier (2001), pp545–623.
  • F Moller, S A Smolka and J Srba, On the Computational Complexity of Bisimulation, Redux, Information and Computation , Volume 194(2), Elsevier (2004), pp129–143.
  • F Moller and G Struth, Modelling Computing Systems, Springer-Verlag 2013. ISBN 9781848003217.

External links[edit]