Current Projects

Research Projects at the Institute

USA-funded Projects

EU-funded Projects

AT-funded Projects

IoT4CPS: Trustworthy IoT for CPS

IoT4CPS: Trustworthy IoT for CPS

Funding: AT-FFG

Partners: TU Wien, Austrian Institut of Technology (AIT), Institute of Science and Technology (IST), AVL List GmbH, Donau Uni Krems, Infineon Technologies AG, JKU Linz, Joanneum, NOKIA Österreich, NXP, Salzburg Research, SBA Research, SCCH, Siemens AG Österreich, TTTech Computertechnik AG, TU Graz, X-Net Services GmbH

Time Frame: 01. 12. 2017 - 30. 11. 2020

Contact Persons: Ezio Bartocci (project leader), Radu Grosu, Muhammad Shafique, Gerda Belkhofer-Fohrafellner (admin)

Research Team: Ezio Bartocci (project leader), Radu Grosu, Faiq Khalid, Denise Ratasich, Muhammad Shafique

IoT4CPS will develop guidelines, methods and tools to enable safe and secure IoT-based applications for automated driving and for smart production. The project will address safety and security aspects in a holistic approach both along the specific value chains and the product life cycles. To ensure the outreach of the project activities and results, the relevant stakeholders will be involved throughout the project and results will be disseminated to expert groups and standardization bodies. IoT4CPS will support digitalization along the entire product lifecycle, leading to a time-to-market acceleration for connected and autonomous vehicles. IoT4CPS will provide innovative components, leading to efficiency increases for the deployment of autonomous driving functions and in smart production environments, which will be validated in a vehicle and in a smart production demonstrator.

Gracefully Degrading Agreement in Directed Dynamic Networks

Funding: Austrian Science Fund (FWF)

Time Frame: 01. 01. 2016 - 31. 12. 2018

Contact Persons: Ulrich Schmid

Research Team: Ulrich Schmid, Kyrill Winkler, Martin Zeiner

This project is devoted to the development of the theoretical foundations, models, algorithms and analysis techniques for relaxed distributed agreement in directed dynamic networks. Such networks are characterized by (i) sets of participants (processes) that are a priori unknown and potentially time-varying, (ii) rapidly changing uni-directional connectivity between processes, and (iii) the absence of central control. Instantiated, e.g., by (wireless) sensor networks and ad-hoc networks, such dynamic networks are becoming ubiquitous in many applications nowadays. A natural approach to build robust services despite the dynamic nature of such networks would be to use distributed consensus to agree system-wide on (fundamental) parameters like schedules, operating frequencies, operating modes etc. Unfortunately, however, in larger-scale dynamic networks, this is usually impossible, since solving consensus requires a well-connected and temporarily stable network topology. In order to overcome this fundamental limitation, we propose to consider gracefully degrading variants of consensus, in particular, approximate agreement, where decision values may slightly deviate from each other, and k-set agreement, which may deliver up to k different decisions in case of bad network conditions that e.g. lead to k isolated network partitions. In our project, we will develop network assumptions that both allow to solve, say, k-set agreement, and have some reasonable assumption coverage in real systems. Therefore, our focus will be on weakest (necessary and sufficient) conditions and the analysis of the resulting assumption coverage. Other central part of our project is the development of solution algorithms and their correctness proofs. Particular emphasis will be put on performance of our algorithms, since there is a tradeoff between weak network conditions and the communication and memory complexity of solutions algorithms. Overall, the project shall yield new insights into the fundamental limitations of dynamic networks as well as the development of novel algorithms that solve distributed agreement problems reliably even under very weak communication guarantees.


National Research Network RiSE/SHiNE (PP05)

Funding: Austrian Science Fund (FWF)

Partners: Graz University of Technology (coordinator), Vienna University of Technology, Institute of Science and Technology Austria, Johannes Kepler University Linz, University of Salzburg.

Time Frame: 01. 03. 2015 - 01. 03. 2019

Contact Persons: Ulrich Schmid

Research Team: Ulrich Schmid, Ezio Bartocci, Matthias Függer, Martin Zeiner, Kyrill Winkler

RiSE/SHiNE pursues the long term vision of a hardware/software system design process supported by automatic formal methods based on model checking, decision procedures, and game theory. Simultaneously, the National Research Network has the strategic goal to establish and strengthen Austria as an international hot spot in this research area. In the first three years of the 4-year funding period (Period I), we have made important steps towards both the scientific and the strategic goal. A key lesson from Period I was that non-functional aspects of system quality and correctness are critical, hard to achieve manually, and highly amenable to rigorous reasoning. We view the second period of RiSE 2015–2019 as an opportunity to position Computer Aided Verification closer to other fields of computer science which address non-functional aspects in a rigorous manner. In Period II, nine Project Part Leaders and six (mostly) junior Task Leaders will build upon the foundations established in the first years. The new Tasks that we propose either derive from a cross cutting “collaboration topic” of Period I or are new topics introduced by the recently hired faculty. All Tasks will be jointly investigated by two PIs. While the Research Clusters of Period I reflected the individual expertise of the PIs, we will now organize our Tasks along intersecting Research Lines. Each Research Line of Period II will address a non-functional aspect such as concurrency, probabilistic behavior, reliability, and quantitative measures (timing and resource consumption). This focus reflects a broader understanding of correctness beyond the Boolean notion of functional correctness that was central in Period I. Thus, our thrust will go beyond verification of functional specifications to computer aided design of programs that fulfill both functional and non-functional properties. We have therefore subtitled the second funding Period Systematic Methods in Systems Engineering, or SHiNE. SHiNE project part PP05: Reconciling Distributed and Real-Time Computing (Schmid, Bartocci). Modern distributed systems, ranging from systems-on-chip (SoC) to electronic commerce networks, must be resilient to failures and maintain specified response time bounds. The Tasks of PP05 is devoted to a continuous-time modeling & analysis framework for such systems:

    • Task US1: Modeling and Analysis of Distributed Systems with Non-Zero-Time Computations (Applications). The abstraction of discrete, instantaneous state transitions inherently “defines away” queueing and scheduling issues and thus does not adequately match real systems. The situation is even worse in case of algorithms implemented in hardware, as abstracting continuous computations by discrete state transitions “defines away” metastability of discrete-valued signals/states and the impossibility to build an arbiter. The problem is further exacerbated by incorporating fault-tolerance, in particular, self-stabilization, which requires solutions that recover from system states without any synchrony. In a collaboration with PP07 (Chatterjee), which has already been established in RiSE, PP02 (Henzinger) and PP08 (Biere), we will develop the foundations and solution methods for a suitable real-time analysis framework.
    • Task EBUS2: Modeling and Analysis of Parametric, Probabilistic and Parameterized Timed Systems (Ezio Bartocci) (Applications). To master the overwhelming complexity of manual correctness proofs of continuous-time distributed systems, computer-aided methods that can deal with symbolic timing parameters (“parametric”) and symbolic system sizes (“parameterized”) are required. Besides the question of how to deal with the overwhelming complexity, answering the question of how to incorporate (probabilistic) faults will be addressed in collaboration with PP12 (Grosu), PP07 (Chatterjee) and PP11 (Kirsch). In order to extend our framework to also cover message-passing distributed systems with parameterized system size, novel abstraction techniques and/or cutoff results will be developed in a collaboration with PP03 (Veith).