| A temporal calculus of communicating systems F Moller, C Tofts International Conference on Concurrency Theory, 401-415, 1990 | 623 | 1990 |
| The mobility workbench — A tool for the π-Calculus B Victor, F Moller Computer Aided Verification: 6th International Conference, CAV'94 Stanford …, 1994 | 410 | 1994 |
| Verification on infinite structures O Burkart, D Caucal, F Moller, B Steffen Handbook of Process algebra, 545-623, 2001 | 268 | 2001 |
| Bisimulation equivalence is decidable for basic parallel processes S Christensen, Y Hirshfeld, F Moller CONCUR'93: 4th Intrenational Conference on Concurrency Theory Hildesheim …, 1993 | 226 | 1993 |
| A polynomial algorithm for deciding bisimilarity of normed context-free processes Y Hirshfeld, M Jerrum, F Moller Theoretical Computer Science 158 (1-2), 143-159, 1996 | 186 | 1996 |
| Infinite results F Moller International Conference on Concurrency Theory, 195-216, 1996 | 159 | 1996 |
| A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes Y Hirshfeld, M Jerrum, F Moller Mathematical Structures in Computer Science 6 (3), 251-259, 1996 | 117 | 1996 |
| Relating processes with respect to speed F Moller, C Tofts International Conference on Concurrency Theory, 424-438, 1991 | 116 | 1991 |
| Axioms for concurrency F Moller KB thesis scanning project 2015, 1989 | 112 | 1989 |
| The importance of the left merge operator in process algebras F Moller International Colloquium on Automata, Languages, and Programming, 752-764, 1990 | 105 | 1990 |
| Unique decomposition of processes R Milner, F Moller Theoretical Computer Science 107 (2), 357-363, 1993 | 98 | 1993 |
| The edinburgh concurrency workbench (version 6.1) F Moller Department of Computer Science, University of Edinburgh, 1992 | 92 | 1992 |
| Automated verification of signalling principles in railway interlocking systems K Kanso, F Moller, A Setzer Electronic Notes in Theoretical Computer Science 250 (2), 19-31, 2009 | 87 | 2009 |
| Checking regular properties of Petri nets P Jančar, F Moller International Conference on Concurrency Theory, 348-362, 1995 | 87 | 1995 |
| On the expressive power of CTL F Moller, L Rabinovich Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 75 | 1999 |
| Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes S Christensen, Y Hirshfeld, F Moller [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993 | 74 | 1993 |
| A university-based model for supporting computer science curriculum reform F Moller, T Crick Journal of Computers in Education 5 (4), 415-434, 2018 | 60 | 2018 |
| Counting on CTL*: on the expressive power of monadic path logic F Moller, A Rabinovich Information and Computation 184 (1), 147-159, 2003 | 57 | 2003 |
| Edinburgh Concurrency Workbench user manual (version 7.1) F Moller, P Stevens | 57 | 1999 |
| The nonexistence of finite axiomatisations for CCS congruences F Moller [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science …, 1990 | 56 | 1990 |
