Foundations of session types and behavioural contracts H Hüttel, I Lanese, VT Vasconcelos, L Caires, M Carbone, PM Deniélou, ... ACM Computing Surveys (CSUR) 49 (1), 1-36, 2016 | 182 | 2016 |

Bisimulation equivalence is decidable for all context-free processes S Christensen, H Huttel, C Stirling Information and Computation 121 (2), 143-148, 1995 | 127 | 1995 |

Bisimulation equivalence is decidable for all context-free processes S Christensen, H Hüttel, C Stirling International Conference on Concurrency Theory, 138-147, 1992 | 117 | 1992 |

Actions speak louder than words: Proving bisimilarity for context-free processes H Huttel, C Stirling Proceedings 1991 Sixth Annual IEEE Symposium on Logic in Computer Science …, 1991 | 116* | 1991 |

Undecidable equivalences for basic process algebra JF Groote, H Huttel Information and Computation 115 (2), 354-371, 1994 | 113 | 1994 |

The use of static constructs in a model process logic H Hüttel, KG Larsen International Symposium on Logical Foundations of Computer Science, 163-180, 1989 | 84 | 1989 |

Undecidable equivalences for basic parallel processes H Hüttel International Symposium on Theoretical Aspects of Computer Software, 454-464, 1994 | 77* | 1994 |

Deciding framed bisimilarity H Hüttel Electronic Notes in Theoretical Computer Science 68 (6), 1-18, 2003 | 63 | 2003 |

Silence is golden: Branching bisimilarity is decidable for context-free processes H Hüttel International Conference on Computer Aided Verification, 2-12, 1991 | 30 | 1991 |

Decidability, behavioural equivalences and infinite transition graphs H Hüttel University of Edinburgh. College of Science and Engineering. School of …, 1991 | 28 | 1991 |

Bisimulations for asynchronous mobile processes M Hansen, H Hüttel, J Kleist BRICS Report Series 3 (8), 1996 | 27 | 1996 |

Transitions and Trees: An Introduction to Structural Operational Semantics H Hüttel Cambridge University Press, 2010 | 25 | 2010 |

Towards automatic bisimilarity checking in the spi calculus AS Elkjær, M Höhle, H Hüttel, K Overgård Combinatorics, Computation & Logic 21 (3), 175-189, 1999 | 24 | 1999 |

If PBL is the answer, then what is the problem? H Hüttel, D Gnaur Journal of Problem Based Learning in Higher Education 5 (2), 2017 | 23 | 2017 |

Recursion versus replication in simple cryptographic protocols H Hüttel, J Srba International Conference on Current Trends in Theory and Practice of …, 2005 | 21 | 2005 |

Deciding framed bisimilarity H Huttel Proceedings of INFINITY 68, 2002 | 21 | 2002 |

Objects as mobile processes H Hüttel, J Kleist BRICS, Department of Computer Science, Univ., 1996 | 21 | 1996 |

Modal logics for cryptographic processes U Frendrup, H Hüttel, JN Jensen Electronic Notes in Theoretical Computer Science 68 (2), 124-141, 2002 | 20 | 2002 |

Decidability Issues for Infinite-State Processes--a Survey S Christensen, H Hüttel | 20 | 1996 |

Typed ψ-calculi H Hüttel International Conference on Concurrency Theory, 265-279, 2011 | 19 | 2011 |