Rob J. van Glabbeek
About
In The Last Decade
Rob J. van Glabbeek
31 papers receiving 856 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 749
- Artificial Intelligence 602
- Computer Networks and Communications 172
- Software 136
- Management Information Systems 135
Countries citing papers authored by Rob J. van Glabbeek
This map shows the geographic impact of Rob J. van Glabbeek's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rob J. van Glabbeek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rob J. van Glabbeek more than expected).
Fields of papers citing papers by Rob J. van Glabbeek
This network shows the impact of papers produced by Rob J. van Glabbeek. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rob J. van Glabbeek. The network helps show where Rob J. van Glabbeek may publish in the future.
Co-authorship network of co-authors of Rob J. van Glabbeek
This figure shows the co-authorship network connecting the top 25 collaborators of Rob J. van Glabbeek. A scholar is included among the top collaborators of Rob J. van Glabbeek based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rob J. van Glabbeek. Rob J. van Glabbeek is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Analysing and Comparing Encodability Criteria for Process Calculi. | 1 |
| 2 | 9 | |
| 3 | 16 | |
| 4 | 39 | |
| 5 | 10 | |
| 6 | Correcting a space-efficient simulation algorithm | 10 |
| 7 | Five determinisation algorithms | 7 |
| 8 | 35 | |
| 9 | 35 | |
| 10 | 36 | |
| 11 | 1 | |
| 12 | Comparative Concurrency Semantics and Refinement of Actions | 50 |
| 13 | What is Branching Time Semantics and Why to Use it | 11 |
| 14 | Axiomatising ST-Bisimulation Equivalence | 8 |
| 15 | The Linear Time-Branching Time Spectrum (Extended Abstract) | 106 |
| 16 | Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care. | 2 |
| 17 | Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) | 30 |
| 18 | Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract). | 60 |
| 19 | 4 | |
| 20 | Modular Specifications in Process Algebra with Curious Queues | 1 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.