Robert J. Van Glabbeek
#145,958
Most Influential Person Now
Robert J. Van Glabbeek's AcademicInfluence.com Rankings
Robert J. Van Glabbeekmathematics Degrees
Mathematics
#6841
World Rank
#9399
Historical Rank
Measure Theory
#1650
World Rank
#2032
Historical Rank
Download Badge
Computer Science Mathematics
Robert J. Van Glabbeek's Degrees
- Bachelors Mathematics University of Amsterdam
Similar Degrees You Can Earn
Why Is Robert J. Van Glabbeek Influential?
(Suggest an Edit or Addition)Robert J. Van Glabbeek's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Branching time and abstraction in bisimulation semantics (1996) (838)
- The Linear Time - Branching Time Spectrum II (1993) (736)
- Reactive, generative, and stratified models of probabilistic processes (1990) (578)
- CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes (2001) (424)
- The Linear Time - Branching Time Spectrum I (2001) (376)
- Petri Net Models for Algebraic Theories of Concurrency (1987) (317)
- Handbook of Process Algebra (2001) (308)
- The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR (2007) (280)
- The Linear Time-Branching Time Spectrum (Extended Abstract) (1990) (279)
- Refinement of actions and equivalence notions for concurrent systems (2001) (275)
- Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) (1989) (241)
- The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves (1993) (226)
- Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) (1989) (192)
- Comparative Concurrency Semantics and Refinement of Actions (1996) (144)
- Proof nets for unit-free multiplicative-additive linear logic (extended abstract) (2003) (125)
- Refinement of Actions in Causality Based Models (1990) (123)
- The meaning of negative premises in transition system specifications II (1996) (122)
- Configuration structures (1995) (112)
- Characterising Testing Preorders for Finite Probabilistic Processes (2007) (111)
- On the expressiveness of higher dimensional automata (2006) (104)
- Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra (1987) (100)
- Configuration structures, event structures and Petri nets (2009) (96)
- Ntyft/Ntyxt Rules Reduce to Ntree Rules (1996) (87)
- Branching Bisimilarity with Explicit Divergence (2008) (79)
- The Refinement Theorem for ST-bisimulation Semantics (1990) (79)
- A Process Algebra for Wireless Mesh Networks (2012) (77)
- Precongruence formats for decorated trace semantics (2002) (72)
- A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours (1993) (71)
- Automated Analysis of AODV Using UPPAAL (2012) (71)
- Axiomatizing Prefix Iteration with Silent Steps (1995) (59)
- What is Branching time semantics and why to use it? (1994) (58)
- Testing Finitary Probabilistic Processes (2009) (58)
- A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV (2013) (57)
- Notes on the Methodology of CCS and CSP (1997) (51)
- Modelling and verifying the AODV routing protocol (2015) (49)
- Merge and Termination in Process Algebra (1987) (48)
- The Difference between Splitting in n and n+1 (1995) (48)
- Compositionality of Hennessy-Milner logic by structural operational semantics (2006) (45)
- Remarks on Testing Probabilistic Processes (2007) (45)
- Refinement in branching time semantics (1989) (45)
- Musings on Encodings and Expressiveness (2012) (43)
- On cool congruence formats for weak bisimulations (2005) (40)
- Equivalences and Refinement (1990) (39)
- Computation Tree Logic with Deadlock Detection (2009) (38)
- Correcting a Space-Efficient Simulation Algorithm (2008) (36)
- Sequence numbers do not guarantee loop freedom: AODV can yield routing loops (2013) (36)
- Event Structures for Resolvable Conflict (2004) (35)
- Interleaving semantics and action refinement with atomic choice (1992) (35)
- On Synchronous and Asynchronous Interaction in Distributed Systems (2008) (33)
- Full Abstraction in Structural Operational Semantics (Extended Abstract) (1993) (33)
- Scalar Outcomes Suffice for Finitary Probabilistic Testing (2007) (33)
- Another Look at Abstraction in Process Algebra (Extended Abstract) (1987) (31)
- The Individual and Collective Token Interpretations of Petri Nets (2005) (30)
- Computing Natural Language (1998) (28)
- A rigorous analysis of AODV and its variants (2012) (28)
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP (2015) (27)
- Five Determinisation Algorithms (2008) (26)
- On Distributability of Petri Nets (2012) (26)
- Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity (2012) (25)
- Axiomatising ST-Bisimulation Equivalence (1994) (24)
- Progress, Justness, and Fairness (2018) (24)
- Modular Specification of Process Algebras (1993) (24)
- Bundle Event Structures and CCSP (2003) (24)
- Erratum to "On the expressiveness of higher dimensional automata": [TCS 356 (2006) 265-290] (2006) (23)
- Analysing and Comparing Encodability Criteria (2015) (23)
- On Characterising Distributability (2013) (22)
- Full Abstraction in Structural Operational Semantics (1993) (21)
- Testing finitary probabilistic processes (extended abstract) (2009) (21)
- The Coarsest Precongruences Respecting Safety and Liveness Properties (2010) (20)
- Modular Specifications in Process Algebra with Curious Queues (1987) (20)
- On the Expressiveness of ACP (1995) (19)
- Progress, Fairness and Justness in Process Algebra (2015) (18)
- Analysing Mutual Exclusion using Process Algebra with Signals (2017) (18)
- Query Nets: Interacting Workflow Modules That Ensure Global Termination (2003) (17)
- On Causal Semantics of Petri Nets (2011) (17)
- A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol (2014) (17)
- On the Expressiveness of ACP (Extended Abstract) (1994) (17)
- Abstract processes of place/transition systems (2011) (16)
- CCS: It’s not fair! (2015) (16)
- Symmetric and Asymmetric Asynchronous Interaction (2008) (15)
- Characterising Probabilistic Processes Logically - (Extended Abstract) (2010) (15)
- Characterising Probabilistic Processes Logically (2010) (15)
- A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract) (2016) (15)
- Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow (2002) (15)
- Liveness, Fairness and Impossible Futures (2006) (14)
- A Characterisation of Weak Bisimulation Congruence (2005) (14)
- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics (2003) (13)
- Well-behaved flow event structures for parallel composition and action refinement (2004) (13)
- Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care (1989) (12)
- On Specifying Timeouts (2006) (12)
- Divide and Congruence III: Stability & Divergence (2017) (12)
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation (2005) (12)
- Ready to preorder: The case of weak process semantics (2008) (12)
- Divide and Congruence II: Delay and Weak Bisimilarity (2016) (11)
- On Cool Congruence Formats for Weak Bisimulations (Extended Abstract) (2005) (11)
- Modelling and Analysis of AODV in UPPAAL (2015) (11)
- Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom (2021) (11)
- CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (2015) (11)
- Lean and full congruence formats for recursion (2017) (10)
- Ensuring liveness properties of distributed systems: Open problems (2019) (10)
- Precongruence formats for decorated trace preorders (2000) (9)
- A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract) (2018) (8)
- Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours (2018) (8)
- Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (2016) (8)
- Ensuring Liveness Properties of Distributed Systems (A Research Agenda) (2017) (8)
- Mechanizing a Process Algebra for Network Protocols (2015) (8)
- Real-reward testing for probabilistic processes (2014) (8)
- Showing Invariance Compositionally for a Process Algebra for Network Protocols (2014) (7)
- On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus (2018) (7)
- Axiomatizing Flat Iteration (1997) (7)
- Petri Nets, Configuration Structures and Higher Dimensional Automata (1999) (7)
- Divide and Congruence Applied to eta-Bisimulation (2006) (6)
- Divide and Congruence Applied to η-Bisimulation (2006) (6)
- Feasibility of Cross-Chain Payment with Success Guarantees (2020) (6)
- Cross-Chain Payment Protocols with Success Guarantees (2019) (5)
- Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report) (2020) (5)
- Analysing and Comparing Encodability Criteria for Process Calculi (2015) (5)
- On infinite guarded recursive specifications in process algebra (2020) (5)
- On the Expressiveness of Higher Dimensional Automata: (Extended Abstract) (2005) (5)
- Scheduling Algebra (1998) (5)
- Labelled Transition Systems (2011) (5)
- A Theory of Encodings and Expressiveness (2018) (5)
- Special issue on structural operational semantics (2009) (5)
- On the Expressiveness of (2005) (5)
- 2018 Justness A Completeness Criterion for Capturing Liveness Properties (2018) (4)
- Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack (2017) (4)
- Real-Reward Testing for Probabilistic Processes (Extended Abstract) (2011) (4)
- Reactive Temporal Logic (2020) (4)
- MALL proof nets identify proofs modulo rule commutation (2016) (4)
- On the Axiomatizability of Impossible Futures (2015) (4)
- Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract) (2019) (4)
- Comparing the expressiveness of the π-calculus and CCS (2022) (3)
- On CSP and the Algebraic Theory of Effects (2010) (3)
- Reactive Bisimulation Semantics for a Process Algebra with Time-Outs (2020) (3)
- Modelling Mutual Exclusion in a Process Algebra with Time-outs (2021) (3)
- Rooted Divergence-Preserving Branching Bisimilarity is a Congruence (2018) (3)
- Precongruence Formats with Lookahead through Modal Decomposition (2017) (3)
- Reward Testing Equivalences for Processes (2019) (3)
- A Branching Time Model of CSP (2017) (3)
- A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract) (2019) (3)
- On causal semantics of petri nets (extended abstract) (2011) (3)
- Enabling Preserving Bisimulation Equivalence (2021) (2)
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (2008) (2)
- Shifting contexts and changing assertions (1998) (2)
- On the Meaning of Transition System Specifications (2019) (2)
- A Case Study on Evaluating Encodings Between Process Calculi ∗ (2018) (2)
- Analysing AWN-Specifications Using mCRL2 (Extended Abstract) (2018) (2)
- Special issue on “Combining Compositionality and Concurrency”: part 1 (2015) (2)
- Stronger Validity Criteria for Encoding Synchrony (2019) (2)
- An Algebraic Treatment of Recursion (2017) (1)
- The Linear Time-Bran hing Time Spe trum I The Semanti s of Con rete , Sequential Pro essesR (2010) (1)
- Is speed-independent mutual exclusion implementable? (2018) (1)
- Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk) (2018) (1)
- A Process Algebra for Link Layer Protocols (2019) (1)
- Formalising the Optimised Link State Routing Protocol (2020) (1)
- Coinductive Validity (2021) (1)
- Special issue on “Combining Compositionality and Concurrency”: part 2 (2015) (1)
- Modular Specifications in Process Algebra (2005) (1)
- Proceedings third workshop on models for formal analysis of real systems and sixth international workshop on verification and program transformation (2018) (1)
- Abstract Processes and Conflicts in Place/Transition Systems (2021) (1)
- Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation: Preface (2018) (0)
- 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands (2019) (0)
- CONCURRENCY THEORY : A HISTORICAL PERSPECTIVE ON COINDUCTION AND PROCESS CALCULI (2014) (0)
- Divide and congruence III (2017) (0)
- Just Testing (2022) (0)
- Test-of-Time Award Recipients (2020) (0)
- Labelled Transition Systems Bisimulation Equivalence (0)
- Structural Operational Semantics The main definitions (2010) (0)
- Domain-Aware Session Types (2019) (0)
- Event Stru tures for Resolvable Con i t ? (0)
- Branching bisimulation equivalence with explicit divergence (2008) (0)
- Inheritance and mining of WF-nets (2002) (0)
- Showing invarian e ompositionally for a pro essalgebra for network proto (2015) (0)
- Abstract Processes in the Absence of Conflicts in General Place/Transition Systems (2022) (0)
- 15 : 2 Divide and Congruence III : Stability (2017) (0)
- Characterising Probabilistic Processes Logically ( Extended (2010) (0)
- Domain-Aware Session Types 1 (2019) (0)
- A Completeness Criterion for Capturing Liveness Properties (2021) (0)
- Comparing Quality Criteria for Encodings ? (2014) (0)
- 0 Progress , Justness and Fairness (2019) (0)
- CONCUR Test-Of-Time Award 2021 (Invited Paper) (2021) (0)
- Structural Operational Semantics (2007) (0)
- Preface—Morgan: A suitable case for treatment (2012) (0)
- Proceedings Workshop on Models for Formal Analysis of Real Systems, MARS 2015, Suva, Fiji, November 23, 2015 (2015) (0)
- Preface: Proceedings of the workshop on models for formal analysis of real systems (2015) (0)
- Preface, proceedings of the 4th workshop on structural operational semantics (2007) (0)
- Proceedings 30th international conference on concurrency theory (CONCUR 2019) (2019) (0)
- Fair Must Testing for I/O Automata (2022) (0)
- CONCUR Test-Of-Time Award 2022 (2021) (0)
- Branching Bisimulation with Explicit Divergence (1989) (0)
- 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 (2018) (0)
- Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics Berlin, Germany, 4th September 2017 : Preface (2017) (0)
This paper list is powered by the following services:
