@phdthesis{Hesse2022, author = {Hesse, G{\"u}nter}, title = {A benchmark for enterprise stream processing architectures}, doi = {10.25932/publishup-56600}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-566000}, school = {Universit{\"a}t Potsdam}, pages = {ix, 148}, year = {2022}, abstract = {Data stream processing systems (DSPSs) are a key enabler to integrate continuously generated data, such as sensor measurements, into enterprise applications. DSPSs allow to steadily analyze information from data streams, e.g., to monitor manufacturing processes and enable fast reactions to anomalous behavior. Moreover, DSPSs continuously filter, sample, and aggregate incoming streams of data, which reduces the data size, and thus data storage costs. The growing volumes of generated data have increased the demand for high-performance DSPSs, leading to a higher interest in these systems and to the development of new DSPSs. While having more DSPSs is favorable for users as it allows choosing the system that satisfies their requirements the most, it also introduces the challenge of identifying the most suitable DSPS regarding current needs as well as future demands. Having a solution to this challenge is important because replacements of DSPSs require the costly re-writing of applications if no abstraction layer is used for application development. However, quantifying performance differences between DSPSs is a difficult task. Existing benchmarks fail to integrate all core functionalities of DSPSs and lack tool support, which hinders objective result comparisons. Moreover, no current benchmark covers the combination of streaming data with existing structured business data, which is particularly relevant for companies. This thesis proposes a performance benchmark for enterprise stream processing called ESPBench. With enterprise stream processing, we refer to the combination of streaming and structured business data. Our benchmark design represents real-world scenarios and allows for an objective result comparison as well as scaling of data. The defined benchmark query set covers all core functionalities of DSPSs. The benchmark toolkit automates the entire benchmark process and provides important features, such as query result validation and a configurable data ingestion rate. To validate ESPBench and to ease the use of the benchmark, we propose an example implementation of the ESPBench queries leveraging the Apache Beam software development kit (SDK). The Apache Beam SDK is an abstraction layer designed for developing stream processing applications that is applied in academia as well as enterprise contexts. It allows to run the defined applications on any of the supported DSPSs. The performance impact of Apache Beam is studied in this dissertation as well. The results show that there is a significant influence that differs among DSPSs and stream processing applications. For validating ESPBench, we use the example implementation of the ESPBench queries developed using the Apache Beam SDK. We benchmark the implemented queries executed on three modern DSPSs: Apache Flink, Apache Spark Streaming, and Hazelcast Jet. The results of the study prove the functioning of ESPBench and its toolkit. ESPBench is capable of quantifying performance characteristics of DSPSs and of unveiling differences among systems. The benchmark proposed in this thesis covers all requirements to be applied in enterprise stream processing settings, and thus represents an improvement over the current state-of-the-art.}, language = {en} } @misc{GalkeGerstenkornScherp2018, author = {Galke, Lukas and Gerstenkorn, Gunnar and Scherp, Ansgar}, title = {A case atudy of closed-domain response suggestion with limited training data}, series = {Database and Expert Systems Applications : DEXA 2018 Iinternational workshops}, volume = {903}, journal = {Database and Expert Systems Applications : DEXA 2018 Iinternational workshops}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-319-99133-7}, issn = {1865-0929}, doi = {10.1007/978-3-319-99133-7_18}, pages = {218 -- 229}, year = {2018}, abstract = {We analyze the problem of response suggestion in a closed domain along a real-world scenario of a digital library. We present a text-processing pipeline to generate question-answer pairs from chat transcripts. On this limited amount of training data, we compare retrieval-based, conditioned-generation, and dedicated representation learning approaches for response suggestion. Our results show that retrieval-based methods that strive to find similar, known contexts are preferable over parametric approaches from the conditioned-generation family, when the training data is limited. We, however, identify a specific representation learning approach that is competitive to the retrieval-based approaches despite the training data limitation.}, language = {en} } @article{WuttkeLiLietal.2019, author = {Wuttke, Matthias and Li, Yong and Li, Man and Sieber, Karsten B. and Feitosa, Mary F. and Gorski, Mathias and Tin, Adrienne and Wang, Lihua and Chu, Audrey Y. and Hoppmann, Anselm and Kirsten, Holger and Giri, Ayush and Chai, Jin-Fang and Sveinbjornsson, Gardar and Tayo, Bamidele O. and Nutile, Teresa and Fuchsberger, Christian and Marten, Jonathan and Cocca, Massimiliano and Ghasemi, Sahar and Xu, Yizhe and Horn, Katrin and Noce, Damia and Van der Most, Peter J. and Sedaghat, Sanaz and Yu, Zhi and Akiyama, Masato and Afaq, Saima and Ahluwalia, Tarunveer Singh and Almgren, Peter and Amin, Najaf and Arnlov, Johan and Bakker, Stephan J. L. and Bansal, Nisha and Baptista, Daniela and Bergmann, Sven and Biggs, Mary L. and Biino, Ginevra and Boehnke, Michael and Boerwinkle, Eric and Boissel, Mathilde and B{\"o}ttinger, Erwin and Boutin, Thibaud S. and Brenner, Hermann and Brumat, Marco and Burkhardt, Ralph and Butterworth, Adam S. and Campana, Eric and Campbell, Archie and Campbell, Harry and Canouil, Mickael and Carroll, Robert J. and Catamo, Eulalia and Chambers, John C. and Chee, Miao-Ling and Chee, Miao-Li and Chen, Xu and Cheng, Ching-Yu and Cheng, Yurong and Christensen, Kaare and Cifkova, Renata and Ciullo, Marina and Concas, Maria Pina and Cook, James P. and Coresh, Josef and Corre, Tanguy and Sala, Cinzia Felicita and Cusi, Daniele and Danesh, John and Daw, E. Warwick and De Borst, Martin H. and De Grandi, Alessandro and De Mutsert, Renee and De Vries, Aiko P. J. and Degenhardt, Frauke and Delgado, Graciela and Demirkan, Ayse and Di Angelantonio, Emanuele and Dittrich, Katalin and Divers, Jasmin and Dorajoo, Rajkumar and Eckardt, Kai-Uwe and Ehret, Georg and Elliott, Paul and Endlich, Karlhans and Evans, Michele K. and Felix, Janine F. and Foo, Valencia Hui Xian and Franco, Oscar H. and Franke, Andre and Freedman, Barry I. and Freitag-Wolf, Sandra and Friedlander, Yechiel and Froguel, Philippe and Gansevoort, Ron T. and Gao, He and Gasparini, Paolo and Gaziano, J. Michael and Giedraitis, Vilmantas and Gieger, Christian and Girotto, Giorgia and Giulianini, Franco and Gogele, Martin and Gordon, Scott D. and Gudbjartsson, Daniel F. and Gudnason, Vilmundur and Haller, Toomas and Hamet, Pavel and Harris, Tamara B. and Hartman, Catharina A. and Hayward, Caroline and Hellwege, Jacklyn N. and Heng, Chew-Kiat and Hicks, Andrew A. and Hofer, Edith and Huang, Wei and Hutri-Kahonen, Nina and Hwang, Shih-Jen and Ikram, M. Arfan and Indridason, Olafur S. and Ingelsson, Erik and Ising, Marcus and Jaddoe, Vincent W. V. and Jakobsdottir, Johanna and Jonas, Jost B. and Joshi, Peter K. and Josyula, Navya Shilpa and Jung, Bettina and Kahonen, Mika and Kamatani, Yoichiro and Kammerer, Candace M. and Kanai, Masahiro and Kastarinen, Mika and Kerr, Shona M. and Khor, Chiea-Chuen and Kiess, Wieland and Kleber, Marcus E. and Koenig, Wolfgang and Kooner, Jaspal S. and Korner, Antje and Kovacs, Peter and Kraja, Aldi T. and Krajcoviechova, Alena and Kramer, Holly and Kramer, Bernhard K. and Kronenberg, Florian and Kubo, Michiaki and Kuhnel, Brigitte and Kuokkanen, Mikko and Kuusisto, Johanna and La Bianca, Martina and Laakso, Markku and Lange, Leslie A. and Langefeld, Carl D. and Lee, Jeannette Jen-Mai and Lehne, Benjamin and Lehtimaki, Terho and Lieb, Wolfgang and Lim, Su-Chi and Lind, Lars and Lindgren, Cecilia M. and Liu, Jun and Liu, Jianjun and Loeffler, Markus and Loos, Ruth J. F. and Lucae, Susanne and Lukas, Mary Ann and Lyytikainen, Leo-Pekka and Magi, Reedik and Magnusson, Patrik K. E. and Mahajan, Anubha and Martin, Nicholas G. and Martins, Jade and Marz, Winfried and Mascalzoni, Deborah and Matsuda, Koichi and Meisinger, Christa and Meitinger, Thomas and Melander, Olle and Metspalu, Andres and Mikaelsdottir, Evgenia K. and Milaneschi, Yuri and Miliku, Kozeta and Mishra, Pashupati P. and Program, V. A. Million Veteran and Mohlke, Karen L. and Mononen, Nina and Montgomery, Grant W. and Mook-Kanamori, Dennis O. and Mychaleckyj, Josyf C. and Nadkarni, Girish N. and Nalls, Mike A. and Nauck, Matthias and Nikus, Kjell and Ning, Boting and Nolte, Ilja M. and Noordam, Raymond and Olafsson, Isleifur and Oldehinkel, Albertine J. and Orho-Melander, Marju and Ouwehand, Willem H. and Padmanabhan, Sandosh and Palmer, Nicholette D. and Palsson, Runolfur and Penninx, Brenda W. J. H. and Perls, Thomas and Perola, Markus and Pirastu, Mario and Pirastu, Nicola and Pistis, Giorgio and Podgornaia, Anna I. and Polasek, Ozren and Ponte, Belen and Porteous, David J. and Poulain, Tanja and Pramstaller, Peter P. and Preuss, Michael H. and Prins, Bram P. and Province, Michael A. and Rabelink, Ton J. and Raffield, Laura M. and Raitakari, Olli T. and Reilly, Dermot F. and Rettig, Rainer and Rheinberger, Myriam and Rice, Kenneth M. and Ridker, Paul M. and Rivadeneira, Fernando and Rizzi, Federica and Roberts, David J. and Robino, Antonietta and Rossing, Peter and Rudan, Igor and Rueedi, Rico and Ruggiero, Daniela and Ryan, Kathleen A. and Saba, Yasaman and Sabanayagam, Charumathi and Salomaa, Veikko and Salvi, Erika and Saum, Kai-Uwe and Schmidt, Helena and Schmidt, Reinhold and Ben Schottker, and Schulz, Christina-Alexandra and Schupf, Nicole and Shaffer, Christian M. and Shi, Yuan and Smith, Albert V. and Smith, Blair H. and Soranzo, Nicole and Spracklen, Cassandra N. and Strauch, Konstantin and Stringham, Heather M. and Stumvoll, Michael and Svensson, Per O. and Szymczak, Silke and Tai, E-Shyong and Tajuddin, Salman M. and Tan, Nicholas Y. Q. and Taylor, Kent D. and Teren, Andrej and Tham, Yih-Chung and Thiery, Joachim and Thio, Chris H. L. and Thomsen, Hauke and Thorleifsson, Gudmar and Toniolo, Daniela and Tonjes, Anke and Tremblay, Johanne and Tzoulaki, Ioanna and Uitterlinden, Andre G. and Vaccargiu, Simona and Van Dam, Rob M. and Van der Harst, Pim and Van Duijn, Cornelia M. and Edward, Digna R. Velez and Verweij, Niek and Vogelezang, Suzanne and Volker, Uwe and Vollenweider, Peter and Waeber, Gerard and Waldenberger, Melanie and Wallentin, Lars and Wang, Ya Xing and Wang, Chaolong and Waterworth, Dawn M. and Bin Wei, Wen and White, Harvey and Whitfield, John B. and Wild, Sarah H. and Wilson, James F. and Wojczynski, Mary K. and Wong, Charlene and Wong, Tien-Yin and Xu, Liang and Yang, Qiong and Yasuda, Masayuki and Yerges-Armstrong, Laura M. and Zhang, Weihua and Zonderman, Alan B. and Rotter, Jerome I. and Bochud, Murielle and Psaty, Bruce M. and Vitart, Veronique and Wilson, James G. and Dehghan, Abbas and Parsa, Afshin and Chasman, Daniel I. and Ho, Kevin and Morris, Andrew P. and Devuyst, Olivier and Akilesh, Shreeram and Pendergrass, Sarah A. and Sim, Xueling and Boger, Carsten A. and Okada, Yukinori and Edwards, Todd L. and Snieder, Harold and Stefansson, Kari and Hung, Adriana M. and Heid, Iris M. and Scholz, Markus and Teumer, Alexander and Kottgen, Anna and Pattaro, Cristian}, title = {A catalog of genetic loci associated with kidney function from analyses of a million individuals}, series = {Nature genetics}, volume = {51}, journal = {Nature genetics}, number = {6}, publisher = {Nature Publ. Group}, address = {New York}, organization = {Lifelines COHort Study}, issn = {1061-4036}, doi = {10.1038/s41588-019-0407-x}, pages = {957 -- +}, year = {2019}, abstract = {Chronic kidney disease (CKD) is responsible for a public health burden with multi-systemic complications. Through transancestry meta-analysis of genome-wide association studies of estimated glomerular filtration rate (eGFR) and independent replication (n = 1,046,070), we identified 264 associated loci (166 new). Of these,147 were likely to be relevant for kidney function on the basis of associations with the alternative kidney function marker blood urea nitrogen (n = 416,178). Pathway and enrichment analyses, including mouse models with renal phenotypes, support the kidney as the main target organ. A genetic risk score for lower eGFR was associated with clinically diagnosed CKD in 452,264 independent individuals. Colocalization analyses of associations with eGFR among 783,978 European-ancestry individuals and gene expression across 46 human tissues, including tubulo-interstitial and glomerular kidney compartments, identified 17 genes differentially expressed in kidney. Fine-mapping highlighted missense driver variants in 11 genes and kidney-specific regulatory variants. These results provide a comprehensive priority list of molecular targets for translational research.}, language = {en} } @misc{HalfpapSchlosser2019, author = {Halfpap, Stefan and Schlosser, Rainer}, title = {A Comparison of Allocation Algorithms for Partially Replicated Databases}, series = {2019 IEEE 35th International Conference on Data Engineering (ICDE)}, journal = {2019 IEEE 35th International Conference on Data Engineering (ICDE)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-7474-1}, issn = {1084-4627}, doi = {10.1109/ICDE.2019.00226}, pages = {2008 -- 2011}, year = {2019}, abstract = {Increasing demand for analytical processing capabilities can be managed by replication approaches. However, to evenly balance the replicas' workload shares while at the same time minimizing the data replication factor is a highly challenging allocation problem. As optimal solutions are only applicable for small problem instances, effective heuristics are indispensable. In this paper, we test and compare state-of-the-art allocation algorithms for partial replication. By visualizing and exploring their (heuristic) solutions for different benchmark workloads, we are able to derive structural insights and to detect an algorithm's strengths as well as its potential for improvement. Further, our application enables end-to-end evaluations of different allocations to verify their theoretical performance.}, language = {en} } @misc{TorkuraSukmanaKayemetal.2018, author = {Torkura, Kennedy A. and Sukmana, Muhammad Ihsan Haikal and Kayem, Anne V. D. M. and Cheng, Feng and Meinel, Christoph}, title = {A cyber risk based moving target defense mechanism for microservice architectures}, series = {IEEE Intl Conf on Parallel \& Distributed Processing with Applications, Ubiquitous Computing \& Communications, Big Data \& Cloud Computing, Social Computing \& Networking, Sustainable Computing \& Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)}, journal = {IEEE Intl Conf on Parallel \& Distributed Processing with Applications, Ubiquitous Computing \& Communications, Big Data \& Cloud Computing, Social Computing \& Networking, Sustainable Computing \& Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)}, publisher = {Institute of Electrical and Electronics Engineers}, address = {Los Alamitos}, isbn = {978-1-7281-1141-4}, issn = {2158-9178}, doi = {10.1109/BDCloud.2018.00137}, pages = {932 -- 939}, year = {2018}, abstract = {Microservice Architectures (MSA) structure applications as a collection of loosely coupled services that implement business capabilities. The key advantages of MSA include inherent support for continuous deployment of large complex applications, agility and enhanced productivity. However, studies indicate that most MSA are homogeneous, and introduce shared vulnerabilites, thus vulnerable to multi-step attacks, which are economics-of-scale incentives to attackers. In this paper, we address the issue of shared vulnerabilities in microservices with a novel solution based on the concept of Moving Target Defenses (MTD). Our mechanism works by performing risk analysis against microservices to detect and prioritize vulnerabilities. Thereafter, security risk-oriented software diversification is employed, guided by a defined diversification index. The diversification is performed at runtime, leveraging both model and template based automatic code generation techniques to automatically transform programming languages and container images of the microservices. Consequently, the microservices attack surfaces are altered thereby introducing uncertainty for attackers while reducing the attackability of the microservices. Our experiments demonstrate the efficiency of our solution, with an average success rate of over 70\% attack surface randomization.}, language = {en} } @phdthesis{Krentz2019, author = {Krentz, Konrad-Felix}, title = {A Denial-of-Sleep-Resilient Medium Access Control Layer for IEEE 802.15.4 Networks}, doi = {10.25932/publishup-43930}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-439301}, school = {Universit{\"a}t Potsdam}, pages = {xiv, 187}, year = {2019}, abstract = {With the emergence of the Internet of things (IoT), plenty of battery-powered and energy-harvesting devices are being deployed to fulfill sensing and actuation tasks in a variety of application areas, such as smart homes, precision agriculture, smart cities, and industrial automation. In this context, a critical issue is that of denial-of-sleep attacks. Such attacks temporarily or permanently deprive battery-powered, energy-harvesting, or otherwise energy-constrained devices of entering energy-saving sleep modes, thereby draining their charge. At the very least, a successful denial-of-sleep attack causes a long outage of the victim device. Moreover, to put battery-powered devices back into operation, their batteries have to be replaced. This is tedious and may even be infeasible, e.g., if a battery-powered device is deployed at an inaccessible location. While the research community came up with numerous defenses against denial-of-sleep attacks, most present-day IoT protocols include no denial-of-sleep defenses at all, presumably due to a lack of awareness and unsolved integration problems. After all, despite there are many denial-of-sleep defenses, effective defenses against certain kinds of denial-of-sleep attacks are yet to be found. The overall contribution of this dissertation is to propose a denial-of-sleep-resilient medium access control (MAC) layer for IoT devices that communicate over IEEE 802.15.4 links. Internally, our MAC layer comprises two main components. The first main component is a denial-of-sleep-resilient protocol for establishing session keys among neighboring IEEE 802.15.4 nodes. The established session keys serve the dual purpose of implementing (i) basic wireless security and (ii) complementary denial-of-sleep defenses that belong to the second main component. The second main component is a denial-of-sleep-resilient MAC protocol. Notably, this MAC protocol not only incorporates novel denial-of-sleep defenses, but also state-of-the-art mechanisms for achieving low energy consumption, high throughput, and high delivery ratios. Altogether, our MAC layer resists, or at least greatly mitigates, all denial-of-sleep attacks against it we are aware of. Furthermore, our MAC layer is self-contained and thus can act as a drop-in replacement for IEEE 802.15.4-compliant MAC layers. In fact, we implemented our MAC layer in the Contiki-NG operating system, where it seamlessly integrates into an existing protocol stack.}, language = {en} } @article{IhdePufahlVoelkeretal.2022, author = {Ihde, Sven and Pufahl, Luise and V{\"o}lker, Maximilian and Goel, Asvin and Weske, Mathias}, title = {A framework for modeling and executing task}, series = {Computing : archives for informatics and numerical computation}, volume = {104}, journal = {Computing : archives for informatics and numerical computation}, publisher = {Springer}, address = {Wien}, issn = {0010-485X}, doi = {10.1007/s00607-022-01093-2}, pages = {2405 -- 2429}, year = {2022}, abstract = {As resources are valuable assets, organizations have to decide which resources to allocate to business process tasks in a way that the process is executed not only effectively but also efficiently. Traditional role-based resource allocation leads to effective process executions, since each task is performed by a resource that has the required skills and competencies to do so. However, the resulting allocations are typically not as efficient as they could be, since optimization techniques have yet to find their way in traditional business process management scenarios. On the other hand, operations research provides a rich set of analytical methods for supporting problem-specific decisions on resource allocation. This paper provides a novel framework for creating transparency on existing tasks and resources, supporting individualized allocations for each activity in a process, and the possibility to integrate problem-specific analytical methods of the operations research domain. To validate the framework, the paper reports on the design and prototypical implementation of a software architecture, which extends a traditional process engine with a dedicated resource management component. This component allows us to define specific resource allocation problems at design time, and it also facilitates optimized resource allocation at run time. The framework is evaluated using a real-world parcel delivery process. The evaluation shows that the quality of the allocation results increase significantly with a technique from operations research in contrast to the traditional applied rule-based approach.}, language = {en} } @misc{GonzalezLopezPufahl2019, author = {Gonzalez-Lopez, Fernanda and Pufahl, Luise}, title = {A Landscape for Case Models}, series = {Enterprise, Business-Process and Information Systems Modeling}, volume = {352}, journal = {Enterprise, Business-Process and Information Systems Modeling}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-030-20618-5}, issn = {1865-1348}, doi = {10.1007/978-3-030-20618-5_6}, pages = {87 -- 102}, year = {2019}, abstract = {Case Management is a paradigm to support knowledge-intensive processes. The different approaches developed for modeling these types of processes tend to result in scattered models due to the low abstraction level at which the inherently complex processes are therein represented. Thus, readability and understandability is more challenging than that of traditional process models. By reviewing existing proposals in the field of process overviews and case models, this paper extends a case modeling language - the fragment-based Case Management (fCM) language - with the goal of modeling knowledge-intensive processes from a higher abstraction level - to generate a so-called fCM landscape. This proposal is empirically evaluated via an online experiment. Results indicate that interpreting an fCM landscape might be more effective and efficient than interpreting an informationally equivalent case model.}, language = {en} } @book{SchneiderLambersOrejas2019, author = {Schneider, Sven and Lambers, Leen and Orejas, Fernando}, title = {A logic-based incremental approach to graph repair}, number = {126}, publisher = {Universit{\"a}tsverlag Potsdam}, address = {Potsdam}, isbn = {978-3-86956-462-3}, issn = {1613-5652}, doi = {10.25932/publishup-42751}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-427517}, publisher = {Universit{\"a}t Potsdam}, pages = {34}, year = {2019}, abstract = {Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.}, language = {en} } @article{dePaulaMarxWolfetal.2022, author = {de Paula, Danielly and Marx, Carolin and Wolf, Ella and Dremel, Christian and Cormican, Kathryn and Uebernickel, Falk}, title = {A managerial mental model to drive innovation in the context of digital transformation}, series = {Industry and innovation}, journal = {Industry and innovation}, publisher = {Routledge, Taylor \& Francis Group}, address = {Abingdon}, issn = {1366-2716}, doi = {10.1080/13662716.2022.2072711}, pages = {24}, year = {2022}, abstract = {Industry 4.0 is transforming how businesses innovate and, as a result, companies are spearheading the movement towards 'Digital Transformation'. While some scholars advocate the use of design thinking to identify new innovative behaviours, cognition experts emphasise the importance of top managers in supporting employees to develop these behaviours. However, there is a dearth of research in this domain and companies are struggling to implement the required behaviours. To address this gap, this study aims to identify and prioritise behavioural strategies conducive to design thinking to inform the creation of a managerial mental model. We identify 20 behavioural strategies from 45 interviewees with practitioners and educators and combine them with the concepts of 'paradigm-mindset-mental model' from cognition theory. The paper contributes to the body of knowledge by identifying and prioritising specific behavioural strategies to form a novel set of survival conditions aligned to the new industrial paradigm of Industry 4.0.}, language = {en} }