University | Department | People | Research | Teaching | IT Wales

Faron G Moller, BSc (UBC), MMath (Waterloo), PhD (Edinburgh), CITP, CMath, CSci, FBCS, FIMA
Professor of Computer Science

Research: Concurrency theory, particularly verification problems for infinite state automata; modal and temporal logic. Courses: CS_116: Modelling Computing Systems CS_332: Designing Algorithms CS_M23: Formal Methods for System Reliability Contact: tel: (+44) (0)1792 295 160 fax: (+44) (0)1792 295 708 email: F.G.Moller@swansea.ac.uk post: Department of Computer Science, Swansea University, Singleton Park, Swansea SA2 8PP,  UK

Useful links

Selected Recent Publications

1. Karim Kanso, Faron Moller and Anton Setzer, Automated Verification of Signalling Principles in Railway Interlockings. Proceedings of AVOCS'08: Eighth International Workshop on Automated Verification of Critical Systems, Glasgow, October 2008, 12 pages.
2. Arnold Beckmann and Faron Moller, On the Complexity of Parity Games. Proceedings of BCS'08: Visions of Computer Science, London, September 2008, pp237-247.
3. Will Harwood, Faron Moller and Anton Setzer, Weak Bisimulation Approximants. Proceedings of CSL'06: The 15th International Conference on Computer Science Logic, Lecture Notes in Computer Science, Szeged, Hungary, September 2006.
4. Will Harwood and Faron Moller, Weak Bisimulation Approximants. Selected Papers from the CALCO Young Researchers Workshop (CALCO-jnr 2005), Peter Mosses, John Power and Monika Seisenberger (editors), Research Report CSR 18-2005, pages 27-39, Swansea University, 2005.
5. Julian Bradfield and Faron Moller, Preface to the Proceedings of the 6th International Workshop on Verification of Infinite-State Systems (Infinity 2004). Electronic Notes in Theoretical Computer Science 138(3):1, 2005.
6. Faron Moller, Scott Smolka and Jiri Srba, On the Computational Complexity of Bisimulation, Redux. Information and Computation 194(2):129-143, 2004.
7. Petr Jancar, Antonin Kucera, Faron Moller and Zdenek Sawa, DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation 188(1):1-19, 2004.
8. Faron Moller and Alexander Rabinovich, Counting on CTL*: On the Expressive Power of Monadic Path Logic. Information and Computation 184:147-159, 2003.
9. Petr Jancar, Antonin Kucera and Faron Moller, Deciding bisimilarity between BPA and BPP processes. Proceedings of CONCUR'03: The 14th International Conference on Concurrency Theory, R. Amadio and D. Lugiez (editor), Lecture Notes in Computer Science 2761:159-173, Marseille, September 2003.
10. Petr Jancar, Antonin Kucera, Faron Moller and Zdenek Sawa, Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Proceedings of FOSSACS'02: Foundations of Software Science and Computation Structures, M. Nielsen (editor), Lecture Notes in Computer Science 2303:173-187, Grenoble, April 2002.
11. Yoram Hirshfeld and Faron Moller, Pushdown automata, multiset automata, and Petri nets. Theoretical Computer Science 256:3-21, April 2001.
12. Johan Larsson and Faron Moller, Algorithm = Iterator + Visitor. Journal of Object Oriented Programming (online, http://www.joopmag.com), December 2001.
13. Olaf Burkart, Didier Caucal, Faron Moller and Bernhard Steffen, Verification over Infinite States. Chapter in the Handbook of Process Algebra, J. Bergstra, A. Ponse and S.A. Smolka (editors), pp545-623, Elsevier Publishers, 2001.
14. Yoram Hirshfeld and Faron Moller, On the star height of unary regular behaviours. In Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling, and M. Tofte (editors), pp497-509, MIT Press, 2000.
15. Petr Jancar, Antonin Kucera and Faron Moller, Simulation and bisimulation over one-counter processes. Proceedings of STACS'00: The 17th International Symposium on Theoretical Aspects of Computer Science, H. Reichel and S. Tison (editors), Lecture Notes in Computer Science 1770:334-345, Lille, February 2000.
16. Javier Esparza, Petr Jancar and Faron Moller, Petri nets and regular processes. Journal of Computer and Systems Sciences 59(3):476-503, December 1999.
17. Petr Jancar and Faron Moller, Techniques for decidability and undecidability for bisimilarity. Proceedings of CONCUR'99: The 10th International Conference on Concurrency Theory, J.C.M. Baeten and S. Mauw (editors), Lecture Notes in Computer Science 1664:30-45, Eindhoven, August 1999.
18. Faron Moller and Alexander Rabinovich, On the expressive power of CTL*. Proceedings of LICS'99: The 14th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, pp360-369, Trento, July 1999.
19. Petr Jancar, Faron Moller and Zdenek Sawa, Simulation problems for one-counter machines. Proceedings of SOFSEM'99: The 26th Seminar on Current Trends in Theory and Practice of Informatics, J. Pavelka , G. Tel and M. Bartosek (editors), Lecture Notes in Computer Science 1725:398-407, Milovy, November 1999.
20. Faron Moller. A Taxonomy of Infinite State Processes. Electronic Notes in Theoretical Computer Science 18, 1998.
21. Faron Moller. The specification of an asynchronous router. IEEE Aerospace and Electronics Systems Magazine 12(3):38-44, 1997.
22. Faron Moller. Logics for concurrency: structure versus automata. ACM Computing Surveys 28(A)(4), December 1996.
23. Various Authors. Strategic directions in concurrency research.
(Contributing author, edited by R. Cleaveland and S. Smolka.) ACM Computing Surveys 28(4):607-625, December 1996.
24. Yoram Hirshfeld, Mark Jerrum and Faron Moller. A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Journal of Mathematical Structures in Computer Science 6:251-259, 1996.
25. Yoram Hirshfeld, Mark Jerrum and Faron Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158:143-159, 1996.
26. Faron Moller, Infinite Results. Proceedings of CONCUR'96: The 7th International Conference on Concurrency Theory, U. Montanari and V. Sassone (editors), Lecture Notes in Computer Science 1119:195-216, Pisa, August 1996.