Bas Luttik

807 total citations
44 papers, 244 citations indexed

About

Bas Luttik is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Bas Luttik has authored 44 papers receiving a total of 244 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computational Theory and Mathematics, 31 papers in Artificial Intelligence and 7 papers in Computer Networks and Communications. Recurrent topics in Bas Luttik's work include Logic, programming, and type systems (29 papers), Formal Methods in Verification (27 papers) and semigroups and automata theory (12 papers). Bas Luttik is often cited by papers focused on Logic, programming, and type systems (29 papers), Formal Methods in Verification (27 papers) and semigroups and automata theory (12 papers). Bas Luttik collaborates with scholars based in Netherlands, Iceland and Australia. Bas Luttik's co-authors include Nikola Trčka, Wan Fokkink, Rob van Glabbeek, Anna Ingólfsdóttir, Luca Aceto, J. C. M. Baeten, J.E. Rooda, Rob J. van Glabbeek, Helle Hvid Hansen and Mohammad Reza Mousavi and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Bas Luttik

42 papers receiving 222 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Bas Luttik Netherlands	9	209	151	50	35	27	44	244
Yih-Kuen Tsay Taiwan	6	270 1.3×	182 1.2×	103 2.1×	78 2.2×	37 1.4×	15	317
David de Frutos Escrig Spain	10	201 1.0×	102 0.7×	37 0.7×	73 2.1×	26 1.0×	38	258
Prasanna Thati United States	5	118 0.6×	118 0.8×	46 0.9×	40 1.1×	17 0.6×	6	174
Thomas Hune Denmark	8	189 0.9×	93 0.6×	82 1.6×	16 0.5×	58 2.1×	15	229
Mihaela Sighireanu France	6	93 0.4×	70 0.5×	48 1.0×	46 1.3×	53 2.0×	18	158
Christian Suttner Australia	11	218 1.0×	341 2.3×	39 0.8×	77 2.2×	39 1.4×	16	394
Uli Fahrenberg France	9	160 0.8×	110 0.7×	72 1.4×	25 0.7×	20 0.7×	42	211
Yonit Kesten Israel	11	233 1.1×	151 1.0×	109 2.2×	36 1.0×	45 1.7×	11	264
Vlad Rusu France	8	148 0.7×	116 0.8×	137 2.7×	41 1.2×	39 1.4×	29	243
Anton Wijs Netherlands	9	112 0.5×	68 0.5×	77 1.5×	23 0.7×	48 1.8×	37	176

Countries citing papers authored by Bas Luttik

Since Specialization

Citations

This map shows the geographic impact of Bas Luttik'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 Bas Luttik with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bas Luttik more than expected).

Fields of papers citing papers by Bas Luttik

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bas Luttik. 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 Bas Luttik. The network helps show where Bas Luttik may publish in the future.

Co-authorship network of co-authors of Bas Luttik

This figure shows the co-authorship network connecting the top 25 collaborators of Bas Luttik. A scholar is included among the top collaborators of Bas Luttik 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 Bas Luttik. Bas Luttik is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Baeten, J. C. M., et al.. (2023). Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. Logical Methods in Computer Science. Volume 19, Issue 1. 1 indexed citations

Luttik, Bas, et al.. (2022). A Case in Point: Verification and Testing of a EULYNX Interface. Formal Aspects of Computing. 35(1). 1–38. 1 indexed citations

Luttik, Bas & Fei Yang. (2021). The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable.. Logical Methods in Computer Science. 17.

Glabbeek, Rob van, et al.. (2020). Rooted divergence-preserving branching bisimilarity is a congruence. SHILAP Revista de lepidopterología. 1 indexed citations

Aceto, Luca, Valentina Castiglioni, Wan Fokkink, Anna Ingólfsdóttir, & Bas Luttik. (2020). Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of\n Parallel Composition?. arXiv (Cornell University). 1 indexed citations

Luttik, Bas, et al.. (2020). Off-the-shelf automated analysis of liveness properties for just paths. Acta Informatica. 57(3-5). 551–590. 3 indexed citations

Luttik, Bas. (2015). Unique parallel decomposition in branching and weak bisimulation semantics. Theoretical Computer Science. 612. 29–44. 3 indexed citations

Baeten, J. C. M., et al.. (2013). Reactive Turing machines. Information and Computation. 231. 143–166. 7 indexed citations

Aceto, Luca, Taolue Chen, Anna Ingólfsdóttir, Bas Luttik, & Jaco van de Pol. (2011). On the axiomatizability of priority II. Theoretical Computer Science. 412(28). 3035–3044. 1 indexed citations

10.

Baeten, J. C. M., et al.. (2009). A Process-Theoretic Look at Automata. Lecture notes in computer science. 5961. 1–33. 1 indexed citations

11.

Glabbeek, Rob van, Bas Luttik, & Nikola Trčka. (2009). Branching Bisimilarity with Explicit Divergence. Fundamenta Informaticae. 93(4). 371–392. 31 indexed citations

12.

Glabbeek, Rob J. van, Bas Luttik, & Nikola Trčka. (2009). Computation Tree Logic with Deadlock Detection. Logical Methods in Computer Science. Volume 5, Issue 4. 10 indexed citations

13.

Glabbeek, Rob van, Bas Luttik, & Nikola Trčka. (2008). . TU/e Research Portal. 21 indexed citations

14.

Chen, Taolue, et al.. (2008). On finite alphabets and infinite bases. Information and Computation. 206(5). 492–519. 7 indexed citations

15.

Trčka, Nikola, Anton Wijs, Bas Luttik, et al.. (2005). Analyzing a χ model of a turntable system using Spin, CADP and Uppaal. The Journal of Logic and Algebraic Programming. 65(2). 51–104. 25 indexed citations

16.

Aceto, Luca, Wan Fokkink, Anna Ingólfsdóttir, & Bas Luttik. (2004). CCS with Hennessy's merge has no finite-equational axiomatization. Theoretical Computer Science. 330(3). 377–405. 15 indexed citations

17.

Aceto, Luca, Wan Fokkink, Anna Ingólfsdóttir, & Bas Luttik. (2004). Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge. BRICS Report Series. 11(1). 9 indexed citations

18.

Luttik, Bas. (2003). On the expressiveness of choice quantification. Annals of Pure and Applied Logic. 121(1). 39–87. 1 indexed citations

19.

Luttik, Bas. (1999). Cylindric process algebras with conditionals give substitutionless $ p $ CRL. Data Archiving and Networked Services (DANS). 1–16. 1 indexed citations

20.

Luttik, Bas. (1997). Description and formal specification of the link layer of P1394. Data Archiving and Networked Services (DANS). 1–18. 4 indexed citations

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.

Explore authors with similar magnitude of impact