Frits Vaandrager
About
In The Last Decade
Frits Vaandrager
93 papers receiving 2.0k citations
Peers
Comparison fields: 5 of 71
- Computational Theory and Mathematics 1.5k
- Artificial Intelligence 1.0k
- Software 641
- Computer Networks and Communications 446
- Hardware and Architecture 407
Countries citing papers authored by Frits Vaandrager
This map shows the geographic impact of Frits Vaandrager'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 Frits Vaandrager with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frits Vaandrager more than expected).
Fields of papers citing papers by Frits Vaandrager
This network shows the impact of papers produced by Frits Vaandrager. 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 Frits Vaandrager. The network helps show where Frits Vaandrager may publish in the future.
Co-authorship network of co-authors of Frits Vaandrager
This figure shows the co-authorship network connecting the top 25 collaborators of Frits Vaandrager. A scholar is included among the top collaborators of Frits Vaandrager 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 Frits Vaandrager. Frits Vaandrager is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | Benchmarks for Automata Learning and Conformance Testing | 1 |
| 3 | Generating Models of Infinite-State Communication Protocols using Regular Inference with Abstraction | 2 |
| 4 | 7 | |
| 5 | Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems | 7 |
| 6 | Fortuna: Model Checking Priced Probabilistic Timed Automata | 1 |
| 7 | Analysis of a Protocol for Dynamic Configuration of IPv4 Link Local Addresses Using Uppaal | 7 |
| 8 | A Testing Scenario for Probabilistic Processes | 1 |
| 9 | Formal Models of Guaranteed and Best-Effort Services for Network on Chip | 1 |
| 10 | Model Checker Aided Design of a Controller for a Wafer Scanner | 2 |
| 11 | A Framework for Modeling Timed Systems with Restricted Hybrid Automata | 2 |
| 12 | Testing Timed Automata | 23 |
| 13 | The difference between splitting in n and n + 1 | 2 |
| 14 | Expressiveness results for process algebras | 21 |
| 15 | Three logics for branching bisimulation | 2 |
| 16 | An efficient algorithm for branching bisimulation and stuttering equivalence | 23 |
| 17 | Back and forth bisimulations | 29 |
| 18 | Three Logics for Branching Bisimulation (Extended Abstract) | 16 |
| 19 | Modular Specifications in Process Algebra with Curious Queues | 1 |
| 20 | Process algebra semantics of POOL | 3 |
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.