- informatik-vortraege - lists.rwth-aachen.de

Einladung: Informatik-Oberseminar Roman Matzutt
by Förster, Claudia 09 Oct '23

09 Oct '23

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Freitag, 20. Oktober 2023, 15.30 Uhr Ort: Seminarraum Informatik 4 (COMSYS) - 9007, E3, Ahornstr. 55 [1] Digtaler Zugang (hybrider Vortrag): https://rwth.zoom-x.de/j/69772277508?pwd=SU5qN1FPVXI5V3UwakYydnBUUW1Ldz09 (Meeting-ID: 697 7227 7508 Kenncode: 031824) Referent: Roman Matzutt M.Sc. Lehrstuhl Informatik 4 (COMSYS) Thema: Demystifying and Adjusting the Promises of Blockchain-based Data Management in the Permissionless Setting Abstract: The digital currency Bitcoin introduced the blockchain as a data structure for establishing consensus in a decentralized manner. Since then, blockchain technology generalized to immutably recording arbitrary events and data, now allowing more general online interactions between distrusting users. This interaction model sparked a tremendous interest in blockchain technology, its potential, and applications. However, the identification of multiple shortcomings has since dampened this initial spirit of optimism. Our research focuses on deepening the understanding of these shortcomings, improving upon them, and gauging the true potential for blockchain-backed applications despite these limitations. We take a data-driven perspective to assess the security and longevity of permissionless blockchains, such as Bitcoin, where anybody can access the blockchain's full history and propose new data to be appended. Here, we identify two core challenges: First, the ability of malicious actors to irrevocably append illicit content to a blockchain implies required moderation capabilities despite the desired immutability. Second, the need for massively replicating the full and ever-growing blockchain history poses significant scalability challenges. We tackle these challenges with four contributions. First, we systematically analyze the phenomenon of blockchain content insertion, showing that inserting illicit content can create devastating consequences. Second, we explore means to mitigate these consequences by considering strategies to prevent content insertion and by proposing a new redactable blockchain for the swift and transparent removal of unwanted content. Third, we address the challenge of ever-growing blockchain sizes by proposing a gradually deployable block-pruning scheme that is retrofittable to Bitcoin and enables users to retroactively reduce their storage requirements. Finally, our fourth contribution shows that permissionless blockchains still hold an untapped potential for fueling novel applications by demonstrating how Bitcoin can help securely bootstrapping decentralized anonymity services. Overall, we shed new light on the potential impact of the data persisted on blockchains and widen the scope for resilient and durable blockchain designs for data management tasks. Es laden ein: die Dozentinnen und Dozenten der Informatik [1] https://www.comsys.rwth-aachen.de/fileadmin/misc/how-to-get-to-comsys.pdf

1 0

[sekretariate] Einladung Informatik-Oberseminar Jera Hensel
by Elke Ohlenforst 28 Sep '23

28 Sep '23

+********************************************************************** * * *Einladung * * * *Informatik-Oberseminar * * * +********************************************************************** Zeit: Donnerstag, 12. Okt. 2023, 09:00 Uhr Ort: Informatikzentrum der RWTH Aachen University, Gebäude E3, 2. Etage, Raum 9222 Referent: Jera Hensel, M.Sc. Lehr- und Forschungsgebiet Informatik 2 Thema: Automated Termination Analysis of C Programs Abstract: The termination behavior of a program is a crucial property when reasoning about its correctness and safety. Non-termination and also undesired termination can lead to serious consequences such as system crashes and security vulnerabilities. Therefore, we are interested in techniques to (dis)prove termination of programs to make software systems more secure and reliable. Analyzing the termination behavior of C programs is especially challenging since C combines concepts of higher programming languages with pointers and explicit memory management. In this talk, we summarize our improvements of a termination analysis approach that is especially powerful for C programs with memory allocation and explicit pointer arithmetic, but which was limited to rather small non-recursive programs without recursive data structures, where all integers were interpreted as unbounded (mathematical) integers. This approach uses symbolic execution with abstraction to convert the analyzed program to an integer transition system (ITS) with the property that termination of this ITS implies termination of the C program. Thus, after this transformation, existing techniques for ITSs can be applied to prove termination of the program. We lift the above mentioned restrictions by new techniques that only require adaptions of the symbolic execution rules and the abstraction methods, but use the same transformation to ITSs as before. Moreover, we briefly show how this approach is modified to prove non-termination. We implemented all extensions in our tool AProVE and evaluate them in comparison with other leading termination tools. Es laden ein: die Dozentinnen und Dozenten der Informatik -- Elke Ohlenforst Softwaremodellierung und Verifikation Lehrstuhl Informatik 2, RWTH Aachen Ahornstr. 55, D-52074 Aachen/Germany Tel.: +49 (0)241 80-21201 email:ohlenforst@informatik.rwth-aachen.de https://moves.rwth-aachen.de/

1 0

[Informatik-assistenten] Einladung: Informatik-Oberseminar Dzenan
by Dzafic, Dzenan 13 Sep '23

13 Sep '23

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Donnerstag, 14. September 2023, 15.00 Uhr Ort: Informatikzentrum, H, 2. Etage, Raum 2202. Referent: Dzenan Dzafic, M. Sc. Lehrstuhl Informatik 11 (Embedded Software) Thema: Fahrassistenz für Elektrorollstühle Abstract: In der heutigen Gesellschaft unterstützen Smartphone-Apps die Menschen in den meisten Bereichen. Seien es Planungen von täglichen Aktivitäten oder die spezifische Suche nach Information. Ein weiterer sehr großer Anwendungsbereich ist die Frage: “Wie kommt ein Mensch von A nach B?”. Bei den meisten Menschen kommen Navigationsapps wie z.B. Google-Maps etc. zum Einsatz. Für über zwei Millionen der Deutschen ist dies nicht immer möglich[1] [2], da Menschen mit einer schweren Behinderung andere Anforderung haben. Denn viele Wege sind nicht barrierefrei, die Akkukapazität des Elektrollstuhls ist beschränkt und damit auch ihre Reichweite, oder der Bodenbelag ist für ihren Rollstuhl so uneben, dass eine erhöhte Kippgefahr besteht. Zusatzlich dazu bewirken einige Bodenbelage eine drastische Senkung des Komforts für den Rollstuhlfahrer, der stark darauf durchgeschüttelt wird. Genau an diesem Punkt setzt diese Arbeit mit den Projekt eNav an. eNav ist ein Navigationssysstem für Rollstuhlfahrer mit dem Ziel die Lebensqualität von Menschen mit Mobilitätseinschränkung zu erhöhen. Dabei steht neben der Barrierefreiheit auch der Energieverbrauch des Elektrorollstuhls im Vordergrund. Das System informiert den Benutzer über den Energieverbrauch, sodass dieser nicht mitten auf dem Weg stehen bleibt. Die Entwicklung des eNav Systems zeigt, wie es möglich ist das Kartenmaterial aufzubereiten, um mit eNav barrierefreies energieeffizientes Routen zu ermöglichen und was dafür notwendig ist. Die Beschaffung und Erzeugung der dafür benötigten Datenquellen spielt hier eine zentrale Rolle. Ein dafür modifizierter A*-Algorithmus sorgt dann für energieeffizientes Routen. Das Multimodale Dynamische Routing verkürzt die Reisezeit und reduziert den Energieverbrauch, indem es den öffentlichen Nahverkehr einbezieht. Eine Untersuchung zeigt, dass in der Stadt Aachen in 41% allen untersuchten Routen eine energieeffizientere Route im Vergleich zur kürzesten Route existiert. Der Benutzer kann die Vorteile von eNav mit Hilfe eines Routenplaners und einer Navigations-App nutzen. Es laden ein: die Dozentinnen und Dozenten der Informatik _______________________________________________ Informatik-assistenten mailing list -- informatik-assistenten(a)lists.rwth-aachen.de To unsubscribe send an email to informatik-assistenten-leave(a)lists.rwth-aachen.de https://lists.rwth-aachen.de/postorius/lists/informatik-assistenten.lists.r… ________________________________________________ Dzenan Dzafic, M. Sc. RWTH RWTH Aachen University Embedded Software (Lehrstuhl für Informatik 11) Ahornstrasse 55, 52074 Aachen, Germany Office: Room 2309 (Building H) Tel.: +49 241 80 21159 Mobile: +49 173 5720384 Fax: +49 241 80 21150 Email: dzafic(a)embedded.rwth-aachen.de Web: https://embedded.rwth-aachen.de/

1 0

Einladung Informatik-Oberseminar Till Hofmann
by Stephanie Jansen 07 Sep '23

07 Sep '23

********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * *********************************************************************** Zeit: Mittwoch, 20. September 2023, 14:00 Uhr Ort: Informatikzentrum, 5053.2 (B-IT) Zoom:https://rwth.zoom-x.de/j/63749614813 Referent: Till Hofmann, M.Sc. Thema: Towards Bridging the Gap between High-Level Reasoning and Execution on Robots Abstract: When reasoning about actions, e.g., by means of task planning or agent programming with Golog, the robot's actions are typically modeled on an abstract level, where complex actions such as picking up an object are treated as atomic primitives with deterministic effects and preconditions that only depend on the current state. However, executing such an action on a robot is a complex task involving multiple steps with additional temporal preconditions and timing constraints. Furthermore, the action may be noisy, e.g., producing erroneous sensing results and not always having the desired effects. While these aspects are typically ignored in reasoning tasks, they need to be dealt with during execution. In this thesis, we propose several approaches towards closing this gap. Based on a variant of the situation calculus that incorporates metric time and metric temporal logic, we propose modeling the robot platform with timed automata and temporal constraints to describe the connection between the high-level actions and the robot platform. We then describe two approaches towards transforming the high-level program. First, we view the transformation as a synthesis problem, where the task is to synthesize a controller that executes the program while satisfying the specification, independent of the environment's choices. We show that the synthesis problem is decidable, describe an algorithm to construct a controller, and evaluate the approach in two robotics scenarios. While this approach supports controlling Golog programs against a specification with timing constraints, the synthesis problem has non-primitive recursive complexity and therefore does not scale well. For this reason, we describe a second approach based on some simplifying assumptions which allow us to view the transformation problem as a reachability problem on timed automata, which can be solved with state-of-the-art tools. We demonstrate the effectiveness and scalability of the approach in a number of scenarios. Finally, we turn towards noisy sensors and effectors. Based on DS, a probabilistic variant of the situation calculus that allows modeling the agent's degree of belief, we describe an abstraction framework for Golog programs with noisy actions. In this framework, a high-level and non-stochastic program is mapped to a more detailed and stochastic low-level program. As the high-level program is non-stochastic, we may use non-probabilistic reasoning methods such as task planning. At the same time, by mapping the abstract actions to low-level programs, we may still deal with uncertainty during execution. We define a suitable notion of bisimulation that guarantees the equivalence between the high-level and low-level programs and demonstrate the approach with an example. Es laden ein: die Dozentinnen und Dozenten der Informatik -- Stephanie Jansen Faculty of Mathematics, Computer Science and Natural Sciences HLTPR - Human Language Technology and Pattern Recognition RWTH Aachen University Theaterstraße 35-39 D-52062 Aachen Tel: +49 241 80-21601 sek(a)hltpr.rwth-aachen.de www.hltpr.rwth-aachen.de

1 0

Einladung: Vortrag von Sascha Fahl zu Human Factors in Cybersecurity
by Vincent Drury 23 Aug '23

23 Aug '23

Sehr geehrte Damen und Herren, hiermit möchte ich Sie herzlich zu folgendem Vortrag von Prof. Sascha Fahl (CISPA, Leibniz Universität Hannover) einladen: Zeit: Freitag, 16. Juni 2023, 12.00 Uhr Ort: UMIC 025 (Mies-van-der-Rohe Str. 15, EG) Thema: A Holistic Approach to Human Factors in Cybersecurity Abstract: The field of information security and privacy has taught us that developing functional and practical security mechanisms requires more than just technological innovation. Human factors play a crucial role in the success or failure of security and privacy systems. The persistent gap between the theoretical security of cryptographic algorithms and real-world vulnerabilities, data breaches, and possible attacks has highlighted the need for a holistic approach to security and privacy research. As a researcher in this field, I have focused on identifying crucial weak points and empowering all actors involved in creating and using security and privacy-preserving technology. This includes end-users, developers, and system operators. My research has involved working with secure messaging, security indicators, and authentication mechanisms to empower end-users, improving APIs, documentation, and developer tools to support developers, and improving configuration languages and tools to benefit system operators. In this talk, I will demonstrate how this holistic approach to human factors in cybersecurity research helps close the gap between theoretical security, privacy, and real-world deployments. I will present my past and current work on supporting expert users and protecting end-users and outlining my goals and strategies for future research. Through a combination of technical innovation and consideration of human factors, I believe we can successfully prevent involuntary loss of control over data and empower users to retain power over their security and privacy. Mit freundlichen Grüßen Vincent Drury

2 4

Einladung: Informatik-Oberseminar Tim Quatmann
by Tim Quatmann 23 Aug '23

23 Aug '23

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Dienstag, 5. September 2023, 14.00 Uhr Ort: Informatikzentrum, E3, 2. Etage, Raum 9222 Referent: Tim Quatmann M.Sc. Lehrstuhl Informatik 2 (Software Modeling and Verification) Thema: Verification of Multi-Objective Markov Models Abstract: Probabilistic systems evolve based on environmental events that occur with a certain probability. For such systems to perform well, we are often interested in multiple objectives, i.e., quantitative performance measures like the probability of a failure or the expected time until task completion. Sometimes, these objectives conflict with each other: minimizing the failure probability possibly means completing the task takes longer. Compromises need to be found. We consider Markov models — particularly Markov decision processes (MDPs) and Markov Automata (MAs). These state-based modeling formalisms describe a system in its random environment. Starting from an initial state, the transitioning behavior in MDPs is determined by probabilistic and nondeterministic choices. MAs further extend MDPs by exponentially distributed continuous time delays. Rewards can be attached to states or transitions to model system quantities such as energy consumption, productivity, or monetary costs. Objectives are formally specified by a mapping from (infinite) system executions to the value of interest, i.e., the total accumulated costs or the average energy consumption. The expected value of an objective is defined once the nondeterminism is resolved using a strategy — intuitively reflecting the choices of a system controller. Different strategies induce different expected objective values. Multi-objective verification of MDPs and MAs analyzes the interplay between the considered objectives and identifies which trade-offs between expected objective values are possible, i.e., achievable by some strategy. We study practically efficient methods to compute the set of achievable solutions. For this, we establish a general framework and its instantiation for (undiscounted) total reachability reward objectives, long-run average reward objectives, and reward-bounded objectives. We propagate the errors made by approximative methods, yielding sound under- and over-approximations. We further consider multi-dimensional quantiles that ask under which reward constraints a given objective value is achievable. Finally, we investigate a setting in which the strategies must be simple, i.e., non-randomized and with limited memory access. All presented approaches are integrated into the state-of-the-art probabilistic model checker Storm. An extensive evaluation of this implementation on a broad set of multi-objective benchmarks shows that our approaches scale to large models with millions of states. Es laden ein: die Dozentinnen und Dozenten der Informatik

1 0

Einladung: Informatik-Oberseminar Jan Pennekamp
by Förster, Claudia 14 Aug '23

14 Aug '23

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Freitag, 22. September 2023, 11:00 Uhr Ort: Seminarraum Informatik 4 (COMSYS) - 9007, E3, Ahornstr. 55 [1] Digitaler Zugang (hybrider Vortrag): https://rwth.zoom.us/j/63466099726?pwd=eUN1QTRISUZmSEFzUnhnSXdRSW5CZz09 (Meeting-ID: 634 6609 9726 Kenncode: 269470) Referent: Jan Pennekamp M.Sc. Lehrstuhl Informatik 4 (COMSYS) Thema: Secure Collaborations for the Industrial Internet of Things Abstract: The Industrial Internet of Things (IIoT) leads to increasingly-interconnected and networked industrial processes and environments, which, in turn, results in stakeholders collecting a plethora of information. Even though the global sharing of information and industrial collaborations in the IIoT promise significant improvements concerning productivity, sustainability, and product quality, among others, information is still commonly encapsulated locally. Confidentiality concerns are the primary roadblock to fully realizing the aforementioned improvements. We address this mission-critical research gap. Since existing concepts for sharing information do not scale to industry-sized applications in the IIoT, we present solutions that enable secure collaborations in the IIoT while providing technical (confidentiality) guarantees to the involved stakeholders. Our research is crucial (i) for demonstrating the potential and added value of (secure) collaborations and (ii) for convincing cautious stakeholders of the utility and benefits of technical building blocks that reliably enable confidential information sharing, even among direct competitors. Our interdisciplinary research thus focuses on establishing and realizing secure industrial collaborations in the IIoT. We rely on well-established building blocks from private computing (i.e., privacy-preserving computations and confidential computing) to reliably realize them. We thoroughly evaluate each of our designs using multiple real-world use cases from the domain of production technology to attest their practical feasibility for the IIoT. By applying private computing, we are indeed able to reliably secure collaborations that not only scale to industry-sized applications but also allow for use case-specific configurations of confidentiality guarantees. Overall, given the expected improvements, our research should greatly contribute to convincing even cautious stakeholders to participate in (reliably-secured) industrial collaborations. Our work is an essential first step for establishing widespread information sharing between stakeholders in the IIoT, and it stresses four crucial aspects: (i) collaborations can be secured reliably, and we can even provide technical guarantees while doing so, (ii) building blocks from private computing scale to industrial applications and satisfy the outlined confidentiality needs, (iii) improvements that follow from industrial collaborations are within reach, even when dealing with cautious stakeholders, and (iv) the interdisciplinary development of sophisticated yet appropriate designs for use case-driven secure collaborations can succeed in practice. Es laden ein: die Dozentinnen und Dozenten der Informatik [1] https://www.comsys.rwth-aachen.de/fileadmin/misc/how-to-get-to-comsys.pdf -- Jan Pennekamp, M.Sc., Ph.D. Student Chair of Communication and Distributed Systems RWTH Aachen University, Germany tel: +49 241 80 21411 web: https://www.comsys.rwth-aachen.de/team/jan-pennekamp/

1 0

Einladung: Informatik-Oberseminar Julian Miller
by Miller, Julian 07 Aug '23

07 Aug '23

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Freitag, 18.08.2023, 09:00 Uhr Ort: IT Center, Kopernikusstraße 6, Seminarraum 001 Referent: Julian Miller M.Sc. Lehrstuhl Informatik 12 Thema: Pattern-based Abstractions for Parallel Programs Abstract: The computational demands in sciences and engineering are quickly rising with the increasing complexities of simulation and the availability of extensive data. This demand is satisfied with large clusters of computers and specialized hardware accelerators. However, programming such systems is challenging and time-consuming, and the massive concurrency is error-prone. The software developers are faced with deriving a well-scaling solution while preserving correctness. These development challenges are aggravated by the quickly evolving hardware landscape of high-performance computing (HPC). This work investigates the key challenges when developing highly productive and performant parallel programs. This analysis is based on extensive human-subject studies with a diverse set of parallel programs and programmers. It uncovers quantitative and measurable productivity metrics, the main impact factors for developing parallel programs efficiently, and cost estimation methods for developing software. Based on this analysis, an abstract model of parallel algorithms is proposed to mitigate these challenges. It is based on a strict separation between the algorithmic structure of a program and its executed functions. Rich and high-level optimization potentials are revealed by decomposing parallel programs into a hierarchical structure of parallel patterns. A static performance model and optimization and scheduling algorithms are introduced to leverage these optimization potentials. A proof of concept development pipeline is proposed exposing this pattern-based programming approach to software developers: First, parallel programs may be specified in the proposed Parallel Pattern Language (PPL) that closely follows the mathematical definition of parallel algorithms. Alternatively, existing codes can be translated into the proposed hierarchical pattern structure with pattern- detection methods. Second, the hierarchical pattern structure is extracted and global transformations are applied to minimize the overall runtime for a target hardware architecture. Third, the optimized code and its scheduling are generated in a source-to-source fashion for heterogeneous systems with shared and distributed memory and accelerators. The proposed approach and proof of concept implementation are evaluated on real-world parallel algorithms. Es laden ein: die Dozentinnen und Dozenten der Informatik

1 0

Einladung: Informatik-Oberseminar Matthias Ehlenz
by Ehlenz, Matthias 07 Aug '23

07 Aug '23

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Freitag, 18. August 2023, 14.00 Uhr Der öffentliche Vortrag findet hybrid statt: Ort: Raum 5053.2 (großer B-IT-Hörsaal)/Informatikzentrum, Ahornstraße 55 Zoom: https://rwth.zoom.us/j/67829456459?pwd=RFM0SjNPb2xidzNIT0xJMUg1UkZGQT09 Meeting-ID: 678 2945 6459 Kenncode: 280923 Referent: Dipl.-Gyml. Matthias Ehlenz Lehr- und Forschungsgebiet Informatik 9 (Lerntechnologien) Thema: A Sustainable Research & Development Ecosystem for Computer-Supported Collaborative Learning with Interactive Tabletop Displays Abstract: Computer-supported learning processes are of consistently increasing importance for education. Considering innovative platforms, interactive tabletops provide distinct advantages: They introduce automated feedback, individualization capabilities, and interaction mechanics that enable self-regulated learning in computer-supported collaborative learning processes. They allow truly equal, simultaneous interaction. At the same time, the strengths of face-to-face communication of traditional group work are preserved. Additionally, the digitization of collaborative face-to-face learning opens new research opportunities by enabling the usage of methods from learning analytics and introducing innovative ways of multi-modal data collection. Still, we do not know much about the practical impact of interactive tabletops on the learning process and successful usage in education requires the tuning of content and media to fit each other. Previous promising technologies missed out on their potential by lacking content, research, and sustainable concepts. This dissertation aims to help overcome obstacles and thus enable interactive tabletops to have a positive impact on future education. Assisting developers and educators to implement open-source learning games, providing interdisciplinary research teams with methods and tools to produce highly configurable research prototypes and partake in open science, and enabling teachers to improve their students' learning by providing insights through the open learning analytics infrastructure: The Multi-Touch Learning Game (MTLG) ecosystem is intended to take a holistic approach on facilitating interactive tabletops for better learning experiences. This dissertation provides a systematic approach to the requirements of, research on and educational use of interactive tabletop systems. The MTLG ecosystem presents an integrated research and prototyping framework for collaborative learning with interactive tabletop displays. The components are the MTLG core and toolchain (fundamental building blocks for the rapid creation of capable research prototypes); the MTLG infrastructure (server-side components for connecting sessions across devices, managing users and more); the MTLG research components (supporting experimental setups). Considering scientific sustainability, this dissertation goes beyond technical aspects and slightly beyond the scope of this project. In an interdisciplinary effort a sustainable, science-driven proposal for a learning analytics metadata infrastructure has been developed. The overall evaluation is done in a threefold approach: First, case studies are presented to show research in depth. Second, the broad applicability is shown by presenting learning applications of different scopes and subjects. Third, a technical prototype and a corresponding case study are presented to showcase the interplay of components. Conclusively, this dissertation presents a coherent ecosystem of software, methods, and infrastructure to research collaborative learning processes involving interactive tabletop displays, large multi-touch systems placed horizontally for face-to-face learning in groups. Es laden ein: die Dozentinnen und Dozenten der Informatik Dipl.-Gyml. Matthias Ehlenz Koordination & Konzeption MediaLab Lehrerbildungszentrum der RWTH Aachen Kármánstr. 17-19 52062 Aachen +49 241 80 96 435 Ehlenz(a)lbz.rwth-aachen.de<mailto:Ehlenz@lbz.rwth-aachen.de> www.lbz.rwth-aachen.de<http://www.lbz.rwth-aachen.de/>

1 0

TODAY UnRAVeL Survey Lecture: "Biggest Milestones"
by Kassing, Jan-Christoph 13 Jul '23

13 Jul '23

Dear all, this is a reminder for Joost-Pieter Katoen's talk with the title "Can we meet the deadline? Most probably: yes!" taking place today at 12:30 in the B-IT room 5053.2. Please find the details below --- Abstract --- Continuous-time Markov chains are used in systems biology, classical performance evaluation, reliability engineering, physics, and so on. We study a the following analysis problem for CMTCs: how to compute the probability to reach a certain target state within a given deadline? Phrased more practically: how likely is it that all substrates have turned into products in a catalytic chemical reaction within a week? We will show that this probability can be characterised as a unique solution of a Volterra integral equation system, whose computation can be reduced to transient analysis of a slightly modified CTMC. We will show why this problem is of practical relevance, that it can be efficiently solved on CTMCs with millions of states, and why its natural generalisation to stochastic scheduling problems is hard. This result was published in 1999, received a test-of-time award in 2022, and forms the ingredient of many state-of-the-art CTMC tools. ---------------- Part of the programme of the research training group UnRAVeL is a series of lectures on the topics of UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is given by one of the researchers involved in UnRAVeL. This years topic is "Biggest Milestones - Research at Its Peak", UnRAVeL professors will present the most important milestone of their respective research. All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2023 and engage in discussions with researchers and doctoral students. Note that this is the last lecture for this year! We are looking forward to seeing you today. Kind regards, Jan-Christoph for the organisation committee

1 0