Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRob J. van Glabbeek
Rob van Glabbeek
Person information
- affiliation: Data61, CSIRO, Sydney, Australia
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j52]Xueying Qin
, Liam O'Connor, Rob van Glabbeek, Peter Höfner, Ohad Kammar, Michel Steuwer:
Shoggoth: A Formal Foundation for Strategic Rewriting. Proc. ACM Program. Lang. 8(POPL): 61-89 (2024)- [j51]Rob van Glabbeek:
Comparing the Expressiveness of the π-calculus and CCS. ACM Trans. Comput. Log. 25(1): 1:1-1:58 (2024) - 2023
- [j50]Rob van Glabbeek:
Reactive bisimulation semantics for a process algebra with timeouts. Acta Informatica 60(1): 11-57 (2023) - [j49]Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat:
Cross-chain payment protocols with success guarantees. Distributed Comput. 36(2): 137-157 (2023) - [j48]Rob van Glabbeek:
Modelling mutual exclusion in a process algebra with time-outs. Inf. Comput. 294: 105079 (2023) - 2022
- [j47]Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
Abstract processes in the absence of conflicts in general place/transition systems. Inf. Comput. 289(Part): 104939 (2022) - 2021
- [j46]Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
Abstract processes and conflicts in place/transition systems. Inf. Comput. 281: 104706 (2021) - [j45]Rob van Glabbeek:
Failure Trace Semantics for a Process Algebra with Time-outs. Log. Methods Comput. Sci. 17(2) (2021) - 2020
- [j44]Rob van Glabbeek, Bas Luttik, Linda Spaninks:
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. Log. Methods Comput. Sci. 16(3) (2020) - 2019
- [j43]Rob van Glabbeek, Peter Höfner:
Progress, Justness, and Fairness. ACM Comput. Surv. 52(4): 69:1-69:38 (2019) - [j42]Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. Inf. Comput. 268 (2019) - [j41]Rob van Glabbeek:
Ensuring liveness properties of distributed systems: Open problems. J. Log. Algebraic Methods Program. 109 (2019) - [j40]Nick Fischer, Rob van Glabbeek:
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Log. Algebraic Methods Program. 102: 64-102 (2019) - 2018
- [j39]Rob J. van Glabbeek:
On the validity of encodings of the synchronous in the asynchronous π-calculus. Inf. Process. Lett. 137: 17-25 (2018) - 2017
- [j38]Wan J. Fokkink, Rob J. van Glabbeek:
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity. Inf. Comput. 257: 79-113 (2017) - 2016
- [j37]Rob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan:
Modelling and verifying the AODV routing protocol. Distributed Comput. 29(4): 279-315 (2016) - [j36]Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:
Mechanizing a Process Algebra for Network Protocols. J. Autom. Reason. 56(3): 309-341 (2016) - 2015
- [j35]Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog:
Special issue on "Combining Compositionality and Concurrency": part 1. Acta Informatica 52(1): 3-4 (2015) - [j34]Rob J. van Glabbeek, Peter Höfner:
CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. Acta Informatica 52(2-3): 175-205 (2015) - [j33]Rob J. van Glabbeek, Ursula Goltz, Ernst-Rüdiger Olderog:
Special issue on "Combining Compositionality and Concurrency": part 2. Acta Informatica 52(4-5): 303-304 (2015) - [j32]Kirstin Peters, Rob J. van Glabbeek:
Analysing and Comparing Encodability Criteria for Process Calculi. Arch. Formal Proofs 2015 (2015) - [j31]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On the Axiomatizability of Impossible Futures. Log. Methods Comput. Sci. 11(3) (2015) - 2014
- [j30]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-reward testing for probabilistic processes. Theor. Comput. Sci. 538: 16-36 (2014) - 2013
- [j29]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
On Characterising Distributability. Log. Methods Comput. Sci. 9(3) (2013) - 2012
- [j28]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity. Inf. Comput. 214: 59-85 (2012) - 2011
- [j27]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
Abstract processes of place/transition systems. Inf. Process. Lett. 111(13): 626-633 (2011) - [j26]Rob J. van Glabbeek:
On cool congruence formats for weak bisimulations. Theor. Comput. Sci. 412(28): 3283-3302 (2011) - 2009
- [j25]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Computation Tree Logic with Deadlock Detection. Log. Methods Comput. Sci. 5(4) (2009) - [j24]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Branching Bisimilarity with Explicit Divergence. Fundam. Informaticae 93(4): 371-392 (2009) - [j23]Rob J. van Glabbeek, Peter D. Mosses:
Special issue on structural operational semantics. Inf. Comput. 207(2): 83-84 (2009) - [j22]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41): 4111-4159 (2009) - 2008
- [j21]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
Ready to preorder: The case of weak process semantics. Inf. Process. Lett. 109(2): 104-111 (2008) - [j20]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Characterising Testing Preorders for Finite Probabilistic Processes. Log. Methods Comput. Sci. 4(4) (2008) - 2006
- [j19]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Compositionality of Hennessy-Milner logic by structural operational semantics. Theor. Comput. Sci. 354(3): 421-440 (2006) - [j18]Rob J. van Glabbeek:
On the expressiveness of higher dimensional automata. Theor. Comput. Sci. 356(3): 265-290 (2006) - [j17]Rob J. van Glabbeek:
Erratum to "On the expressiveness of higher dimensional automata": [TCS 356 (2006) 265-290]. Theor. Comput. Sci. 368(1-2): 168-194 (2006) - 2005
- [j16]Dominic J. D. Hughes, Rob J. van Glabbeek:
Proof nets for unit-free multiplicative-additive linear logic. ACM Trans. Comput. Log. 6(4): 784-842 (2005) - 2004
- [j15]Luca Aceto, Wan J. Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir:
Nested semantics over finite trees are equationally hard. Inf. Comput. 191(2): 203-232 (2004) - [j14]Rob J. van Glabbeek:
The meaning of negative premises in transition system specifications II. J. Log. Algebraic Methods Program. 60-61: 229-258 (2004) - [j13]Rob J. van Glabbeek, Ursula Goltz:
Well-behaved flow event structures for parallel composition and action refinement. Theor. Comput. Sci. 311(1-3): 463-478 (2004) - [j12]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1): 26-78 (2004) - 2001
- [j11]Rob J. van Glabbeek, Ursula Goltz:
Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4/5): 229-327 (2001) - 2000
- [j10]Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek:
Preface. Inf. Comput. 156(1-2): 1 (2000) - 1997
- [j9]Rob J. van Glabbeek, Frits W. Vaandrager:
The Difference between Splitting in n and n+1. Inf. Comput. 136(2): 109-142 (1997) - [j8]Rob J. van Glabbeek:
Notes on the Methodology of CCS and CSP. Theor. Comput. Sci. 177(2): 329-349 (1997) - 1996
- [j7]Wan J. Fokkink, Rob J. van Glabbeek:
Ntyft/Ntyxt Rules Reduce to Ntree Rules. Inf. Comput. 126(1): 1-10 (1996) - [j6]Luca Aceto, Rob J. van Glabbeek, Wan J. Fokkink, Anna Ingólfsdóttir:
Axiomatizing Prefix Iteration with Silent Steps. Inf. Comput. 127(1): 26-40 (1996) - [j5]Rob J. van Glabbeek, W. P. Weijland:
Branching Time and Abstraction in Bisimulation Semantics. J. ACM 43(3): 555-600 (1996) - 1995
- [j4]Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen:
Reactive, Generative and Stratified Models of Probabilistic Processes. Inf. Comput. 121(1): 59-80 (1995) - 1994
- [j3]Rob J. van Glabbeek:
What is Branching time semantics and why to use it? Bull. EATCS 53: 191-198 (1994) - 1993
- [j2]Rob J. van Glabbeek, Frits W. Vaandrager:
Modular Specification of Process Algebras. Theor. Comput. Sci. 113(2): 293-348 (1993) - 1989
- [j1]Rob J. van Glabbeek, Ursula Goltz:
Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care. Bull. EATCS 38: 154-163 (1989)
Conference and Workshop Papers
- 2023
- [c90]Rob van Glabbeek:
Just Testing. FoSSaCS 2023: 498-519 - [c89]Rob van Glabbeek, Jan Friso Groote, Erik P. de Vink:
A Cancellation Law for Probabilistic Processes. EXPRESS/SOS 2023: 42-58 - [c88]Rob van Glabbeek, Peter Höfner, Weiyou Wang:
A Lean-Congruence Format for EP-Bisimilarity. EXPRESS/SOS 2023: 59-75 - 2022
- [c87]Rob van Glabbeek:
Fair Must Testing for I/O Automata. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 559-574 - [c86]Rob van Glabbeek:
Comparing the expressiveness of the π-calculus and CCS. ESOP 2022: 548-574 - 2021
- [c85]Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida:
CONCUR Test-Of-Time Award 2021 (Invited Paper). CONCUR 2021: 1:1-1:3 - [c84]Rob van Glabbeek, Peter Höfner, Weiyou Wang:
Enabling Preserving Bisimulation Equivalence. CONCUR 2021: 33:1-33:20 - [c83]Rob van Glabbeek, Peter Höfner, Ross Horne:
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom. LICS 2021: 1-13 - 2020
- [c82]Rob van Glabbeek:
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs. CONCUR 2020: 6:1-6:23 - [c81]Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat:
Feasibility of Cross-Chain Payment with Success Guarantees. SPAA 2020: 579-581 - [c80]Ryan Barry, Rob van Glabbeek, Peter Höfner:
Formalising the Optimised Link State Routing Protocol. MARS@ETAPS 2020: 40-71 - [c79]Rob van Glabbeek:
Reactive Temporal Logic. EXPRESS/SOS 2020: 51-68 - 2019
- [c78]Rob van Glabbeek:
Reward Testing Equivalences for Processes. Models, Languages, and Tools for Concurrent and Distributed Programming 2019: 45-70 - [c77]Rob J. van Glabbeek, Jan Friso Groote, Erik P. de Vink:
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract). The Art of Modelling Computational Systems 2019: 139-162 - [c76]Rob van Glabbeek, Ursula Goltz, Christopher Lippert, Stephan Mennicke:
Stronger Validity Criteria for Encoding Synchrony. The Art of Modelling Computational Systems 2019: 182-205 - [c75]Rob van Glabbeek, Peter Höfner, Michael Markl:
A Process Algebra for Link Layer Protocols. ESOP 2019: 668-693 - [c74]Rob van Glabbeek:
Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract). FoSSaCS 2019: 505-522 - [c73]Rob van Glabbeek:
On the Meaning of Transition System Specifications. EXPRESS/SOS 2019: 69-85 - 2018
- [c72]Rob van Glabbeek:
Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk). CONCUR 2018: 3:1-3:1 - [c71]Rob van Glabbeek:
A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract). FoSSaCS 2018: 183-202 - [c70]Rob J. van Glabbeek, Peter Höfner, Djurre van der Wal:
Analysing AWN-Specifications Using mCRL2 (Extended Abstract). IFM 2018: 398-418 - 2017
- [c69]Rob J. van Glabbeek:
A Branching Time Model of CSP. Concurrency, Security, and Puzzles 2017: 272-293 - [c68]Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik:
Divide and Congruence III: Stability & Divergence. CONCUR 2017: 15:1-15:16 - [c67]Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats with Lookahead through Modal Decomposition. CSL 2017: 25:1-25:20 - [c66]Rob J. van Glabbeek:
Lean and full congruence formats for recursion. LICS 2017: 1-11 - [c65]Rob J. van Glabbeek, Peter Höfner:
Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack. MARS@ETAPS 2017: 14-52 - [c64]Victor Dyseryn, Rob J. van Glabbeek, Peter Höfner:
Analysing Mutual Exclusion using Process Algebra with Signals. EXPRESS/SOS 2017: 18-34 - 2016
- [c63]Emile Bres, Rob J. van Glabbeek, Peter Höfner:
A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract). ESOP 2016: 95-122 - [c62]Wan J. Fokkink, Rob J. van Glabbeek:
Divide and Congruence II: Delay and Weak Bisimilarity. LICS 2016: 778-787 - 2015
- [c61]Rob J. van Glabbeek:
Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP. Correct System Design 2015: 99-130 - [c60]Kirstin Peters, Rob J. van Glabbeek:
Analysing and Comparing Encodability Criteria. EXPRESS/SOS 2015: 46-60 - 2014
- [c59]Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol. ATVA 2014: 47-63 - [c58]Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:
Showing Invariance Compositionally for a Process Algebra for Network Protocols. ITP 2014: 144-159 - 2013
- [c57]Rob J. van Glabbeek, Peter Höfner, Wee Lum Tan, Marius Portmann:
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops. MSWiM 2013: 91-100 - 2012
- [c56]Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan:
A Process Algebra for Wireless Mesh Networks. ESOP 2012: 295-315 - [c55]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
On Distributability of Petri Nets - (Extended Abstract). FoSSaCS 2012: 331-345 - [c54]Peter Höfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker:
A rigorous analysis of AODV and its variants. MSWiM 2012: 203-212 - [c53]Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan:
Automated Analysis of AODV Using UPPAAL. TACAS 2012: 173-187 - [c52]Rob J. van Glabbeek:
Musings on Encodings and Expressiveness. EXPRESS/SOS 2012: 81-98 - 2011
- [c51]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
On Causal Semantics of Petri Nets. CONCUR 2011: 43-59 - [c50]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-Reward Testing for Probabilistic Processes (Extended Abstract). QAPL 2011: 61-73 - 2010
- [c49]Rob J. van Glabbeek:
The Coarsest Precongruences Respecting Safety and Liveness Properties. IFIP TCS 2010: 32-52 - [c48]Yuxin Deng, Rob J. van Glabbeek:
Characterising Probabilistic Processes Logically - (Extended Abstract). LPAR (Yogyakarta) 2010: 278-293 - 2009
- [c47]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Testing Finitary Probabilistic Processes. CONCUR 2009: 274-288 - [c46]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. SOFSEM 2009: 167-180 - 2008
- [c45]Rob J. van Glabbeek, Bas Ploeger:
Correcting a Space-Efficient Simulation Algorithm. CAV 2008: 517-529 - [c44]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
On Synchronous and Asynchronous Interaction in Distributed Systems. MFCS 2008: 16-35 - [c43]Rob J. van Glabbeek, Bas Ploeger:
Five Determinisation Algorithms. CIAA 2008: 161-170 - [c42]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
Symmetric and Asymmetric Asynchronous Interaction. ICE@ICALP 2008: 77-95 - 2007
- [c41]Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang:
Scalar Outcomes Suffice for Finitary Probabilistic Testing. ESOP 2007: 363-378 - [c40]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325 - [c39]Rob J. van Glabbeek, Matthew Hennessy:
Preface. SOS@LICS/ICALP 2007: 1-3 - [c38]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Remarks on Testing Probabilistic Processes. Computation, Meaning, and Logic 2007: 359-397 - 2006
- [c37]Rob J. van Glabbeek, Marc Voorhoeve:
Liveness, Fairness and Impossible Futures. CONCUR 2006: 126-141 - [c36]Rob J. van Glabbeek, Peter D. Mosses:
Preface. SOS@CONCUR 2006: 1-2 - 2005
- [c35]Rob J. van Glabbeek:
A Characterisation of Weak Bisimulation Congruence. Processes, Terms and Cycles 2005: 26-39 - [c34]Rob J. van Glabbeek:
The Individual and Collective Token Interpretations of Petri Nets. CONCUR 2005: 323-337 - [c33]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. FMCO 2005: 195-218 - [c32]Rob J. van Glabbeek:
On Cool Congruence Formats for Weak Bisimulations. ICTAC 2005: 318-333 - [c31]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Divide and Congruence Applied to eta-Bisimulation. SOS@ICALP 2005: 97-113 - [c30]Rob J. van Glabbeek:
On Specifying Timeouts. APC 25 2005: 173-175 - 2004
- [c29]Rob J. van Glabbeek, Gordon D. Plotkin:
Event Structures for Resolvable Conflict. MFCS 2004: 550-561 - [c28]Rob J. van Glabbeek:
On the Expressiveness of Higher Dimensional Automata: (Extended Abstract). EXPRESS 2004: 5-34 - 2003
- [c27]Rob J. van Glabbeek, David G. Stork:
Query Nets: Interacting Workflow Modules That Ensure Global Termination. Business Process Management 2003: 184-199 - [c26]Rob J. van Glabbeek, Frits W. Vaandrager:
Bundle Event Structures and CCSP. CONCUR 2003: 57-71 - [c25]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. FCT 2003: 412-422 - [c24]Dominic J. D. Hughes, Rob J. van Glabbeek:
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract). LICS 2003: 1-10 - 2002
- [c23]David G. Stork, Rob J. van Glabbeek:
Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow. ICATPN 2002: 394-413 - 2000
- [c22]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Preorders. LICS 2000: 107-118 - 1999
- [c21]Rob J. van Glabbeek:
Petri Nets, Configuration Structures and Higher Dimensional Automata. CONCUR 1999: 21-27 - 1998
- [c20]Rob J. van Glabbeek, Peter Rittgen:
Scheduling Algebra. AMAST 1998: 278-292 - 1997
- [c19]Rob J. van Glabbeek:
Axiomatizing Flat Iteration. CONCUR 1997: 228-242 - 1996
- [c18]Rob J. van Glabbeek:
The Meaning of Negative Premises in Transition System Specifications II. ICALP 1996: 502-513 - 1995
- [c17]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration Structures. LICS 1995: 199-209 - 1994
- [c16]Nadia Busi, Rob J. van Glabbeek, Roberto Gorrieri:
Axiomatising ST-Bisimulation Equivalence. PROCOMET 1994: 169-188 - 1993
- [c15]Rob J. van Glabbeek:
Full Abstraction in Structural Operational Semantics (Extended Abstract). AMAST 1993: 75-82 - [c14]Rob J. van Glabbeek:
The Linear Time - Branching Time Spectrum II. CONCUR 1993: 66-81 - [c13]Rob J. van Glabbeek:
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours. MFCS 1993: 473-484 - 1990
- [c12]Rob J. van Glabbeek:
The Linear Time-Branching Time Spectrum (Extended Abstract). CONCUR 1990: 278-297 - [c11]Rob J. van Glabbeek:
The Refinement Theorem for ST-bisimulation Semantics. Programming Concepts and Methods 1990: 27-52 - [c10]Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts:
Reactive, Generative, and Stratified Models of Probabilistic Processes. LICS 1990: 130-141 - [c9]Rob J. van Glabbeek, Ursula Goltz:
Equivalences and Refinement. Semantics of Systems of Concurrent Processes 1990: 309-333 - 1989
- [c8]Rob J. van Glabbeek, W. P. Weijland:
Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract). IFIP Congress 1989: 613-618 - [c7]Rob J. van Glabbeek, Ursula Goltz:
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract). MFCS 1989: 237-248 - [c6]Rob J. van Glabbeek, Ursula Goltz:
Refinement of Actions in Causality Based Models. REX Workshop 1989: 267-300 - 1987
- [c5]Rob J. van Glabbeek, Frits W. Vaandrager:
Modular Specifications in Process Algebra with Curious Queues. Algebraic Methods 1987: 465-506 - [c4]Jos C. M. Baeten, Rob J. van Glabbeek:
Merge and Termination in Process Algebra. FSTTCS 1987: 153-172 - [c3]Jos C. M. Baeten, Rob J. van Glabbeek:
Another Look at Abstraction in Process Algebra (Extended Abstract). ICALP 1987: 84-94 - [c2]Rob J. van Glabbeek, Frits W. Vaandrager:
Petri Net Models for Algebraic Theories of Concurrency. PARLE (2) 1987: 224-242 - [c1]Rob J. van Glabbeek:
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. STACS 1987: 336-347
Parts in Books or Collections
- 2010
- [p4]Rob J. van Glabbeek, Gordon D. Plotkin:
On CSP and the Algebraic Theory of Effects. Reflections on the Work of C. A. R. Hoare 2010: 333-369 - 2001
- [p3]Rob J. van Glabbeek:
The Linear Time - Branching Time Spectrum I. Handbook of Process Algebra 2001: 3-99 - [p2]Rob J. van Glabbeek:
What is Branching Time Semantics and Why to Use it? Current Trends in Theoretical Computer Science 2001: 469-479 - 1992
- [p1]Ingo Czaja, Rob J. van Glabbeek, Ursula Goltz:
Interleaving semantics and action refinement with atomic choice. Advances in Petri Nets: The DEMON Project 1992: 89-107
Editorship
- 2019
- [e5]Wan J. Fokkink, Rob van Glabbeek:
30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. LIPIcs 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-121-4 [contents] - 2018
- [e4]John P. Gallagher, Rob van Glabbeek, Wendelin Serwe:
Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation, MARS/VPT@ETAPS 2018, Thessaloniki, Greece, 20th April 2018. EPTCS 268, 2018 [contents] - 2015
- [e3]Rob J. van Glabbeek, Jan Friso Groote, Peter Höfner:
Proceedings Workshop on Models for Formal Analysis of Real Systems, MARS 2015, Suva, Fiji, November 23, 2015. EPTCS 196, 2015 [contents] - 2007
- [e2]Rob van Glabbeek, Peter D. Mosses:
Proceedings of the Third Workshop on Structural Operational Semantics, SOS 2006, Bonn, Germany, August 26, 2006. Electronic Notes in Theoretical Computer Science 175(1), Elsevier 2007 [contents] - [e1]Rob van Glabbeek, Matthew Hennessy:
Proceedings of the Fourth Workshop on Structural Operational Semantics, SOS@LICS/ICALP 2007, Wroclaw, Poland, July 9, 2007. Electronic Notes in Theoretical Computer Science 192(1), Elsevier 2007 [contents]
Reference Works
- 2011
- [r1]Rob J. van Glabbeek:
Bisimulation. Encyclopedia of Parallel Computing 2011: 136-139
Informal and Other Publications
- 2023
- [i63]Rob van Glabbeek, Peter Höfner, Weiyou Wang:
A Lean-Congruence Format for EP-Bisimilarity. CoRR abs/2308.16350 (2023) - 2022
- [i62]Rob van Glabbeek:
Comparing the expressiveness of the π-calculus and CCS. CoRR abs/2203.11519 (2022) - [i61]Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
Abstract Processes in the Absence of Conflicts in General Place/Transition Systems. CoRR abs/2207.04362 (2022) - [i60]Rob van Glabbeek:
Just Testing. CoRR abs/2212.08829 (2022) - [i59]Rob van Glabbeek:
Fair Must Testing for I/O Automata. CoRR abs/2212.11248 (2022) - 2021
- [i58]Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
On Causal Semantics of Petri Nets. CoRR abs/2103.00729 (2021) - [i57]Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
Abstract Processes and Conflicts in Place/Transition Systems. CoRR abs/2103.01490 (2021) - [i56]Rob van Glabbeek:
Coinductive Validity. CoRR abs/2104.13021 (2021) - [i55]Rob van Glabbeek, Peter Höfner, Ross Horne:
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom. CoRR abs/2104.14226 (2021) - [i54]Rob van Glabbeek:
Modelling Mutual Exclusion in a Process Algebra with Time-outs. CoRR abs/2106.12785 (2021) - [i53]Rob van Glabbeek, Peter Höfner, Weiyou Wang:
Enabling Preserving Bisimulation Equivalence. CoRR abs/2108.00142 (2021) - 2020
- [i52]Rob van Glabbeek:
Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report). CoRR abs/2002.10814 (2020) - [i51]Rob J. van Glabbeek, Cornelis A. Middelburg:
On infinite guarded recursive specifications in process algebra. CoRR abs/2005.00746 (2020) - [i50]Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat:
Feasibility of Cross-Chain Payment with Success Guarantees. CoRR abs/2007.08152 (2020) - [i49]Rob van Glabbeek:
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs. CoRR abs/2008.11499 (2020) - 2019
- [i48]Rob van Glabbeek, Peter Höfner, Michael Markl:
A Process Algebra for Link Layer Protocols. CoRR abs/1907.13329 (2019) - [i47]Rob van Glabbeek:
Reward Testing Equivalences for Processes. CoRR abs/1907.13348 (2019) - [i46]Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence. CoRR abs/1908.06550 (2019) - [i45]Rob van Glabbeek:
Justness: A Completeness Criterion for Capturing Liveness Properties. CoRR abs/1909.00286 (2019) - [i44]Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat:
Cross-Chain Payment Protocols with Success Guarantees. CoRR abs/1912.04513 (2019) - [i43]Rob van Glabbeek:
Ensuring Liveness Properties of Distributed Systems: Open Problems. CoRR abs/1912.05616 (2019) - 2018
- [i42]Rob J. van Glabbeek, Bas Luttik, Linda Spaninks:
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. CoRR abs/1801.01180 (2018) - [i41]Rob van Glabbeek:
On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus. CoRR abs/1802.09182 (2018) - [i40]Rob van Glabbeek:
A Theory of Encodings and Expressiveness. CoRR abs/1805.10415 (2018) - [i39]Rob van Glabbeek, Peter Höfner:
Progress, Justness and Fairness. CoRR abs/1810.07414 (2018) - [i38]Nick Fischer, Rob van Glabbeek:
Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours. CoRR abs/1810.07488 (2018) - 2017
- [i37]Rob J. van Glabbeek:
An Algebraic Treatment of Recursion. CoRR abs/1702.07838 (2017) - [i36]Rob J. van Glabbeek:
A Branching Time Model of CSP. CoRR abs/1702.07844 (2017) - [i35]Rob J. van Glabbeek:
Lean and Full Congruence Formats for Recursion. CoRR abs/1704.03160 (2017) - [i34]Rob J. van Glabbeek:
Ensuring Liveness Properties of Distributed Systems (A Research Agenda). CoRR abs/1711.04240 (2017) - 2016
- [i33]Wan J. Fokkink, Rob J. van Glabbeek:
Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity. CoRR abs/1604.07530 (2016) - [i32]Emile Bres, Rob J. van Glabbeek, Peter Höfner:
A Timed Process Algebra for Wireless Networks. CoRR abs/1606.03663 (2016) - [i31]Rob J. van Glabbeek, Dominic J. D. Hughes:
MALL proof nets identify proofs modulo rule commutation. CoRR abs/1609.04693 (2016) - 2015
- [i30]Rob J. van Glabbeek, Peter Höfner:
Progress, Fairness and Justness in Process Algebra. CoRR abs/1501.03268 (2015) - [i29]Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:
A mechanized proof of loop freedom of the (untimed) AODV routing protocol. CoRR abs/1505.05646 (2015) - [i28]Rob J. van Glabbeek, Peter Höfner:
CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. CoRR abs/1505.05964 (2015) - [i27]Rob J. van Glabbeek:
Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP. CoRR abs/1509.05842 (2015) - [i26]Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:
Mechanizing a Process Algebra for Network Protocols. CoRR abs/1512.07304 (2015) - [i25]Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan:
Modelling and Analysis of AODV in UPPAAL. CoRR abs/1512.07312 (2015) - [i24]Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan:
A Process Algebra for Wireless Mesh Networks. CoRR abs/1512.07319 (2015) - [i23]Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan:
Automated Analysis of AODV using UPPAAL. CoRR abs/1512.07352 (2015) - [i22]Rob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan:
Modelling and Verifying the AODV Routing Protocol. CoRR abs/1512.08867 (2015) - [i21]Peter Höfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker:
A Rigorous Analysis of AODV and its Variants. CoRR abs/1512.08873 (2015) - [i20]Rob J. van Glabbeek, Peter Höfner, Wee Lum Tan, Marius Portmann:
Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops. CoRR abs/1512.08891 (2015) - 2014
- [i19]Timothy Bourke, Rob J. van Glabbeek, Peter Höfner:
Showing invariance compositionally for a process algebra for network protocols. CoRR abs/1407.3519 (2014) - 2013
- [i18]Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan:
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. CoRR abs/1312.7645 (2013) - 2012
- [i17]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
On Distributability of Petri Nets. CoRR abs/1207.3597 (2012) - 2011
- [i16]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
Abstract Processes of Place/Transition Systems. CoRR abs/1103.5916 (2011) - 2010
- [i15]Yuxin Deng, Rob J. van Glabbeek:
Characterising Probabilistic Processes Logically. CoRR abs/1007.5188 (2010) - [i14]Rob J. van Glabbeek, Gordon D. Plotkin:
On CSP and the Algebraic Theory of Effects. CoRR abs/1007.5488 (2010) - [i13]Rob J. van Glabbeek:
The Coarsest Precongruences Respecting Safety and Liveness Properties. CoRR abs/1007.5491 (2010) - 2009
- [i12]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
Symmetric and Asymmetric Asynchronous Interaction. CoRR abs/0901.0043 (2009) - [i11]Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
On Synchronous and Asynchronous Interaction in Distributed Systems. CoRR abs/0901.0048 (2009) - [i10]Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration Structures, Event Structures and Petri Nets. CoRR abs/0912.4023 (2009) - 2008
- [i9]Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan:
Characterising Testing Preorders for Finite Probabilistic Processes. CoRR abs/0810.3708 (2008) - [i8]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures versus Impossible Futures. CoRR abs/0810.4904 (2008) - [i7]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Branching Bisimilarity with Explicit Divergence. CoRR abs/0812.3068 (2008) - 2002
- [i6]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Semantics. CoRR cs.LO/0204039 (2002) - 1998
- [i5]Rob J. van Glabbeek:
Axiomatizing Flat Iteration. CoRR cs.LO/9810008 (1998) - 1990
- [i4]Rob van Glabbeek, Ursula Goltz:
Equivalences and refinement. Forschungsberichte, TU Munich TUM I 9024: 1-25 (1990) - [i3]Rob van Glabbeek, Ursula Goltz:
A deadlock-sensitive congruence for action refinement. Forschungsberichte, TU Munich TUM I 9044: 1-31 (1990) - [i2]Rob van Glabbeek, Frits W. Vaandrager:
Modular specification of process algebras. Forschungsberichte, TU Munich TUM I 9051: 1-67 (1990) - [i1]Rob van Glabbeek, Peter Weijland:
Branching time and abstraction in bisimulation semantics. Forschungsberichte, TU Munich TUM I 9052: 1-52 (1990)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-01 23:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
