The pi-calculus: a Theory of Mobile Processes D Sangiorgi, D Walker Cambridge university press, 2003 | 2001 | 2003 |

Expressing mobility in process algebras: first-order and higher-order paradigms D Sangiorgi The University of Edinburgh, 1993 | 725 | 1993 |

Barbed bisimulation R Milner, D Sangiorgi International Colloquium on Automata, Languages, and Programming, 685-695, 1992 | 611 | 1992 |

Typing and subtyping for mobile processes B Pierce, D Sangiorgi Mathematical Structures in Computer Science 6 (5), 409-453, 1996 | 610 | 1996 |

A theory of bisimulation for the π-calculus D Sangiorgi Acta informatica 33 (1), 69-97, 1996 | 428 | 1996 |

On bisimulations for the asynchronous π-calculus RM Amadio, I Castellani, D Sangiorgi Theoretical Computer Science 195 (2), 291-324, 1998 | 397 | 1998 |

An introduction to bisimulation and coinduction D Sangiorgi Cambridge University Press, 2011 | 331 | 2011 |

Controlling interference in ambients F Levi, D Sangiorgi Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of …, 2000 | 317 | 2000 |

On the origins of bisimulation and coinduction D Sangiorgi ACM Transactions on Programming Languages and Systems (TOPLAS) 31 (4), 1-41, 2009 | 254 | 2009 |

The problem of “Weak Bisimulation up to” D Sangiorgi, R Milner International conference on concurrency theory, 32-46, 1992 | 240* | 1992 |

On the bisimulation proof method D Sangiorgi Mathematical Structures in Computer Science 8 (5), 447-479, 1998 | 222 | 1998 |

π-calculus, internal mobility, and agent-passing calculi D Sangiorgi Theoretical Computer Science 167 (1-2), 235-274, 1996 | 215 | 1996 |

*SCC*: A Service Centered CalculusM Boreale, R Bruni, L Caires, R De Nicola, I Lanese, M Loreti, F Martins, ... International Workshop on Web Services and Formal Methods, 38-57, 2006 | 204 | 2006 |

Bisimulation for higher-order process calculi D Sangiorgi Information and Computation 131 (2), 141-178, 1996 | 196 | 1996 |

The lazy lambda calculus in a concurrency scenario D Sangiorgi Information and computation 111 (1), 120-153, 1994 | 176 | 1994 |

A fully abstract model for the π-calculus MP Fiore, E Moggi, D Sangiorgi Information and Computation 179 (1), 76-117, 2002 | 163 | 2002 |

Behavioral equivalence in the polymorphic pi-calculus BC Pierce, D Sangiorgi Journal of the ACM (JACM) 47 (3), 531-584, 2000 | 161 | 2000 |

From π-calculus to Higher-Order π-calculus—and back D Sangiorgi Colloquium on Trees in Algebra and Programming, 151-166, 1993 | 157 | 1993 |

Mobile safe ambients F Levi, D Sangiorgi ACM Transactions on Programming Languages and Systems (TOPLAS) 25 (1), 1-69, 2003 | 131 | 2003 |

On asynchrony in name-passing calculi M Merro, D Sangiorgi International Colloquium on Automata, Languages, and Programming, 856-867, 1998 | 131 | 1998 |