Faron Moller | |
|---|---|
 Faron Moller | |
| Born | Faron George Moller 25 February 1962 |
| Alma mater |
|
| Scientific career | |
| Fields | Theoretical computer science[1] |
| Institutions | Swansea University University of Strathclyde University of Edinburgh Swedish Institute for Computer Science Royal Institute of Technology Uppsala University |
| Thesis | Axioms for Concurrency (1989) |
| Doctoral advisor | Robin Milner |
| Website | www |
Faron George Moller FLSW FBCS FIMA (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.[1] 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;[2] 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.[3][4][5][6]
- ^ a b Faron Moller publications indexed by Google Scholar
- ^ http://cs.swansea.ac.uk/Rail/
- ^ 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. doi:10.1016/j.ic.2004.06.003
- ^ F Moller and G Struth, Modelling Computing Systems, Springer-Verlag 2013. ISBN 9781848003217