A calculus of mobile processes, I R Milner, J Parrow, D Walker Information and computation 100 (1), 1-40, 1992 | 5570 | 1992 |

The concurrency workbench: A semantics-based tool for the verification of concurrent systems R Cleaveland, J Parrow, B Steffen ACM Transactions on Programming Languages and Systems (TOPLAS) 15 (1), 36-72, 1993 | 803 | 1993 |

An introduction to the π-calculus J Parrow Handbook of process algebra, 479-543, 2001 | 335 | 2001 |

The fusion calculus: Expressiveness and symmetry in mobile processes J Parrow, B Victor Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998 | 303 | 1998 |

Modal logics for mobile processes R Milner, J Parrow, D Walker Theoretical Computer Science 114 (1), 149-171, 1993 | 291 | 1993 |

The concurrency workbench R Cleaveland, J Parrow, B Steffen Automatic Verification Methods for Finite State Systems: International …, 1990 | 290 | 1990 |

An algebraic verification of a mobile network F Orava, J Parrow Formal aspects of computing 4, 497-543, 1992 | 136 | 1992 |

Algebraic theories for name-passing calculi J Parrow, D Sangiorgi Information and Computation 120 (2), 174-197, 1995 | 129 | 1995 |

A Semantics Based Verification Tool for Finite State Systems. R Cleaveland, J Parrow, B Steffen PSTV, 287-302, 1989 | 121 | 1989 |

An improved failures equivalence for finite-state systems with a reduction algorithm A Valmari, M Tienari Proceedings of the IFIP WG6. 1 International Symposium on Protocol …, 1991 | 116 | 1991 |

Submodule construction as equation solving in CCS J Parrow Theoretical Computer Science 68 (2), 175-202, 1989 | 110 | 1989 |

Psi-calculi: a framework for mobile processes with nominal data and logic J Bengtson, M Johansson, J Parrow Logical Methods in Computer Science 7, 2011 | 100 | 2011 |

Deciding bisimulation equivalences for a class of non-finite-state programs B Jonsson, J Parrow Information and computation 107 (2), 272-302, 1993 | 94 | 1993 |

Automatized verification of ad hoc routing protocols O Wibling, J Parrow, A Pears Formal Techniques for Networked and Distributed Systems–FORTE 2004: 24th …, 2004 | 87 | 2004 |

Verifying a CSMA/CD-protocol with CCS J Parrow University of Edinburgh. Laboratory for Foundations of Computer Science, 1987 | 87 | 1987 |

Expressiveness of process algebras J Parrow Electronic Notes in Theoretical Computer Science 209, 173-186, 2008 | 86 | 2008 |

Multiway synchronization verified with coupled simulation J Parrow, P Sjödin International Conference on Concurrency Theory, 518-533, 1992 | 84 | 1992 |

The concurrency workbench: A semantics-based verification tool for finite state systems R Cleaveland, J Parrow, B Steffen ACM Transactions on Programming Languages and Systems 15 (1), 36-72, 1993 | 80 | 1993 |

Psi-calculi: Mobile processes, nominal data, and logic J Bengtson, M Johansson, J Parrow, B Victor 2009 24th Annual IEEE Symposium on Logic In Computer Science, 39-48, 2009 | 77 | 2009 |

Formalising the *π*-Calculus Using Nominal LogicJ Bengtson, J Parrow International Conference on Foundations of Software Science and …, 2007 | 75 | 2007 |