Universiteit Leiden

nl en

Four million euros for DIGITAL TWIN program

The five-year DIGITAL TWIN program can start as NWO granted 4 million euros from the Perspective program. With this grant, 19 new researchers will be appointed.

Combination with artificial intelligence

The DIGITAL TWIN program is developing methods for turning high-tech systems into accurate digital twins: virtual software versions with which you can perform simulations to predict, for example, how changes in the design affect performance, how the control system can be improved, or which component needs maintenance at what time.

Digital twins are now mostly based on static theoretical models based on normal behavior. By linking these models to measurement data that indicate how the system functions and combining this data with artificial intelligence, the researchers create digital copies that continuously improve and adapt themselves.


In the program, six universities, including Leiden University, work together with twelve industrial partners and knowledge organizations from the high-tech, metal, and composite industries. The Leiden Institute of Advanced Computer Science (LIACS) will appoint two new researchers.

Developing models

The two researchers appointed by LIACS will focus on developing and learning models that combine knowledge of high-tech systems with data. The models are then used to detect anomalies in high-tech systems, so that, for example, early maintenance can be carried out to prevent more serious problems.

Due to the selected cookie settings, we cannot show this video here.

Watch the video on the original website or

The DIGITAL TWIN program is a collaboration between Rijksuniversiteit Groningen, Technische Universiteit Eindhoven, Technische Universiteit Delft, Universiteit Twente, Universiteit Leiden en Universiteit Tilburg, Airborne, Altran, ASML, ASM PT, Demcon, Fraunhofer Institute for Production Technology, OcĂ©, Philips, Stamicarbon, Tata Steel, TNO en VDL Group.

More information about the DIGITAL TWIN program.

This website uses cookies.  More information.