Bas Luttik

Technische Universiteit Eindhoven

H-index: 22

Europe-Netherlands

About Bas Luttik

Bas Luttik, With an exceptional h-index of 22 and a recent h-index of 11 (since 2020), a distinguished researcher at Technische Universiteit Eindhoven, specializes in the field of Theoretical Computer Science, Concurrency Theory, Automata Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Four Formal Models of IEEE 1394 Link Layer

Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics

Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers

A case in point: verification and testing of a EULYNX interface

Pushdown automata and context-free grammars in bisimulation semantics

Decompositional Branching Bisimulation Minimisation of Monolithic Processes

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

Safe and secure future AI-driven railway technologies: challenges for formal methods in railway

Bas Luttik Information

University	Technische Universiteit Eindhoven
Position	Assistant Professor of Computer Science
Citations(all)	1241
Citations(since 2020)	450
Cited By	946
hIndex(all)	22
hIndex(since 2020)	11
i10Index(all)	37
i10Index(since 2020)	16
Email	Access Email
University Profile Page	Technische Universiteit Eindhoven
Google Scholar	View Google Scholar Profile

Bas Luttik Skills & Research Interests

Theoretical Computer Science

Concurrency Theory

Automata Theory

Top articles of Bas Luttik

Four Formal Models of IEEE 1394 Link Layer

arXiv preprint arXiv:2403.18723

2024/3/27

Bas Luttik

H-Index: 10

Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics

arXiv preprint arXiv:2309.07308

2023/9/13

Bas Luttik

H-Index: 10

Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers

arXiv preprint arXiv:2307.05143

2023/7/11

Bas Luttik

H-Index: 10

A case in point: verification and testing of a EULYNX interface

Formal Aspects of Computing

2023/3/16

Mark Bouwman

H-Index: 2

Bas Luttik

H-Index: 10

Arend Rensink

H-Index: 14

Pushdown automata and context-free grammars in bisimulation semantics

Logical Methods in Computer Science

2023/3/2

Bas Luttik

H-Index: 10

Decompositional Branching Bisimulation Minimisation of Monolithic Processes

2022/11/2

Mark Bouwman

H-Index: 2

Maurice Laveaux

H-Index: 2

Bas Luttik

H-Index: 10

Tim Willemse

H-Index: 13

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

ACM Transactions on Computational Logic

2022/10/20

Wan Fokkink

H-Index: 15

Bas Luttik

H-Index: 10

Safe and secure future AI-driven railway technologies: challenges for formal methods in railway

2022/10/17

Monika Seisenberger

H-Index: 7

Xiuyi Fan

H-Index: 15

Alessio Ferrari

H-Index: 11

Bas Luttik

H-Index: 10

Jaco Van De Pol

H-Index: 18

Simon Wimmer

H-Index: 4

Supporting Railway Innovations with Formal Modelling and Verification

2022/9/5

Bas Luttik

H-Index: 10

On the axiomatisation of branching bisimulation congruence over CCS

arXiv preprint arXiv:2206.13927

2022/6/28

Bas Luttik

H-Index: 10

Proceedings Fifth Workshop on Models for Formal Analysis of Real Systems, MARS@ ETAPS 2022, Munich, Germany, 2nd April 2022

2022/3/17

Clemens Dubslaff

H-Index: 11

Bas Luttik

H-Index: 10

On the axiomatisability of parallel composition

Logical Methods in Computer Science

2022/1/19

Bas Luttik

H-Index: 10

Supporting the Development of Hybrid ERTMS/ETCS Level 3 with Formal Modelling, Analysis and Simulation

Leveraging Applications of Formal Methods, Verification and Validation: 10th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2021, Rhodes, Greece, October 17–29, 2021, Proceedings

2021/10/11