| Comparing the expressiveness of the pi-calculus and CCS | 0 | 0.34 | 2021 |
| Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom | 0 | 0.34 | 2021 |
| Abstract processes and conflicts in place/transition systems | 0 | 0.34 | 2021 |
| CONCUR Test-Of-Time Award 2021 (Invited Paper). | 0 | 0.34 | 2021 |
| Enabling Preserving Bisimulation Equivalence. | 0 | 0.34 | 2021 |
| Formalising the Optimised Link State Routing Protocol. | 0 | 0.34 | 2020 |
| Reactive Bisimulation Semantics for a Process Algebra with Time-Outs | 0 | 0.34 | 2020 |
| Feasibility of Cross-Chain Payment with Success Guarantees | 0 | 0.34 | 2020 |
| Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract). | 0 | 0.34 | 2019 |
| Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. | 0 | 0.34 | 2019 |
| A Process Algebra for Link Layer Protocols. | 0 | 0.34 | 2019 |
| Reward Testing Equivalences for Processes. | 0 | 0.34 | 2019 |
| Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours. | 0 | 0.34 | 2019 |
| Ensuring liveness properties of distributed systems: Open problems. | 0 | 0.34 | 2019 |
| A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract). | 0 | 0.34 | 2018 |
| Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation. | 0 | 0.34 | 2018 |
| Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. | 0 | 0.34 | 2018 |
| A Theory of Encodings and Expressiveness. | 0 | 0.34 | 2018 |
| Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk). | 0 | 0.34 | 2018 |
| Progress, Justness and Fairness. | 0 | 0.34 | 2018 |
| Analysing AWN-Specifications Using mCRL2 (Extended Abstract). | 0 | 0.34 | 2018 |
| Analysing Mutual Exclusion Using Process Algebra With Signals | 0 | 0.34 | 2017 |
| Divide and Congruence III: Stability & Divergence. | 0 | 0.34 | 2017 |
| A Branching Time Model of CSP. | 1 | 0.37 | 2017 |
| Ensuring Liveness Properties of Distributed Systems (A Research Agenda). | 0 | 0.34 | 2017 |
| Split, Send, Reassemble: A Formal Specification Of A Can Bus Protocol Stack | 0 | 0.34 | 2017 |
| Precongruence Formats with Lookahead through Modal Decomposition. | 0 | 0.34 | 2017 |
| Divide and Congruence II: Delay and Weak Bisimilarity. | 3 | 0.39 | 2016 |
| Mechanizing a Process Algebra for Network Protocols. | 2 | 0.37 | 2016 |
| MALL proof nets identify proofs modulo rule commutation. | 0 | 0.34 | 2016 |
| A Timed Process Algebra for Wireless Networks with an Application in Routing | 1 | 0.35 | 2016 |
| Modelling and Verifying the AODV Routing Protocol | 15 | 0.56 | 2015 |
| Analysing And Comparing Encodability Criteria | 4 | 0.44 | 2015 |
| Analysing and Comparing Encodability Criteria for Process Calculi. | 0 | 0.34 | 2015 |
| Modelling and Analysis of AODV in UPPAAL | 5 | 0.47 | 2015 |
| On the Axiomatizability of Impossible Futures | 0 | 0.34 | 2015 |
| Showing Invariance Compositionally for a Process Algebra for Network Protocols. | 5 | 0.58 | 2014 |
| Real-reward testing for probabilistic processes. | 1 | 0.35 | 2014 |
| A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol. | 4 | 0.42 | 2014 |
| A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. | 21 | 1.01 | 2013 |
| On Characterising Distributability. | 1 | 0.37 | 2013 |
| Sequence numbers do not guarantee loop freedom: AODV can yield routing loops | 17 | 0.77 | 2013 |
| On distributability of petri nets | 6 | 0.47 | 2012 |
| Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity | 9 | 0.49 | 2012 |
| Automated analysis of AODV using UPPAAL | 35 | 1.14 | 2012 |
| A process algebra for wireless mesh networks | 31 | 1.10 | 2012 |
| On cool congruence formats for weak bisimulations | 14 | 0.63 | 2011 |
| Real-Reward Testing For Probabilistic Processes | 2 | 0.35 | 2011 |
| The Coarsest Precongruences Respecting Safety and Liveness Properties | 6 | 0.49 | 2010 |
| Characterising probabilistic processes logically | 7 | 0.46 | 2010 |
