By Dr Rob van Glabbeek

Preprints

van Glabbeek R; Höfner P; Wang W, 2023, A Lean-Congruence Format for EP-Bisimilarity, http://dx.doi.org/10.48550/arxiv.2309.07933

van Glabbeek R; Goltz U; Schicke-Uffmann J-W, 2022, Abstract Processes in the Absence of Conflicts in General Place/Transition Systems, http://dx.doi.org/10.48550/arxiv.2207.04362

van Glabbeek R; Höfner P; Wang W, 2021, Enabling Preserving Bisimulation Equivalence, http://dx.doi.org/10.48550/arxiv.2108.00142

van Glabbeek R; Höfner P; Horne R, 2021, Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom, http://dx.doi.org/10.48550/arxiv.2104.14226

van Glabbeek R; Goltz U; Schicke-Uffmann J-W, 2021, Abstract Processes and Conflicts in Place/Transition Systems, http://dx.doi.org/10.48550/arxiv.2103.01490

van Glabbeek R; Goltz U; Schicke J-W, 2021, On Causal Semantics of Petri Nets, http://dx.doi.org/10.48550/arxiv.2103.00729

van Glabbeek R, 2020, Reactive Temporal Logic, http://dx.doi.org/10.48550/arxiv.2008.13357

van Glabbeek R; Gramoli V; Tholoniat P, 2020, Feasibility of Cross-Chain Payment with Success Guarantees, http://dx.doi.org/10.48550/arxiv.2007.08152

Barry R; van Glabbeek R; Höfner P, 2020, Formalising the Optimised Link State Routing Protocol, http://dx.doi.org/10.48550/arxiv.2004.13285

van Glabbeek R; Gramoli V; Tholoniat P, 2019, Cross-Chain Payment Protocols with Success Guarantees, http://dx.doi.org/10.48550/arxiv.1912.04513

van Glabbeek R, 2019, On the Meaning of Transition System Specifications, http://dx.doi.org/10.48550/arxiv.1908.08635

Fokkink W; van Glabbeek R; Luttik B, 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

van Glabbeek R; Höfner P; Markl M, 2019, A Process Algebra for Link Layer Protocols, http://dx.doi.org/10.48550/arxiv.1907.13329

van Glabbeek R; Höfner P, 2018, Progress, Justness and Fairness, http://dx.doi.org/10.48550/arxiv.1810.07414

van Glabbeek R; Luttik B; Spaninks L, 2018, Rooted Divergence-Preserving Branching Bisimilarity is a Congruence, http://dx.doi.org/10.48550/arxiv.1801.01180

Dyseryn V; van Glabbeek R; Höfner P, 2017, Analysing Mutual Exclusion using Process Algebra with Signals, http://dx.doi.org/10.48550/arxiv.1709.00826

van Glabbeek R; Höfner P, 2017, Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack, http://dx.doi.org/10.48550/arxiv.1703.06569

Bres E; van Glabbeek R; Höfner P, 2016, A Timed Process Algebra for Wireless Networks, http://dx.doi.org/10.48550/arxiv.1606.03663

Fokkink W; van Glabbeek R, 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

Höfner P; van Glabbeek R; Tan WL; Portmann M; McIver A; Fehnker A, 2015, A Rigorous Analysis of AODV and its Variants, http://dx.doi.org/10.48550/arxiv.1512.08873

van Glabbeek R; Höfner P; Portmann M; Tan WL, 2015, Modelling and Verifying the AODV Routing Protocol, http://dx.doi.org/10.48550/arxiv.1512.08867

van Glabbeek R; Höfner P; Tan WL; Portmann M, 2015, Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops, http://dx.doi.org/10.48550/arxiv.1512.08891

Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2015, A Process Algebra for Wireless Mesh Networks, http://dx.doi.org/10.48550/arxiv.1512.07319

Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2015, Automated Analysis of AODV using UPPAAL, http://dx.doi.org/10.48550/arxiv.1512.07352

Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2015, Modelling and Analysis of AODV in UPPAAL, http://dx.doi.org/10.48550/arxiv.1512.07312

van Glabbeek R; Groote JF; Höfner P, 2015, Proceedings Workshop on Models for Formal Analysis of Real Systems

van Glabbeek R; Höfner P, 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

Chen T; Fokkink W; van Glabbeek R, 2015, On the Axiomatizability of Impossible Futures, http://dx.doi.org/10.48550/arxiv.1505.04985

van Glabbeek R; Höfner P, 2015, Progress, Fairness and Justness in Process Algebra, http://dx.doi.org/10.48550/arxiv.1501.03268

Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2013, A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV, http://dx.doi.org/10.48550/arxiv.1312.7645

van Glabbeek RJ; Goltz U; Schicke-Uffmann J-W, 2013, On Characterising Distributability, http://dx.doi.org/10.48550/arxiv.1309.3883

van Glabbeek R; Goltz U; Schicke-Uffmann J-W, 2012, On Distributability of Petri Nets, http://dx.doi.org/10.48550/arxiv.1207.3597

Deng Y; van Glabbeek R; Hennessy M; Morgan C, 2011, Real-Reward Testing for Probabilistic Processes (Extended Abstract), http://dx.doi.org/10.48550/arxiv.1107.1201

van Glabbeek R; Goltz U; Schicke J-W, 2011, Abstract Processes of Place/Transition Systems, http://dx.doi.org/10.48550/arxiv.1103.5916

van Glabbeek R; Luttik B; Trcka N, 2009, Computation Tree Logic with Deadlock Detection, http://dx.doi.org/10.48550/arxiv.0912.2109

van Glabbeek R; Goltz U; Schicke J-W, 2008, On Synchronous and Asynchronous Interaction in Distributed Systems, http://dx.doi.org/10.48550/arxiv.0901.0048

van Glabbeek R; Goltz U; Schicke J-W, 2008, Symmetric and Asymmetric Asynchronous Interaction, http://dx.doi.org/10.48550/arxiv.0901.0043

van Glabbeek R; Luttik B; Trcka N, 2008, Branching Bisimilarity with Explicit Divergence, http://dx.doi.org/10.48550/arxiv.0812.3068

Chen T; Fokkink W; van Glabbeek R, 2008, On Finite Bases for Weak Semantics: Failures versus Impossible Futures, http://dx.doi.org/10.48550/arxiv.0810.4904

Bloom B; Fokkink WJ; van Glabbeek RJ, 2002, Precongruence Formats for Decorated Trace Semantics, http://dx.doi.org/10.48550/arxiv.cs/0204039

Back to profile page