Select Publications
Conference Papers
, 1987, 'Bounded nondeterminism and the approximation induction principle in process algebra', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 336 - 347, http://dx.doi.org/10.1007/BFb0039617
, 1987, 'Merge and termination in process algebra', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 153 - 172, http://dx.doi.org/10.1007/3-540-18625-5_49
, 1987, 'Petri net models for algebraic theories of concurrency: Extended abstract', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 224 - 242, http://dx.doi.org/10.1007/3-540-17945-3_13
, 'Configuration structures', in Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, IEEE, pp. 199 - 209, presented at
Conference Abstracts
, 2019, 'Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours', in Journal of Logical and Algebraic Methods in Programming, Vol. 102, pp. 64 - 102, http://dx.doi.org/10.1016/j.jlamp.2018.09.006
Reports
, 2013, A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV, NICTA, Sydney, 5513, http://nicta.com.au/
, 2010, Characterising Probabilistic Processes Logically, arXiv:1007.5188, http://arxiv.org/abs/1007.5188
Preprints
, 2025, Stronger Validity Criteria for Encoding Synchrony, http://dx.doi.org/10.48550/arxiv.2502.08307
, 2023, A Lean-Congruence Format for EP-Bisimilarity, http://dx.doi.org/10.48550/arxiv.2309.07933
, 2022, Abstract Processes in the Absence of Conflicts in General Place/Transition Systems, http://dx.doi.org/10.48550/arxiv.2207.04362
, 2021, Enabling Preserving Bisimulation Equivalence, http://dx.doi.org/10.48550/arxiv.2108.00142
, 2021, Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom, http://dx.doi.org/10.48550/arxiv.2104.14226
, 2021, Abstract Processes and Conflicts in Place/Transition Systems, http://dx.doi.org/10.48550/arxiv.2103.01490
, 2021, On Causal Semantics of Petri Nets, http://dx.doi.org/10.48550/arxiv.2103.00729
, 2020, Reactive Temporal Logic, http://dx.doi.org/10.48550/arxiv.2008.13357
, 2020, Feasibility of Cross-Chain Payment with Success Guarantees, http://dx.doi.org/10.48550/arxiv.2007.08152
, 2020, Formalising the Optimised Link State Routing Protocol, http://dx.doi.org/10.48550/arxiv.2004.13285
, 2019, Cross-Chain Payment Protocols with Success Guarantees, http://dx.doi.org/10.48550/arxiv.1912.04513
, 2019, On the Meaning of Transition System Specifications, http://dx.doi.org/10.48550/arxiv.1908.08635
, 2019, Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence, http://dx.doi.org/10.48550/arxiv.1908.06550
, 2019, A Process Algebra for Link Layer Protocols, http://dx.doi.org/10.48550/arxiv.1907.13329
, 2018, Progress, Justness and Fairness, http://dx.doi.org/10.48550/arxiv.1810.07414
, 2018, Rooted Divergence-Preserving Branching Bisimilarity is a Congruence, http://dx.doi.org/10.48550/arxiv.1801.01180
, 2017, Analysing Mutual Exclusion using Process Algebra with Signals, http://dx.doi.org/10.48550/arxiv.1709.00826
, 2017, Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack, http://dx.doi.org/10.48550/arxiv.1703.06569
, 2016, A Timed Process Algebra for Wireless Networks, http://dx.doi.org/10.48550/arxiv.1606.03663
, 2016, Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity, http://dx.doi.org/10.48550/arxiv.1604.07530
, 2015, A Rigorous Analysis of AODV and its Variants, http://dx.doi.org/10.48550/arxiv.1512.08873
, 2015, Modelling and Verifying the AODV Routing Protocol, http://dx.doi.org/10.48550/arxiv.1512.08867
, 2015, Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops, http://dx.doi.org/10.48550/arxiv.1512.08891
, 2015, A Process Algebra for Wireless Mesh Networks, http://dx.doi.org/10.48550/arxiv.1512.07319
, 2015, Automated Analysis of AODV using UPPAAL, http://dx.doi.org/10.48550/arxiv.1512.07352
, 2015, Modelling and Analysis of AODV in UPPAAL, http://dx.doi.org/10.48550/arxiv.1512.07312
, 2015, Proceedings Workshop on Models for Formal Analysis of Real Systems
, 2015, CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, http://dx.doi.org/10.48550/arxiv.1505.05964
, 2015, On the Axiomatizability of Impossible Futures, http://dx.doi.org/10.48550/arxiv.1505.04985
, 2015, Progress, Fairness and Justness in Process Algebra, http://dx.doi.org/10.48550/arxiv.1501.03268
, 2013, A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV, http://dx.doi.org/10.48550/arxiv.1312.7645
, 2013, On Characterising Distributability, http://dx.doi.org/10.48550/arxiv.1309.3883
, 2012, On Distributability of Petri Nets, http://dx.doi.org/10.48550/arxiv.1207.3597
, 2011, Real-Reward Testing for Probabilistic Processes (Extended Abstract), http://dx.doi.org/10.48550/arxiv.1107.1201
, 2011, Abstract Processes of Place/Transition Systems, http://dx.doi.org/10.48550/arxiv.1103.5916
, 2009, Computation Tree Logic with Deadlock Detection, http://dx.doi.org/10.48550/arxiv.0912.2109
, 2008, On Synchronous and Asynchronous Interaction in Distributed Systems, http://dx.doi.org/10.48550/arxiv.0901.0048
, 2008, Symmetric and Asymmetric Asynchronous Interaction, http://dx.doi.org/10.48550/arxiv.0901.0043
, 2008, Branching Bisimilarity with Explicit Divergence, http://dx.doi.org/10.48550/arxiv.0812.3068
, 2008, On Finite Bases for Weak Semantics: Failures versus Impossible Futures, http://dx.doi.org/10.48550/arxiv.0810.4904
, 2002, Precongruence Formats for Decorated Trace Semantics, http://dx.doi.org/10.48550/arxiv.cs/0204039